-
Notifications
You must be signed in to change notification settings - Fork 2
/
milkorder.cpp
64 lines (60 loc) · 1.47 KB
/
milkorder.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
59
60
61
62
63
64
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> obs[50000];
vector<int> solve(int X){
vector<int> dag[100000];
int deg[100000];
fill(deg, deg+N, 0);
for(int i = 0; i < X; i++){
for(int j = 1; j < (int)obs[i].size(); j++){
dag[obs[i][j-1]].push_back(obs[i][j]);
deg[obs[i][j]]++;
}
}
vector<int> ret;
priority_queue<int, vector<int>, greater<int>> pq;
for(int i = 0; i < N; i++){
if(!deg[i]){
pq.push(i);
}
}
while(!pq.empty()){
int id = pq.top();
pq.pop();
ret.push_back(id);
for(int i : dag[id]){
if(!(--deg[i])){
pq.push(i);
}
}
}
return ret;
}
int32_t main(){
freopen("milkorder.in", "r", stdin);
freopen("milkorder.out", "w", stdout);
scanf("%d%d", &N, &M);
for(int i = 0; i < M; i++){
int m; scanf("%d", &m);
for(int j = 0; j < m; j++){
int x; scanf("%d", &x);
obs[i].push_back(x-1);
}
}
int lo = 0, hi = M, mid = 0;
while(lo < hi){
mid = (lo + (hi-lo)/2);
if((int)solve(mid).size() < N){
hi = mid-1;
}else{
lo = mid+1;
}
}
while((int)solve(mid).size() == N) mid++;
while((int)solve(mid).size() < N) mid--;
vector<int> ans = solve(mid);
for(int i = 0; i < N; i++){
printf((i == N-1 ? "%d\n" : "%d "), ans[i]+1);
}
}