Submission #2558722
Source Code Expand
#include <cstdio> using namespace std; const int N = 2e5 + 10; int n, m, uni[N]; inline int Find(int x) {return x == uni[x] ? x : uni[x] = Find(uni[x]);} template <class T> inline void in(T &x) { x = 0; int f = 1; char ch = getchar(); for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();} for (; ch>='0' && ch<='9';) x = x*10 + ch-'0', ch = getchar(); x *= f; } inline void work() { int u, v; in(n), in(m); for (int i = 1; i <= n; ++i) uni[i] = i; for (int i = 1; i <= m; ++i) in(u), in(v), uni[Find(u)] = Find(v); if (Find(1) == Find(n)) puts("POSSIBLE"); else puts("IMPOSSIBLE"); } int main() {work(); return 0;}
Submission Info
Submission Time | |
---|---|
Task | C - Cat Snuke and a Voyage |
User | annoyrain |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 665 Byte |
Status | WA |
Exec Time | 32 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2, example3 |
All | example0, example1, example2, example3, last0, last1, many0, many1, rand0, rand1, rand2 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example0 | AC | 1 ms | 128 KB |
example1 | WA | 1 ms | 128 KB |
example2 | AC | 1 ms | 512 KB |
example3 | AC | 1 ms | 128 KB |
last0 | AC | 32 ms | 896 KB |
last1 | AC | 29 ms | 896 KB |
many0 | AC | 19 ms | 896 KB |
many1 | AC | 19 ms | 896 KB |
rand0 | WA | 17 ms | 896 KB |
rand1 | WA | 28 ms | 896 KB |
rand2 | AC | 15 ms | 896 KB |