結果

問題 No.1306 Exactly 2 Digits
コンテスト
ユーザー hos.lyric
提出日時 2020-12-03 01:00:50
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 134 ms / 2,000 ms
コード長 4,486 bytes
コンパイル時間 1,996 ms
コンパイル使用メモリ 177,068 KB
実行使用メモリ 25,452 KB
平均クエリ数 1236.78
最終ジャッジ日時 2024-06-22 10:13:07
合計ジャッジ時間 14,569 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 123
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
debug {
  int[] A;
}

alias Pair = Tuple!(int, "p", int, "q");
Pair Ask(int i, int j) {
  writefln("? %s %s", i + 1, j + 1);
  stdout.flush;
  int p, q;
  debug {
    p = A[i] / N - A[j] / N;
    q = A[i] % N - A[j] % N;
    if (p > q) {
      swap(p, q);
    }
  } else {
    p = readInt();
    q = readInt();
  }
  return Pair(p, q);
}

void main() {
  N = readInt();
  debug {
    A = new int[N^^2 - N];
    foreach (i; 0 .. N^^2 - N) {
      A[i] = readInt();
    }
  }
  
  auto ans = new int[N^^2 - N];
  ans[] = -1;
  
  alias Entry = Tuple!(Pair, "val", int, "id");
  Entry[] es;
  foreach (i; 1 .. N^^2 - N) {
    const res = Ask(i, 0);
    es ~= Entry(res, i);
  }
  const esLen = cast(int)(es.length);
  es.sort;
  debug {
    writeln("es = ", es);
  }
  
  Pair mn = Pair(0, 0);
  Pair mx = Pair(0, 0);
  foreach (ref e; es) {
    if (mn.p + mn.q > e.val.p + e.val.q) mn = e.val;
    if (mx.p + mx.q < e.val.p + e.val.q) mx = e.val;
  }
  debug {
    writeln("mn = ", mn);
    writeln("mx = ", mx);
  }
  int[] a0s;
  foreach (s; 0 .. 2) foreach (t; 0 .. 2) {
    const x0mn = 1 - (s ? mn.q : mn.p);
    const y0mn = 0 - (s ? mn.p : mn.q);
    const x0mx = N - 1 - (t ? mx.q : mx.p);
    const y0mx = N - 1 - (t ? mx.p : mx.q);
    debug {
      writefln("(%s, %s), (%s, %s)", x0mn, y0mn, x0mx, y0mx);
    }
    if (x0mn == x0mx && y0mn == y0mx) {
      a0s ~= x0mn * N + y0mn;
    }
  }
  a0s = a0s.sort.uniq.array;
  assert(a0s.length == 1);
  ans[0] = a0s[0];
  
  int[] nices;
  foreach (phase; 0 .. 2) {
    for (int x = 0, y; x < esLen; x = y) {
      for (y = x; y < esLen && es[x].val == es[y].val; ++y) {}
      const x1 = ans[0] / N + es[x].val.p;
      const y1 = ans[0] % N + es[x].val.q;
      const x2 = ans[0] / N + es[x].val.q;
      const y2 = ans[0] % N + es[x].val.p;
      if (y - x == 1) {
        if (phase == 0) {
          const i = es[x].id;
          if (1 <= x1 && x1 <= N - 1 && 0 <= y1 && y1 <= N - 1) {
            ans[i] = x1 * N + y1;
          } else {
            ans[i] = x2 * N + y2;
          }
        }
      } else if (y - x == 2) {
        if (phase == 1) {
          const i = es[x].id;
          const j = es[x + 1].id;
          foreach (k; nices) {
            Pair ex1 = Pair(x1 - ans[k] / N, y1 - ans[k] % N);
            Pair ex2 = Pair(x2 - ans[k] / N, y2 - ans[k] % N);
            if (ex1.p > ex1.q) swap(ex1.p, ex1.q);
            if (ex2.p > ex2.q) swap(ex2.p, ex2.q);
            if (ex1 != ex2) {
              const res = Ask(i, k);
              if (ex1 == res) {
                ans[i] = x1 * N + y1;
                ans[j] = x2 * N + y2;
              } else if (ex2 == res) {
                ans[i] = x2 * N + y2;
                ans[j] = x1 * N + y1;
              } else {
                assert(false);
              }
              goto found;
            }
          }
          assert(false);
         found:
        }
      } else {
        assert(false);
      }
    }
    if (phase == 0) {
      foreach (i; 0 .. N^^2 - N) if (ans[i] == 1 * N + 0) nices ~= i;
      foreach (i; 0 .. N^^2 - N) if (ans[i] == (N - 1) * N + (N - 1)) nices ~= i;
      assert(nices.length == 2);
    }
  }
  
  write("!");
  foreach (i; 0 .. N^^2 - N) {
    write(" ", ans[i]);
  }
  writeln;
  stdout.flush;
  debug {
    assert(A == ans);
  }
}
0