Submission #1349179


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();

        t %= l;
        var xs = ants.Select(x => x.pos).ToArray();
        var ws = ants.Select(x => x.dir).ToArray();
        var signs = ws.Select(w => w * 2 - 3).ToArray(); // clockwise: -1, counterclockwise: 1
        var swapping = Enumerable.Range(0, n)
            .Where(i => ws[i] != ws[0])
            .Count(i => PositiveMod((xs[0] - xs[i]) * signs[0], l) <= 2 * t);

        for (int i = 0; i < n; ++i)
        {
            xs[i] = PositiveMod(xs[i] - t % l * signs[i], l);
        }
        swapping = (n - swapping * signs[0]) % n;
        var ys = xs
            .Select((x, i) => new { x, i })
            .OrderBy(x => x.x)
            .ToArray();
        var o = (ys.TakeWhile(x => x.i != 0).Count() - swapping + n) % n;
        Console.WriteLine(string.Join("\n", Enumerable.Concat(ys, ys).Skip(o).Take(n).Select(x => x.x)));
    }

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

Submission Info

Submission Time
Task C - Ants on a Circle
User nitumeta339
Language C# (Mono 4.6.2.0)
Score 0
Code Size 1598 Byte
Status WA
Exec Time 309 ms
Memory 39880 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 10
WA × 10
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 42 ms 11860 KB
sample_02.txt AC 42 ms 11860 KB
subtask_1_01.txt WA 196 ms 31680 KB
subtask_1_02.txt WA 161 ms 29128 KB
subtask_1_03.txt WA 305 ms 35904 KB
subtask_1_04.txt WA 309 ms 39880 KB
subtask_1_05.txt WA 79 ms 23640 KB
subtask_1_06.txt WA 97 ms 23128 KB
subtask_1_07.txt WA 288 ms 35764 KB
subtask_1_08.txt WA 302 ms 34228 KB
subtask_1_09.txt WA 210 ms 32832 KB
subtask_1_10.txt WA 188 ms 33604 KB
subtask_1_11.txt AC 73 ms 18908 KB
subtask_1_12.txt AC 254 ms 37688 KB
subtask_1_13.txt AC 182 ms 32192 KB
subtask_1_14.txt AC 172 ms 29892 KB
subtask_1_15.txt AC 42 ms 11860 KB
subtask_1_16.txt AC 41 ms 11860 KB