結果
問題 | No.1306 Exactly 2 Digits |
ユーザー | fairy_lettuce |
提出日時 | 2020-12-03 01:52:05 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 12,769 bytes |
コンパイル時間 | 1,046 ms |
コンパイル使用メモリ | 120,160 KB |
実行使用メモリ | 46,316 KB |
平均クエリ数 | 1019.60 |
最終ジャッジ日時 | 2024-07-17 08:10:42 |
合計ジャッジ時間 | 36,005 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | RE | - |
testcase_02 | WA | - |
testcase_03 | RE | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | WA | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | RE | - |
testcase_23 | WA | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | WA | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | WA | - |
testcase_34 | RE | - |
testcase_35 | WA | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | RE | - |
testcase_51 | RE | - |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | RE | - |
testcase_55 | RE | - |
testcase_56 | RE | - |
testcase_57 | RE | - |
testcase_58 | RE | - |
testcase_59 | RE | - |
testcase_60 | RE | - |
testcase_61 | RE | - |
testcase_62 | RE | - |
testcase_63 | RE | - |
testcase_64 | RE | - |
testcase_65 | RE | - |
testcase_66 | RE | - |
testcase_67 | RE | - |
testcase_68 | RE | - |
testcase_69 | RE | - |
testcase_70 | RE | - |
testcase_71 | RE | - |
testcase_72 | RE | - |
testcase_73 | RE | - |
testcase_74 | RE | - |
testcase_75 | RE | - |
testcase_76 | RE | - |
testcase_77 | RE | - |
testcase_78 | RE | - |
testcase_79 | RE | - |
testcase_80 | RE | - |
testcase_81 | RE | - |
testcase_82 | RE | - |
testcase_83 | RE | - |
testcase_84 | RE | - |
testcase_85 | RE | - |
testcase_86 | RE | - |
testcase_87 | RE | - |
testcase_88 | RE | - |
testcase_89 | RE | - |
testcase_90 | RE | - |
testcase_91 | RE | - |
testcase_92 | RE | - |
testcase_93 | RE | - |
testcase_94 | RE | - |
testcase_95 | RE | - |
testcase_96 | RE | - |
testcase_97 | RE | - |
testcase_98 | RE | - |
testcase_99 | RE | - |
testcase_100 | RE | - |
testcase_101 | RE | - |
testcase_102 | RE | - |
testcase_103 | RE | - |
testcase_104 | RE | - |
testcase_105 | RE | - |
testcase_106 | RE | - |
testcase_107 | RE | - |
testcase_108 | RE | - |
testcase_109 | RE | - |
testcase_110 | RE | - |
testcase_111 | RE | - |
testcase_112 | RE | - |
testcase_113 | RE | - |
testcase_114 | RE | - |
testcase_115 | RE | - |
testcase_116 | RE | - |
testcase_117 | RE | - |
testcase_118 | RE | - |
testcase_119 | RE | - |
testcase_120 | RE | - |
testcase_121 | RE | - |
testcase_122 | RE | - |
コンパイルメッセージ
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.Collections.Generic; using System.Linq; using System.Numerics; using System.Diagnostics; using System.Runtime.CompilerServices; namespace FertiLib.Contest.B { static class Program { public static void Solve(Scanner cin) { var n = cin.ReadInt(); var all = n * n - n; //var a = cin.ReadIntArray(all); // if the return value is P, then ret[P + n] increments var ret = new int[n * 2 + 1]; // the answers of the queries var qa = new (int p, int q)[all]; var dic = new SortedDictionary<(int p, int q), List<int>>(); ret[n] += 2; dic.Add((0, 0), new List<int>()); dic[(0, 0)].Add(0); for (int i = 1; i < all; i++) { var (p, q) = Ask(0, i, cin); //var (p, q) = Ask(0, i, cin, a, n); qa[i] = (p, q); if (!dic.ContainsKey((p, q))) dic.Add((p, q), new List<int>()); dic[(p, q)].Add(i); ret[p + n]++; ret[q + n]++; } bool isBigDigit = false; bool isSmallDigit = false; int leftBigDigit = -1; int rightBigDigit = -1; int leftSmallDigit = -1; int rightSmallDigit = -1; for (int i = 0; i < n * 2 + 1; i++) { if (ret[i] == n || ret[i] == 2 * n - 1) { if (!isBigDigit) leftBigDigit = i - n; isBigDigit = true; } else { if (isBigDigit) rightBigDigit = i - n; isBigDigit = false; } if (ret[i] == n - 1 || ret[i] == 2 * n - 1) { if (!isSmallDigit) leftSmallDigit = i - n; isSmallDigit = true; } else { if (isSmallDigit) rightSmallDigit = i - n; isSmallDigit = false; } } Debug.Assert(rightBigDigit - leftBigDigit == n - 1); Debug.Assert(rightSmallDigit - leftSmallDigit == n); var ans = new (int big, int small)[all]; ans[0] = (1 - leftBigDigit, -leftSmallDigit); var oneZeroPair = (leftBigDigit, leftSmallDigit); if (leftBigDigit > leftSmallDigit) oneZeroPair = (leftSmallDigit, leftBigDigit); var oneZero = dic[oneZeroPair][0]; var maxZeroPair = (big: rightBigDigit - 1, small: leftSmallDigit); if (rightBigDigit - 1 > leftSmallDigit) maxZeroPair = (leftSmallDigit, rightBigDigit - 1); var maxZero = dic[maxZeroPair][0]; if (dic[maxZeroPair].Count >= 2) { var revMaxZeroPair = (maxZeroPair.small, maxZeroPair.big); var genuine = (big: rightBigDigit - 1, small: leftSmallDigit); var fake = (big: leftSmallDigit, small: rightBigDigit - 1); var first = dic[maxZeroPair][0]; var second = dic[maxZeroPair][1]; var expected = (0 - 0, (n - 1) - 1); var check = Ask(oneZero, dic[maxZeroPair][0], cin); //var check = Ask(oneZero, dic[maxZeroPair][0], cin, a, n); if (expected == check) { maxZero = dic[maxZeroPair][0]; //qa[dic[maxZeroPair][0]] = (n - 1, 0); //qa[dic[maxZeroPair][1]] = (ans[0].big + revMaxZeroPair.big, ans[0].small + revMaxZeroPair.small); dic.Add(revMaxZeroPair, new List<int>()); dic[maxZeroPair].Clear(); dic[genuine].Add(first); dic[fake].Add(second); } else { maxZero = dic[maxZeroPair][1]; //qa[dic[maxZeroPair][1]] = (n - 1, 0); //qa[dic[maxZeroPair][0]] = (ans[0].big + revMaxZeroPair.big, ans[0].small + revMaxZeroPair.small); dic.Add(revMaxZeroPair, new List<int>()); dic[maxZeroPair].Clear(); dic[genuine].Add(second); dic[fake].Add(first); } } foreach (var e in dic) { if (e.Value.Count >= 2) { var revPair = (p: e.Key.q, q: e.Key.p); var expected = (big: ans[0].big + e.Key.p - (n - 1), small: ans[0].small + e.Key.q - 0); var check = Ask(maxZero, e.Value[0], cin); //var check = Ask(maxZero, e.Value[0], cin, a, n); if (expected == check) { dic.Add(revPair, new List<int>()); dic[revPair].Add(dic[e.Key][1]); dic[e.Key].RemoveAt(1); } else { dic.Add(revPair, new List<int>()); dic[revPair].Add(dic[e.Key][0]); dic[e.Key].RemoveAt(0); } } } foreach (var e in dic) { Debug.Assert(e.Value.Count == 1); var (p, q) = e.Key; if (leftBigDigit <= p && p < rightBigDigit && leftSmallDigit <= q && q < rightSmallDigit) { // do nothing } else { var t = p; p = q; q = t; } ans[e.Value[0]] = (ans[0].big + p, ans[0].small + q); } Answer(ans.Select(p => p.big * n + p.small)); } public static (int p, int q) Ask(int i, int j, Scanner cin) { Console.WriteLine($"? {i + 1} {j + 1}"); Console.Out.Flush(); var (p, q) = cin.ReadValue<int, int>(); return (p, q); } //public static (int p, int q) Ask(int i, int j, Scanner cin, int[] ans, int n) //{ // var p = ans[j] / n - ans[i] / n; // var q = ans[j] % n - ans[i] % n; // if (p > q) // { // var t = p; // p = q; // q = t; // } // return (p, q); //} public static void Answer(IEnumerable<int> a) { Console.WriteLine("! " + a.Join(" ")); Console.Out.Flush(); return; } public static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var cin = new Scanner(); Solve(cin); Console.Out.Flush(); } public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO"); public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No"); public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no"); public static bool Chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) >= 0) return false; a = b; return true; } public static bool Chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) <= 0) return false; a = b; return true; } } static class Extention { public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x); public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default); public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default); public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer) { var ng = index - 1; var ok = index + length; while (ok - ng > 1) { var mid = ng + (ok - ng) / 2; var res = comparer.Compare(list[mid], value); if (res < 0 || (isUpperBound && res == 0)) ng = mid; else ok = mid; } return ok; } } class Scanner { string[] s; int i; char[] separator = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string Read() => ReadString(); public string ReadString() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries); if (s.Length == 0) return ReadString(); i = 0; return s[i++]; } public string[] ReadStringArray(int N) { string[] Array = new string[N]; for (int i = 0; i < N; i++) { Array[i] = ReadString(); } return Array; } public int ReadInt() => int.Parse(ReadString()); public int[] ReadIntArray(int N, int add = 0) { int[] Array = new int[N]; for (int i = 0; i < N; i++) { Array[i] = ReadInt() + add; } return Array; } public long ReadLong() => long.Parse(ReadString()); public long[] ReadLongArray(int N, long add = 0) { long[] Array = new long[N]; for (int i = 0; i < N; i++) { Array[i] = ReadLong() + add; } return Array; } public double ReadDouble() => double.Parse(ReadString()); public double[] ReadDoubleArray(int N, double add = 0) { double[] Array = new double[N]; for (int i = 0; i < N; i++) { Array[i] = ReadDouble() + add; } return Array; } public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); public (T1, T2) ReadValue<T1, T2>() { var inputs = ReadStringArray(2); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); return (v1, v2); } public (T1, T2, T3) ReadValue<T1, T2, T3>() { var inputs = ReadStringArray(3); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); return (v1, v2, v3); } public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>() { var inputs = ReadStringArray(4); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); return (v1, v2, v3, v4); } public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>() { var inputs = ReadStringArray(5); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); return (v1, v2, v3, v4, v5); } public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>() { var inputs = ReadStringArray(6); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6)); return (v1, v2, v3, v4, v5, v6); } public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>() { var inputs = ReadStringArray(7); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6)); var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7)); return (v1, v2, v3, v4, v5, v6, v7); } public T1[] ReadValueArray<T1>(int N) { var v1 = new T1[N]; for (int i = 0; i < N; i++) { v1[i] = ReadValue<T1>(); } return v1; } public (T1[], T2[]) ReadValueArray<T1, T2>(int N) { var (v1, v2) = (new T1[N], new T2[N]); for (int i = 0; i < N; i++) { var (t1, t2) = ReadValue<T1, T2>(); v1[i] = t1; v2[i] = t2; } return (v1, v2); } public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N) { var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3) = ReadValue<T1, T2, T3>(); v1[i] = t1; v2[i] = t2; v3[i] = t3; } return (v1, v2, v3); } public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N) { var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; } return (v1, v2, v3, v4); } public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N) { var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; } return (v1, v2, v3, v4, v5); } public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N) { var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; v6[i] = t6; } return (v1, v2, v3, v4, v5, v6); } public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N) { var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; v6[i] = t6; v7[i] = t7; } return (v1, v2, v3, v4, v5, v6, v7); } } }