Submission #3417810
Source Code Expand
#include <algorithm> #include <iostream> #include <vector> using namespace std; int main(){ int N, M; cin >> N >> M; vector<int> C(N,0); for(int i = 0; i < M; ++i){ int a, b; cin >> a >> b; --a,--b; if(!a) ++C[b]; if(b == N-1) ++C[a]; } if(*max_element(C.begin(), C.end()) > 1) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cat Snuke and a Voyage |
User | TAB |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 410 Byte |
Status | AC |
Exec Time | 117 ms |
Memory | 1024 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 | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 640 KB |
example3 | AC | 1 ms | 256 KB |
last0 | AC | 117 ms | 1024 KB |
last1 | AC | 117 ms | 1024 KB |
many0 | AC | 107 ms | 1024 KB |
many1 | AC | 107 ms | 1024 KB |
rand0 | AC | 76 ms | 896 KB |
rand1 | AC | 114 ms | 1024 KB |
rand2 | AC | 69 ms | 896 KB |