Submission #8817743

---

Source Code Expand

def main():
    n,l,t = map(int, input().split())
    ls = [list(map(int, input().split())) for _ in range(n)]
    ant1 = [(1+(t-(ls[i][0]-ls[0][0]))//l if t-(ls[i][0]-ls[0][0])>=0 else 0) if ls[i][1] == 2 else 0 for i in range(n)]
    ansls = [(t+ls[i][0])%l if ls[i][1] == 1 else (l+(ls[i][0]-t)%l if (ls[i][0]-t)%l<0 else (ls[i][0]-t)%l) for i in range(n)]
    ant1p = ansls[0]
    ansls.sort()
    ant1n = sum(ant1)%n
    s = 0
    for i in range(n):
        if ant1p == ansls[i]:
            s = i
            break
    ansls = ansls[s-ant1n:]+ansls[:s-ant1n]
    for i in range(n):
        print(ansls[i])

if __name__ == "__main__":
    main()

Submission Info

Judge Result