結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 EmKjp
|
| 提出日時 | 2020-12-03 22:20:45 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,273 bytes |
| コンパイル時間 | 2,662 ms |
| コンパイル使用メモリ | 114,232 KB |
| 実行使用メモリ | 44,200 KB |
| 平均クエリ数 | 1.00 |
| 最終ジャッジ日時 | 2023-09-24 08:45:16 |
| 合計ジャッジ時間 | 38,965 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| 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.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;
using E = System.Linq.Enumerable;
using System.Threading;
internal partial class Solver {
int[] a = null;
int n;
(int p, int q) Query(int i, int j) {
if (i == j) return (0, 0);
if (a != null) {
var p = a[i] / n - a[j] / n;
var q = a[i] % n - a[j] % n;
if (p > q) (p, q) = (q, p);
return (p, q);
} else {
Console.WriteLine("? {0} {1}", i + 1, j + 1);
Console.Out.Flush();
var p = ni();
var q = ni();
return (p, q);
}
}
private static readonly Random rand = new Random();
public static void ArrayShuffle<T>(IList<T> array) {
for (int i = 1; i < array.Count; i++) {
int r = rand.Next() % (i + 1);
var t = array[i];
array[i] = array[r];
array[r] = t;
}
}
public void Run() {
#if !DEBUG
n = 50;
var k = n * n - n;
var aa = E.Range(n, k).ToArray();
a = aa.ToArray();
ArrayShuffle(a);
#else
var n = ni();
var k = n * n - n;
#endif
// n, n + 1, ... n*n-1
var b = new (int p, int q)[k];
var ans = new (int p, int q)[k];
for (int i = 0; i < k; i++) {
b[i] = Query(i, 0);
}
int minIndex = -1;
int maxIndex = -1;
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
// n - 2 のとき N の桁、 n - 1 のとき 1 の桁
if (b[i].p - b[j].p == n - 2 && b[i].q - b[j].q == n - 1) {
ans[0] = (-b[j].p + 1, -b[j].q);
ans[i] = (n - 1, n - 1);
ans[j] = (1, 0);
maxIndex = i;
minIndex = j;
}
if (b[i].p - b[j].q == n - 2 && b[i].q - b[j].p == n - 1) {
ans[0] = (-b[j].q + 1, -b[j].p);
ans[i] = (n - 1, n - 1);
ans[j] = (1, 0);
maxIndex = i;
minIndex = j;
}
if (b[i].q - b[j].p == n - 2 && b[i].p - b[j].q == n - 1) {
ans[0] = (-b[j].p + 1, -b[j].q);
ans[i] = (n - 1, n - 1);
ans[j] = (1, 0);
maxIndex = i;
minIndex = j;
}
if (b[i].q - b[j].q == n - 2 && b[i].p - b[j].p == n - 1) {
ans[0] = (-b[j].q + 1, -b[j].p);
ans[i] = (n - 1, n - 1);
ans[j] = (1, 0);
maxIndex = i;
minIndex = j;
}
}
}
bool satisfy((int p, int q) v) => 1 <= v.p && v.p < n && 0 <= v.q && v.q < n;
(int p, int q) subQuery((int p, int q) v1, (int p, int q) v2) {
var p = v1.p - v2.p;
var q = v1.q - v2.q;
if (p > q) (p, q) = (q, p);
return (p, q);
}
for (int i = 1; i < k; i++) {
if (ans[i] != (0, 0)) continue;
var cand1 = (ans[0].p + b[i].p, ans[0].q + b[i].q);
var cand2 = (ans[0].p + b[i].q, ans[0].q + b[i].p);
if (cand1 == cand2) {
ans[i] = cand2;
} else if (!satisfy(cand1)) {
ans[i] = cand2;
} else if (!satisfy(cand2)) {
ans[i] = cand1;
} else {
var target = -1;
if (subQuery(cand1, ans[minIndex]) != subQuery(cand2, ans[minIndex])) {
target = minIndex;
}
if (subQuery(cand1, ans[maxIndex]) != subQuery(cand2, ans[maxIndex])) {
target = maxIndex;
}
for (int j = i + 1; j < k; j++) {
if (b[i] == b[j]) {
var r = Query(i, target);
if (r == subQuery(cand1, ans[target])) {
ans[i] = cand1;
ans[j] = cand2;
} else {
ans[i] = cand2;
ans[j] = cand1;
}
break;
}
}
}
}
var ans2 = ans.Select(a => a.p * n + a.q).ToArray();
cout.WriteLine("! " + ans2.JoinToString(" "));
cout.Flush();
//a.TextDump();
//ans2.TextDump();
//if (!a.SequenceEqual(ans2)) throw new Exception();
}
}
// PREWRITEN CODE BEGINS FROM HERE
static public class StringExtensions {
static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
return string.Join(separator, source);
}
}
internal partial class Solver : Scanner {
static readonly int? StackSizeInMebiByte = null; //50;
public static void StartAndJoin(Action action, int maxStackSize) {
var thread = new Thread(new ThreadStart(action), maxStackSize);
thread.Start();
thread.Join();
}
public static void Main() {
#if LOCAL
byte[] inputBuffer = new byte[1000000];
var inputStream = Console.OpenStandardInput(inputBuffer.Length);
using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
Console.SetIn(reader);
new Solver(Console.In, Console.Out).Run();
}
#else
Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
if (StackSizeInMebiByte.HasValue) {
StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
} else {
new Solver(Console.In, Console.Out).Run();
}
Console.Out.Flush();
#endif
}
#pragma warning disable IDE0052
private readonly TextReader cin;
private readonly TextWriter cout;
private readonly TextWriter cerr;
#pragma warning restore IDE0052
public Solver(TextReader reader, TextWriter writer)
: base(reader) {
cin = reader;
cout = writer;
cerr = Console.Error;
}
public Solver(string input, TextWriter writer)
: this(new StringReader(input), writer) {
}
#pragma warning disable IDE1006
#pragma warning disable IDE0051
private int ni() { return NextInt(); }
private int[] ni(int n) { return NextIntArray(n); }
private long nl() { return NextLong(); }
private long[] nl(int n) { return NextLongArray(n); }
private double nd() { return NextDouble(); }
private double[] nd(int n) { return NextDoubleArray(n); }
private string ns() { return Next(); }
private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}
#if DEBUG
internal static class LinqPadExtension {
public static string TextDump<T>(this T obj) {
if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
else return obj.ToString().Dump();
}
public static T Dump<T>(this T obj) {
return LINQPad.Extensions.Dump(obj);
}
}
#endif
public class Scanner {
private readonly TextReader Reader;
private readonly CultureInfo ci = CultureInfo.InvariantCulture;
private readonly char[] buffer = new char[2 * 1024];
private int cursor = 0, length = 0;
private string Token;
private readonly StringBuilder sb = new StringBuilder(1024);
public Scanner()
: this(Console.In) {
}
public Scanner(TextReader reader) {
Reader = reader;
}
public int NextInt() { return checked((int)NextLong()); }
public long NextLong() {
var s = Next();
long r = 0;
int i = 0;
bool negative = false;
if (s[i] == '-') {
negative = true;
i++;
}
for (; i < s.Length; i++) {
r = r * 10 + (s[i] - '0');
#if DEBUG
if (!char.IsDigit(s[i])) throw new FormatException();
#endif
}
return negative ? -r : r;
}
public double NextDouble() { return double.Parse(Next(), ci); }
public string[] NextArray(int size) {
string[] array = new string[size];
for (int i = 0; i < size; i++) {
array[i] = Next();
}
return array;
}
public int[] NextIntArray(int size) {
int[] array = new int[size];
for (int i = 0; i < size; i++) {
array[i] = NextInt();
}
return array;
}
public long[] NextLongArray(int size) {
long[] array = new long[size];
for (int i = 0; i < size; i++) {
array[i] = NextLong();
}
return array;
}
public double[] NextDoubleArray(int size) {
double[] array = new double[size];
for (int i = 0; i < size; i++) {
array[i] = NextDouble();
}
return array;
}
public string Next() {
if (Token == null) {
if (!StockToken()) {
throw new Exception();
}
}
var token = Token;
Token = null;
return token;
}
public bool HasNext() {
if (Token != null) {
return true;
}
return StockToken();
}
private bool StockToken() {
while (true) {
sb.Clear();
while (true) {
if (cursor >= length) {
cursor = 0;
if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
break;
}
}
var c = buffer[cursor++];
if (33 <= c && c <= 126) {
sb.Append(c);
} else {
if (sb.Length > 0) break;
}
}
if (sb.Length > 0) {
Token = sb.ToString();
return true;
}
return false;
}
}
}