Submission #1473539

---

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)
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 += 1.int64 + ((T.float - d.int / 2) / L.float).int64
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

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.909 sec total; 14.148MB; Release Build) [SuccessX]

Judge Result