Submission #1494444
Source Code Expand
n,l,t=map(int,input().split()) a,cs=[0]*n,0 for i in range(n): x,y=map(int,input().split()) x+=(t if y==1 else -t) cs=(cs+x//l)%n x%=l if x<0: x+=l cs-=1 a[i]=x a.sort() print('\n'.join([str(a[(i+cs+n)%n]) for i in range(n)]))
Submission Info
Submission Time | |
---|---|
Task | C - Ants on a Circle |
User | fts2001 |
Language | PyPy3 (2.4.0) |
Score | 700 |
Code Size | 248 Byte |
Status | AC |
Exec Time | 573 ms |
Memory | 60888 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 160 ms | 38384 KB |
sample_02.txt | AC | 158 ms | 38256 KB |
subtask_1_01.txt | AC | 475 ms | 55384 KB |
subtask_1_02.txt | AC | 386 ms | 50136 KB |
subtask_1_03.txt | AC | 548 ms | 60888 KB |
subtask_1_04.txt | AC | 558 ms | 59480 KB |
subtask_1_05.txt | AC | 284 ms | 44376 KB |
subtask_1_06.txt | AC | 306 ms | 45912 KB |
subtask_1_07.txt | AC | 573 ms | 55896 KB |
subtask_1_08.txt | AC | 556 ms | 56024 KB |
subtask_1_09.txt | AC | 441 ms | 51800 KB |
subtask_1_10.txt | AC | 419 ms | 50136 KB |
subtask_1_11.txt | AC | 275 ms | 44376 KB |
subtask_1_12.txt | AC | 515 ms | 57304 KB |
subtask_1_13.txt | AC | 444 ms | 53720 KB |
subtask_1_14.txt | AC | 436 ms | 52728 KB |
subtask_1_15.txt | AC | 159 ms | 38256 KB |
subtask_1_16.txt | AC | 158 ms | 38256 KB |