結果
問題 | No.261 ぐるぐるぐるぐる!あみだくじ! |
ユーザー |
![]() |
提出日時 | 2015-08-07 17:03:16 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,231 bytes |
コンパイル時間 | 2,369 ms |
コンパイル使用メモリ | 110,976 KB |
実行使用メモリ | 19,712 KB |
最終ジャッジ日時 | 2024-07-18 05:00:17 |
合計ジャッジ時間 | 4,137 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
19,456 KB |
testcase_01 | AC | 32 ms
19,456 KB |
testcase_02 | AC | 33 ms
19,072 KB |
testcase_03 | AC | 44 ms
19,456 KB |
testcase_04 | AC | 34 ms
19,456 KB |
testcase_05 | AC | 34 ms
19,584 KB |
testcase_06 | AC | 45 ms
19,456 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { public void Solve() { int N = Reader.Int(), K = Reader.Int(); var table = Reader.IntTable(K); int Q = Reader.Int(); var A = Reader.IntTable(Q).Select(r => r.Select(c => c - 1).ToArray()).ToArray(); var prevPos = Enu.Range(0, N).ToArray(); foreach (var t in table) Swap(ref prevPos[t[0] - 1], ref prevPos[t[1] - 1]); var seen = new bool[N]; var uf = new UnionFind(N); var dist = new int[N, N]; for (int a = 0; a < N; a++) for (int b = 0; b < N; b++) dist[a, b] = N + 1; for (int i = 0; i < N; i++) if (!seen[i]) for (int x = i; !seen[x]; x = prevPos[x]) { seen[x] = true; uf.Unite(i, x); dist[x, prevPos[x]] = 1; } for (int c = 0; c < N; c++) for (int a = 0; a < N; a++) for (int b = 0; b < N; b++) dist[a, b] = Math.Min(dist[a, b], dist[a, c] + dist[c, b]); foreach (var a in A) Console.WriteLine(Calc(N, a, dist, uf)); } private long Calc(int N, int[] who, int[,] dist, UnionFind uf) { long ans = 1; for (int a = 0; a < N; a++) { if (dist[a, who[a]] > N) return -1; ans = LCM(ans, dist[a, who[a]]); for (int b = 0; b < N; b++) if (uf.Same(a, b) && dist[a, who[a]] != dist[b, who[b]]) return -1; } return ans; } static void Swap<T>(ref T a, ref T b) { T t = a; a = b; b = t; } static long GCD(long a, long b) { while (b != 0) { long r = a % b; a = b; b = r; } return a; } static long LCM(long a, long b) { return a / GCD(a, b) * b; } class UnionFind { private int[] parent; private int[] rank; private int[] numElements; public UnionFind(int N) { parent = new int[N]; rank = new int[N]; numElements = new int[N]; for (int i = 0; i < N; i++) { parent[i] = i; numElements[i] = 1; } } public int Root(int x) { if (parent[x] == x) return x; return parent[x] = Root(parent[x]); } public bool Same(int x, int y) { return Root(x) == Root(y); } public int NumElements(int x) { return numElements[Root(x)]; } public bool Unite(int x, int y) { x = Root(x); y = Root(y); if (x == y) return false; if (rank[x] > rank[y]) { var t = x; x = y; y = t; } if (rank[x] == rank[y]) rank[y]++; parent[x] = y; numElements[y] += numElements[x]; return true; } public List<int>[] Components() { var dic = new Dictionary<int, List<int>>(); for (int i = 0; i < parent.Length; i++) { int root = Root(i); if (!dic.ContainsKey(root)) dic[root] = new List<int>(); dic[root].Add(i); } return dic.Values.ToArray(); } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }