Submission #1519117
Source Code Expand
// C. #include <iostream> #include <algorithm> #include <sstream> #include <cstdio> #include <cstring> #include <set> using namespace std; //typedef pair<int, int> II; //typedef set<II> IISet; int main(int argc, char *argv[]) { bool ans = false; int n, m; cin >> n >> m; // IISet s; set<int> s[200001]; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; s[a].insert(b); s[b].insert(a); } for (int a : s[1]) { if (s[a].find(n) != s[a].end()) { ans = true; break; } } cout << (ans ? "POSSIBLE" : "IMPOSSIBLE") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cat Snuke and a Voyage |
User | hotpepsi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 601 Byte |
Status | AC |
Exec Time | 275 ms |
Memory | 28416 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 5 ms | 9600 KB |
example1 | AC | 5 ms | 9600 KB |
example2 | AC | 5 ms | 9600 KB |
example3 | AC | 5 ms | 9600 KB |
last0 | AC | 204 ms | 28416 KB |
last1 | AC | 215 ms | 28416 KB |
many0 | AC | 261 ms | 28416 KB |
many1 | AC | 275 ms | 28416 KB |
rand0 | AC | 143 ms | 21760 KB |
rand1 | AC | 225 ms | 28160 KB |
rand2 | AC | 114 ms | 20352 KB |