Submission #1473543
Source Code Expand
import strutils, sequtils, algorithm let tmp = stdin.readline.split.map(parseInt) (N, L, T) = (tmp[0], tmp[1].int64, tmp[2].int64 mod tmp[1].int64) var ants = newSeq[(int64, int)](N) res = newSeq[int64](N) for i in 0..<N: let ant = stdin.readline.split.map(parseInt) ants[i] = (ant[0].int64, ant[1] - 1) res[i] = (ant[0].int64 + @[1, -1][ant[1] - 1].int64 * T + L) mod L res.sort(cmp) var cnt = 0.int64 let (a0, w0) = ants[0] for ant in ants: let (a1, w1) = ant if w0 != w1: var d = (a0 * @[-1, 1][w0].int64 + a1 * @[-1, 1][w1].int64 + L) mod L if d <= T * 2: cnt = (cnt + 1.int64 + ((T.float - d.int / 2) / L.float).int64) mod N let start = (res.find((a0 + @[1, -1][w0].int64 * T + L) mod L) + cnt * @[-1, 1][w0] + N) mod N for i in 0..<N: res[(start.int + i) mod N].echo
Submission Info
Submission Time | |
---|---|
Task | C - Ants on a Circle |
User | n_knuu |
Language | Nim (0.13.0) |
Score | 0 |
Code Size | 836 Byte |
Status | WA |
Exec Time | 222 ms |
Memory | 4352 KB |
Compile Error
Hint: system [Processing] Hint: Main [Processing] Hint: strutils [Processing] Hint: parseutils [Processing] Hint: sequtils [Processing] Hint: algorithm [Processing] Hint: [Link] Hint: operation successful (13326 lines compiled; 1.906 sec total; 14.148MB; Release Build) [SuccessX]
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | WA | 135 ms | 2688 KB |
subtask_1_02.txt | WA | 108 ms | 2048 KB |
subtask_1_03.txt | WA | 219 ms | 4352 KB |
subtask_1_04.txt | WA | 222 ms | 4352 KB |
subtask_1_05.txt | WA | 35 ms | 896 KB |
subtask_1_06.txt | WA | 51 ms | 1280 KB |
subtask_1_07.txt | WA | 216 ms | 4096 KB |
subtask_1_08.txt | WA | 220 ms | 4096 KB |
subtask_1_09.txt | WA | 141 ms | 2560 KB |
subtask_1_10.txt | WA | 122 ms | 2176 KB |
subtask_1_11.txt | AC | 29 ms | 768 KB |
subtask_1_12.txt | AC | 196 ms | 3968 KB |
subtask_1_13.txt | AC | 139 ms | 2816 KB |
subtask_1_14.txt | AC | 129 ms | 2560 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |