-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLuogu_P_1333.cpp
37 lines (37 loc) · 1.22 KB
/
Luogu_P_1333.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
#include <bits/extc++.h>
using namespace std;
namespace pbds = __gnu_pbds;
using ui = unsigned int;
using uli = unsigned long long int;
using li = long long int;
int main(void) {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
map<string, size_t> id;
vector<vector<size_t>> mp;
for (string s, t; cin >> s >> t;) {
auto sp = id.find(s);
if (sp == id.end()) sp = id.emplace(s, mp.size()).first, mp.emplace_back();
auto tp = id.find(t);
if (tp == id.end()) tp = id.emplace(t, mp.size()).first, mp.emplace_back();
mp[sp->second].emplace_back(tp->second),
mp[tp->second].emplace_back(sp->second);
}
if (mp.empty()) cout << "Possible", exit(0);
vector<bool> vis(mp.size());
vis[0] = true;
queue<size_t> q({0});
while (!q.empty()) {
size_t p = q.front();
q.pop();
for (size_t i : mp[p])
if (!vis[i]) vis[i] = true, q.emplace(i);
}
cout << (count(vis.begin(), vis.end(), true) == vis.size() &&
count_if(mp.begin(), mp.end(),
[](vector<size_t> const& c) {
return c.size() % 2 == 1;
}) <= 2
? "Possible"
: "Impossible");
return 0;
}