結果
問題 | No.1306 Exactly 2 Digits |
ユーザー | fairy_lettuce |
提出日時 | 2020-12-03 03:33:10 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 212 ms / 2,000 ms |
コード長 | 13,473 bytes |
コンパイル時間 | 1,139 ms |
コンパイル使用メモリ | 118,828 KB |
実行使用メモリ | 46,344 KB |
平均クエリ数 | 1237.29 |
最終ジャッジ日時 | 2024-07-17 08:28:41 |
合計ジャッジ時間 | 21,195 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
43,724 KB |
testcase_01 | AC | 63 ms
46,148 KB |
testcase_02 | AC | 61 ms
44,168 KB |
testcase_03 | AC | 63 ms
43,596 KB |
testcase_04 | AC | 62 ms
43,468 KB |
testcase_05 | AC | 61 ms
43,720 KB |
testcase_06 | AC | 61 ms
43,796 KB |
testcase_07 | AC | 62 ms
43,788 KB |
testcase_08 | AC | 61 ms
42,032 KB |
testcase_09 | AC | 62 ms
45,704 KB |
testcase_10 | AC | 63 ms
43,912 KB |
testcase_11 | AC | 63 ms
43,528 KB |
testcase_12 | AC | 63 ms
42,124 KB |
testcase_13 | AC | 67 ms
43,736 KB |
testcase_14 | AC | 65 ms
43,596 KB |
testcase_15 | AC | 62 ms
43,468 KB |
testcase_16 | AC | 63 ms
46,044 KB |
testcase_17 | AC | 62 ms
43,856 KB |
testcase_18 | AC | 62 ms
46,148 KB |
testcase_19 | AC | 63 ms
43,600 KB |
testcase_20 | AC | 63 ms
44,104 KB |
testcase_21 | AC | 65 ms
43,980 KB |
testcase_22 | AC | 67 ms
45,572 KB |
testcase_23 | AC | 64 ms
45,580 KB |
testcase_24 | AC | 63 ms
43,724 KB |
testcase_25 | AC | 63 ms
43,980 KB |
testcase_26 | AC | 64 ms
43,596 KB |
testcase_27 | AC | 63 ms
45,312 KB |
testcase_28 | AC | 63 ms
43,724 KB |
testcase_29 | AC | 62 ms
43,280 KB |
testcase_30 | AC | 63 ms
45,832 KB |
testcase_31 | AC | 63 ms
43,788 KB |
testcase_32 | AC | 63 ms
43,600 KB |
testcase_33 | AC | 64 ms
43,660 KB |
testcase_34 | AC | 64 ms
43,980 KB |
testcase_35 | AC | 67 ms
44,104 KB |
testcase_36 | AC | 63 ms
43,664 KB |
testcase_37 | AC | 64 ms
45,456 KB |
testcase_38 | AC | 63 ms
43,268 KB |
testcase_39 | AC | 64 ms
45,760 KB |
testcase_40 | AC | 63 ms
43,596 KB |
testcase_41 | AC | 64 ms
45,244 KB |
testcase_42 | AC | 63 ms
43,976 KB |
testcase_43 | AC | 63 ms
43,916 KB |
testcase_44 | AC | 64 ms
43,724 KB |
testcase_45 | AC | 65 ms
42,248 KB |
testcase_46 | AC | 66 ms
46,080 KB |
testcase_47 | AC | 69 ms
46,220 KB |
testcase_48 | AC | 68 ms
43,792 KB |
testcase_49 | AC | 70 ms
44,240 KB |
testcase_50 | AC | 71 ms
45,636 KB |
testcase_51 | AC | 71 ms
41,480 KB |
testcase_52 | AC | 74 ms
43,976 KB |
testcase_53 | AC | 76 ms
41,480 KB |
testcase_54 | AC | 74 ms
43,784 KB |
testcase_55 | AC | 77 ms
43,976 KB |
testcase_56 | AC | 79 ms
43,504 KB |
testcase_57 | AC | 80 ms
43,844 KB |
testcase_58 | AC | 83 ms
43,724 KB |
testcase_59 | AC | 82 ms
43,596 KB |
testcase_60 | AC | 91 ms
43,980 KB |
testcase_61 | AC | 96 ms
43,460 KB |
testcase_62 | AC | 94 ms
41,744 KB |
testcase_63 | AC | 105 ms
45,836 KB |
testcase_64 | AC | 96 ms
43,752 KB |
testcase_65 | AC | 100 ms
43,336 KB |
testcase_66 | AC | 106 ms
43,404 KB |
testcase_67 | AC | 108 ms
45,576 KB |
testcase_68 | AC | 108 ms
45,664 KB |
testcase_69 | AC | 112 ms
42,256 KB |
testcase_70 | AC | 114 ms
43,724 KB |
testcase_71 | AC | 119 ms
45,632 KB |
testcase_72 | AC | 119 ms
45,892 KB |
testcase_73 | AC | 117 ms
45,760 KB |
testcase_74 | AC | 132 ms
45,492 KB |
testcase_75 | AC | 126 ms
43,780 KB |
testcase_76 | AC | 141 ms
45,668 KB |
testcase_77 | AC | 147 ms
41,992 KB |
testcase_78 | AC | 153 ms
41,612 KB |
testcase_79 | AC | 164 ms
43,852 KB |
testcase_80 | AC | 167 ms
44,144 KB |
testcase_81 | AC | 146 ms
43,588 KB |
testcase_82 | AC | 173 ms
46,144 KB |
testcase_83 | AC | 178 ms
43,544 KB |
testcase_84 | AC | 188 ms
43,264 KB |
testcase_85 | AC | 195 ms
43,592 KB |
testcase_86 | AC | 170 ms
44,164 KB |
testcase_87 | AC | 174 ms
42,000 KB |
testcase_88 | AC | 204 ms
45,304 KB |
testcase_89 | AC | 178 ms
43,696 KB |
testcase_90 | AC | 162 ms
45,888 KB |
testcase_91 | AC | 175 ms
43,652 KB |
testcase_92 | AC | 162 ms
43,856 KB |
testcase_93 | AC | 183 ms
41,612 KB |
testcase_94 | AC | 163 ms
43,524 KB |
testcase_95 | AC | 168 ms
43,396 KB |
testcase_96 | AC | 162 ms
45,308 KB |
testcase_97 | AC | 159 ms
45,372 KB |
testcase_98 | AC | 153 ms
44,108 KB |
testcase_99 | AC | 174 ms
44,040 KB |
testcase_100 | AC | 175 ms
43,852 KB |
testcase_101 | AC | 184 ms
45,624 KB |
testcase_102 | AC | 159 ms
45,568 KB |
testcase_103 | AC | 167 ms
45,892 KB |
testcase_104 | AC | 168 ms
43,784 KB |
testcase_105 | AC | 186 ms
43,852 KB |
testcase_106 | AC | 156 ms
46,344 KB |
testcase_107 | AC | 196 ms
43,592 KB |
testcase_108 | AC | 177 ms
43,980 KB |
testcase_109 | AC | 189 ms
46,216 KB |
testcase_110 | AC | 160 ms
43,980 KB |
testcase_111 | AC | 164 ms
43,720 KB |
testcase_112 | AC | 152 ms
43,720 KB |
testcase_113 | AC | 196 ms
43,976 KB |
testcase_114 | AC | 212 ms
43,980 KB |
testcase_115 | AC | 172 ms
43,404 KB |
testcase_116 | AC | 201 ms
43,208 KB |
testcase_117 | AC | 175 ms
43,716 KB |
testcase_118 | AC | 187 ms
43,848 KB |
testcase_119 | AC | 170 ms
43,724 KB |
testcase_120 | AC | 161 ms
45,704 KB |
testcase_121 | AC | 179 ms
43,464 KB |
testcase_122 | AC | 179 ms
41,604 KB |
コンパイルメッセージ
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); int[] a = null; var ans = SolveCheck(n, all, a, cin); if (a != null) { for (int i = 0; i < all; i++) { if (a[i] != ans[i]) { Console.WriteLine("Assertion Failed!"); Console.WriteLine($"n: {n}"); Console.WriteLine($"a: {a.Join(" ")}"); } } } } public static int[] SolveCheck(int n, int all, int[] a, Scanner cin) { int timesAsked = 0; // 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++) { timesAsked++; if (timesAsked > all * 3 / 2) throw new Exception(); 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]; Debug.Assert(dic[oneZeroPair].Count == 1); var zeroMaxPair = (big: leftBigDigit, small: rightSmallDigit - 1); if (leftBigDigit > rightSmallDigit - 1) zeroMaxPair = (rightSmallDigit - 1, leftBigDigit); var zeroMax = dic[zeroMaxPair][0]; if (dic[zeroMaxPair].Count >= 2) { var revMaxZeroPair = (zeroMaxPair.small, zeroMaxPair.big); var genuine = (big: rightBigDigit - 1, small: leftSmallDigit); var fake = (big: leftSmallDigit, small: rightBigDigit - 1); var first = dic[zeroMaxPair][0]; var second = dic[zeroMaxPair][1]; var expected = (0, n - 1); timesAsked++; if (timesAsked > all * 3 / 2) throw new Exception(); var check = Ask(oneZero, first, cin, a, n); if (expected == check) { zeroMax = first; //dic.Add(revMaxZeroPair, new List<int>()); //dic[maxZeroPair].Clear(); //dic[genuine].Add(first); //dic[fake].Add(second); qa[first] = genuine; qa[second] = fake; } else { zeroMax = second; //dic.Add(revMaxZeroPair, new List<int>()); //dic[maxZeroPair].Clear(); //dic[genuine].Add(second); //dic[fake].Add(first); qa[first] = fake; qa[second] = genuine; } } foreach (var e in dic) { if (e.Value.Count >= 2) { var genuine = e.Key; var fake = (p: e.Key.q, q: e.Key.p); var expected = (big: ans[0].big + genuine.p - 1, small: ans[0].small + genuine.q - (n - 1)); if (expected.big > expected.small) { var t = expected.big; expected.big = expected.small; expected.small = t; } timesAsked++; if (timesAsked > all * 3 / 2) throw new Exception(); var check = Ask(zeroMax, 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); qa[dic[e.Key][0]] = genuine; qa[dic[e.Key][1]] = fake; } else { //dic.Add(revPair, new List<int>()); //dic[revPair].Add(dic[e.Key][0]); //dic[e.Key].RemoveAt(0); qa[dic[e.Key][0]] = fake; qa[dic[e.Key][1]] = genuine; } } } for (int i = 0; i < all; i++) { var (p, q) = qa[i]; if (leftBigDigit <= p && p < rightBigDigit && leftSmallDigit <= q && q < rightSmallDigit) { // do nothing } else { var t = p; p = q; q = t; } ans[i] = (ans[0].big + p, ans[0].small + q); } var answer = ans.Select(p => p.big * n + p.small).ToArray(); Answer(answer); return answer; } public static (int p, int q) Ask(int i, int j, Scanner cin, int[] ans, int n) { if (ans == null) { Console.WriteLine($"? {j + 1} {i + 1}"); Console.Out.Flush(); var (p, q) = cin.ReadValue<int, int>(); return (p, q); } else { Console.WriteLine($"? {j + 1} {i + 1}"); 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; } Console.WriteLine($"\t{p} {q}"); Console.Out.Flush(); 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); } } }