Submission #3775153
Source Code Expand
N,M=map(int,input().split()) flag = False v=[] for i in range(M): a,b=map(int,input().split()) v.append([a,b]) for i in range(M): for j in range(M): if v[i][1]==N: if v[j][1]==v[i][0] and v[j][0]==1: flag=True break if flag: print("POSSIBLE") break else: print("IMPOSSIBLE")
Submission Info
Submission Time | |
---|---|
Task | C - Cat Snuke and a Voyage |
User | moro |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 378 Byte |
Status | TLE |
Exec Time | 2107 ms |
Memory | 36168 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 | 18 ms | 3060 KB |
example1 | AC | 18 ms | 3060 KB |
example2 | AC | 18 ms | 3060 KB |
example3 | AC | 18 ms | 3060 KB |
last0 | TLE | 2107 ms | 36168 KB |
last1 | TLE | 2107 ms | 36156 KB |
many0 | TLE | 2107 ms | 32928 KB |
many1 | TLE | 2107 ms | 32944 KB |
rand0 | TLE | 2106 ms | 24560 KB |
rand1 | TLE | 2107 ms | 35668 KB |
rand2 | TLE | 2105 ms | 21912 KB |