Submission #1337977


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

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 8
WA × 12
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 33 ms 9556 KB
sample_02.txt AC 33 ms 9556 KB
subtask_1_01.txt WA 140 ms 24388 KB
subtask_1_02.txt WA 119 ms 28616 KB
subtask_1_03.txt WA 210 ms 31408 KB
subtask_1_04.txt WA 210 ms 31408 KB
subtask_1_05.txt WA 64 ms 17628 KB
subtask_1_06.txt WA 73 ms 17240 KB
subtask_1_07.txt WA 197 ms 33716 KB
subtask_1_08.txt WA 204 ms 30004 KB
subtask_1_09.txt WA 140 ms 25412 KB
subtask_1_10.txt WA 132 ms 26440 KB
subtask_1_11.txt AC 58 ms 17756 KB
subtask_1_12.txt AC 191 ms 34740 KB
subtask_1_13.txt WA 147 ms 27200 KB
subtask_1_14.txt WA 143 ms 30532 KB
subtask_1_15.txt AC 34 ms 13652 KB
subtask_1_16.txt AC 33 ms 11604 KB