Submission #1531949
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(void) { int N,M; cin >> N >> M; int a[M]; int b[M]; int t1[M]; int t2[M]; int tmp1,tmp2; int count = 0; int count2 = 0; int count3 = 0; for( int i = 0; i < M; i++){ cin >> tmp1 >> tmp2; if(tmp1 == 1 || tmp2 == N){ a[count] = tmp1; b[count] = tmp2; count++; } } sort(a, a+count); sort(b, b+count); //puts(""); for( int i = 0; i < count ; i++){ //printf("%d %d\n",a[i],b[i]); if( a[i] == 1 && (count3 == 0 || t1[count3-1] != a[i])){ t1[count3] = b[i]; count3++; } if( b[i] == N && (count2 == 0 || t2[count2-1] != a[i])){ t2[count2] = a[i]; count2++; } } //puts(""); for( int i = 0; i < count3; i++){ for( int j = 0; j < count2; j++){ //printf("%d %d\n",t1[i],t2[j]); if( t1[i] == t2[j] ){ printf("POSSIBLE"); return 0; } if( t1[i] < t2[j] ){ if( (t2[j] - t1[i]) > 10000 ){ i += 1000; } break; } } } printf("IMPOSSIBLE"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cat Snuke and a Voyage |
User | toame |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1361 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 2560 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 | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
example3 | AC | 1 ms | 256 KB |
last0 | WA | 148 ms | 256 KB |
last1 | AC | 151 ms | 2304 KB |
many0 | TLE | 2103 ms | 2560 KB |
many1 | AC | 362 ms | 2560 KB |
rand0 | AC | 96 ms | 256 KB |
rand1 | AC | 148 ms | 2304 KB |
rand2 | AC | 85 ms | 256 KB |