Submission #1337922
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); var offset = n - swapping % n * sign[0]; var finalPosition = new long[n]; for (int i = 0; i < n; ++i) { var k = (i + offset) % n; finalPosition[k] = PositiveMod(xs[i] - last * sign[i], l); } Console.WriteLine(string.Join("\n", finalPosition)); } 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 | 1487 Byte |
Status | WA |
Exec Time | 202 ms |
Memory | 36020 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
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 | 11604 KB |
sample_02.txt | AC | 32 ms | 11604 KB |
subtask_1_01.txt | WA | 136 ms | 28484 KB |
subtask_1_02.txt | WA | 119 ms | 24520 KB |
subtask_1_03.txt | WA | 202 ms | 33456 KB |
subtask_1_04.txt | WA | 199 ms | 31408 KB |
subtask_1_05.txt | WA | 59 ms | 19676 KB |
subtask_1_06.txt | WA | 72 ms | 23384 KB |
subtask_1_07.txt | WA | 194 ms | 33716 KB |
subtask_1_08.txt | WA | 194 ms | 36020 KB |
subtask_1_09.txt | WA | 135 ms | 23364 KB |
subtask_1_10.txt | WA | 126 ms | 24392 KB |
subtask_1_11.txt | AC | 58 ms | 21852 KB |
subtask_1_12.txt | AC | 184 ms | 34740 KB |
subtask_1_13.txt | WA | 146 ms | 27200 KB |
subtask_1_14.txt | WA | 138 ms | 30532 KB |
subtask_1_15.txt | AC | 32 ms | 11604 KB |
subtask_1_16.txt | AC | 32 ms | 9556 KB |