Submission #1337962

---

Source Code Expand

using System;
using System.Linq;
using System.Collections.Generic;

public class Program
{
    public static void Main()
    {
        var nlt = Console.ReadLine().Split()
            .Select(x => long.Parse(x))
            .ToArray();
        var n = (int)nlt[0];
        var l = nlt[1];
        var t = nlt[2];
        var antsQuery =
            from i in Enumerable.Range(0, n)
            let ant = Console.ReadLine().Split()
                .Select(x => long.Parse(x))
                .ToArray()
            select new { pos = ant[0], dir = (int)ant[1] };
        var ants = antsQuery.ToArray();

        var xs = ants.Select(x => x.pos).ToArray();
        var ws = ants.Select(x => x.dir).ToArray();
        var sign = ws.Select(w => w * 2 - 3).ToArray(); // clockwise: -1, counterclockwise: 1

        var last = t % l;
        var swapping = Enumerable.Range(0, n)
            .Skip(1)
            .Where(i => ws[i] != ws[0])
            .Count(i => PositiveMod((xs[0] - xs[i]) * sign[0], l) <= 2 * last);
        swapping %= n;

        var finalPositions = new long[n];
        for (int i = 0; i < n; ++i)
        {
            var k = sign[i] == sign[0]
                ? PositiveMod(i - swapping * sign[i], n)
                : PositiveMod(i + swapping * sign[i], n);
            finalPositions[k] = PositiveMod(xs[i] - last * sign[i], l);
        }
        Console.WriteLine(string.Join("\n", finalPositions));
    }

    static long PositiveMod(long n, long mod)
        => n >= 0 ? n % mod : (n + mod) % mod;
}

Submission Info

Judge Result