-
Notifications
You must be signed in to change notification settings - Fork 0
/
deathgun.cpp
68 lines (65 loc) · 1.41 KB
/
deathgun.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
65
66
67
68
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef unordered_map<string, vector<string> > ms;
typedef unordered_map<string, int> mi;
typedef unordered_map<int, string> is;
typedef unordered_map<string, bool> mb;
ms adj;
mi in;
is order;
mi order2;
mb vis;
mb check;
int m;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> m;
int count = 1;
for (int i = 0; i < m; i++){
string a, b;
cin >> a;
if (!check[a]){
check[a] = 1;
order[-count] = a;
order2[a] = -count;
count++;
}
cin >> b;
if (!check[b]){
check[b] = 1;
order[-count] = b;
order2[b] = -count;
count++;
}
adj[b].push_back(a);
in[a]++;
}
priority_queue<int> q;
for (auto i: order){
if (in[i.second] == 0){
q.push(i.first);
vis[i.second] = 1;
}
}
int curr;
vector<string> ans;
while (!q.empty()){
curr = q.top();
q.pop();
//cout << curr << endl;
string val = order[curr];
ans.push_back(val);
for (auto i: adj[val]){
in[i] = max(0,in[i]-1);
if (in[i] == 0 && !vis[i]){
vis[i] = 1;
q.push(order2[i]);
}
}
}
for (auto i: ans){
cout << i << "\n";
}
}