-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy pathbreakingbad.cc
53 lines (49 loc) · 1.03 KB
/
breakingbad.cc
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
// https://open.kattis.com/problems/breakingbad
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
vvi g;
vi s;
bool ok = 1;
void dfs(int u, int k) {
s[u] = k;
for (int v : g[u])
if (!s[v]) dfs(v, k % 2 + 1);
else if (s[v] == k) ok = 0;
}
int main() {
cin.tie(0); ios::sync_with_stdio(0);
int n, m;
cin >> n;
map<string, int> map;
vector<string> items(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
items[i] = s;
map[s] = i;
}
g = vvi(n);
cin >> m;
for (int i = 0; i < m; i++) {
string s, t;
cin >> s >> t;
int u = map[s], v = map[t];
g[u].push_back(v);
g[v].push_back(u);
}
s = vi(n);
for (int i = 0; i < n; i++)
if (!s[i]) dfs(i, 1);
if (!ok) cout << "impossible\n";
else
for (int i = 1; i <= 2; i++) {
vector<string> r;
for (int j = 0; j < n; j++)
if (s[j] == i)
r.push_back(items[j]);
for (int j = 0; j < r.size(); j++)
cout << r[j] << " \n"[j == r.size() - 1];
}
}