forked from derekhh/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
favourite-sequence.cpp
58 lines (55 loc) · 1006 Bytes
/
favourite-sequence.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//favourite-sequence.cpp
//Favorite sequence
//Weekly Challenges - Week 12
//Author: derekhh
#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
#include<functional>
using namespace std;
vector<int> gr[1000001];
int indeg[1000001];
priority_queue<int, vector<int>, greater<int>> pq;
int main()
{
int n;
scanf("%d", &n);
int maxval = -1;
for (int i = 0; i < n; i++)
{
int len;
scanf("%d", &len);
int prev;
for (int j = 0; j < len; j++)
{
int tmp;
scanf("%d", &tmp);
if (tmp > maxval) maxval = tmp;
if (j != 0) gr[prev].push_back(tmp), indeg[tmp]++;
prev = tmp;
}
}
for (int i = 1; i <= maxval; i++)
{
if (indeg[i] == 0 && !gr[i].empty())
pq.push(i);
}
while (!pq.empty())
{
int next = pq.top();
printf("%d ", next);
pq.pop();
int sz = (int)gr[next].size();
for (int i = 0; i < sz; i++)
{
int node = gr[next][i];
indeg[node]--;
if (indeg[node] == 0)
pq.push(node);
}
}
printf("\n");
return 0;
}