結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 fairy_lettuce
|
| 提出日時 | 2020-12-03 03:22:14 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 13,471 bytes |
| コンパイル時間 | 1,459 ms |
| コンパイル使用メモリ | 121,332 KB |
| 実行使用メモリ | 47,996 KB |
| 平均クエリ数 | 1237.20 |
| 最終ジャッジ日時 | 2024-07-17 08:27:13 |
| 合計ジャッジ時間 | 35,746 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| 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 | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | WA | - |
| testcase_43 | WA | - |
| testcase_44 | WA | - |
| testcase_45 | WA | - |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | WA | - |
| testcase_50 | WA | - |
| testcase_51 | WA | - |
| testcase_52 | WA | - |
| testcase_53 | WA | - |
| testcase_54 | WA | - |
| testcase_55 | WA | - |
| testcase_56 | WA | - |
| testcase_57 | WA | - |
| testcase_58 | WA | - |
| testcase_59 | WA | - |
| testcase_60 | WA | - |
| testcase_61 | WA | - |
| testcase_62 | WA | - |
| testcase_63 | WA | - |
| testcase_64 | WA | - |
| testcase_65 | WA | - |
| testcase_66 | WA | - |
| testcase_67 | WA | - |
| testcase_68 | WA | - |
| testcase_69 | WA | - |
| testcase_70 | WA | - |
| testcase_71 | WA | - |
| testcase_72 | WA | - |
| testcase_73 | WA | - |
| testcase_74 | WA | - |
| testcase_75 | WA | - |
| testcase_76 | WA | - |
| testcase_77 | WA | - |
| testcase_78 | WA | - |
| testcase_79 | WA | - |
| testcase_80 | WA | - |
| testcase_81 | WA | - |
| testcase_82 | WA | - |
| testcase_83 | WA | - |
| testcase_84 | WA | - |
| testcase_85 | WA | - |
| testcase_86 | WA | - |
| testcase_87 | WA | - |
| testcase_88 | WA | - |
| testcase_89 | WA | - |
| testcase_90 | WA | - |
| testcase_91 | WA | - |
| testcase_92 | WA | - |
| testcase_93 | WA | - |
| testcase_94 | WA | - |
| testcase_95 | WA | - |
| testcase_96 | WA | - |
| testcase_97 | WA | - |
| testcase_98 | WA | - |
| testcase_99 | WA | - |
| testcase_100 | WA | - |
| testcase_101 | WA | - |
| testcase_102 | WA | - |
| testcase_103 | WA | - |
| testcase_104 | WA | - |
| testcase_105 | WA | - |
| testcase_106 | WA | - |
| testcase_107 | WA | - |
| testcase_108 | WA | - |
| testcase_109 | WA | - |
| testcase_110 | WA | - |
| testcase_111 | WA | - |
| testcase_112 | WA | - |
| testcase_113 | WA | - |
| testcase_114 | WA | - |
| testcase_115 | WA | - |
| testcase_116 | WA | - |
| testcase_117 | WA | - |
| testcase_118 | WA | - |
| testcase_119 | WA | - |
| testcase_120 | WA | - |
| testcase_121 | WA | - |
| testcase_122 | 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.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($"? {i + 1} {j + 1}");
Console.Out.Flush();
var (p, q) = cin.ReadValue<int, int>();
return (p, q);
}
else
{
Console.WriteLine($"? {i + 1} {j + 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);
}
}
}