結果

問題 No.1306 Exactly 2 Digits
ユーザー risujirohrisujiroh
提出日時 2020-12-03 01:00:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 563 ms / 2,000 ms
コード長 4,953 bytes
コンパイル時間 2,896 ms
コンパイル使用メモリ 235,632 KB
実行使用メモリ 28,488 KB
平均クエリ数 1236.78
最終ジャッジ日時 2024-07-17 07:50:48
合計ジャッジ時間 34,992 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
24,812 KB
testcase_01 AC 24 ms
24,556 KB
testcase_02 AC 24 ms
24,964 KB
testcase_03 AC 24 ms
24,836 KB
testcase_04 AC 24 ms
24,568 KB
testcase_05 AC 24 ms
24,580 KB
testcase_06 AC 23 ms
24,580 KB
testcase_07 AC 23 ms
24,928 KB
testcase_08 AC 23 ms
25,220 KB
testcase_09 AC 23 ms
24,964 KB
testcase_10 AC 24 ms
24,836 KB
testcase_11 AC 24 ms
24,836 KB
testcase_12 AC 23 ms
24,580 KB
testcase_13 AC 24 ms
24,812 KB
testcase_14 AC 24 ms
24,812 KB
testcase_15 AC 24 ms
24,940 KB
testcase_16 AC 24 ms
25,196 KB
testcase_17 AC 25 ms
25,196 KB
testcase_18 AC 24 ms
25,196 KB
testcase_19 AC 24 ms
24,940 KB
testcase_20 AC 23 ms
24,940 KB
testcase_21 AC 24 ms
24,812 KB
testcase_22 AC 23 ms
24,556 KB
testcase_23 AC 24 ms
25,196 KB
testcase_24 AC 24 ms
24,812 KB
testcase_25 AC 24 ms
25,196 KB
testcase_26 AC 25 ms
24,940 KB
testcase_27 AC 24 ms
25,184 KB
testcase_28 AC 24 ms
25,196 KB
testcase_29 AC 24 ms
25,452 KB
testcase_30 AC 24 ms
24,940 KB
testcase_31 AC 24 ms
24,812 KB
testcase_32 AC 24 ms
24,812 KB
testcase_33 AC 24 ms
24,556 KB
testcase_34 AC 24 ms
24,556 KB
testcase_35 AC 24 ms
25,196 KB
testcase_36 AC 24 ms
25,196 KB
testcase_37 AC 24 ms
25,196 KB
testcase_38 AC 24 ms
24,812 KB
testcase_39 AC 25 ms
25,196 KB
testcase_40 AC 25 ms
25,196 KB
testcase_41 AC 25 ms
25,184 KB
testcase_42 AC 25 ms
25,196 KB
testcase_43 AC 25 ms
24,940 KB
testcase_44 AC 26 ms
24,940 KB
testcase_45 AC 26 ms
25,196 KB
testcase_46 AC 27 ms
25,196 KB
testcase_47 AC 28 ms
25,196 KB
testcase_48 AC 30 ms
24,940 KB
testcase_49 AC 30 ms
25,196 KB
testcase_50 AC 32 ms
24,556 KB
testcase_51 AC 33 ms
24,556 KB
testcase_52 AC 36 ms
24,556 KB
testcase_53 AC 40 ms
25,196 KB
testcase_54 AC 39 ms
24,812 KB
testcase_55 AC 44 ms
24,812 KB
testcase_56 AC 47 ms
24,940 KB
testcase_57 AC 50 ms
24,940 KB
testcase_58 AC 54 ms
24,796 KB
testcase_59 AC 56 ms
24,940 KB
testcase_60 AC 66 ms
24,812 KB
testcase_61 AC 74 ms
24,556 KB
testcase_62 AC 78 ms
24,812 KB
testcase_63 AC 87 ms
24,812 KB
testcase_64 AC 90 ms
24,556 KB
testcase_65 AC 97 ms
25,112 KB
testcase_66 AC 108 ms
25,452 KB
testcase_67 AC 118 ms
24,556 KB
testcase_68 AC 124 ms
24,940 KB
testcase_69 AC 138 ms
24,940 KB
testcase_70 AC 148 ms
25,196 KB
testcase_71 AC 163 ms
24,544 KB
testcase_72 AC 174 ms
24,796 KB
testcase_73 AC 187 ms
25,196 KB
testcase_74 AC 214 ms
25,196 KB
testcase_75 AC 227 ms
25,452 KB
testcase_76 AC 252 ms
24,940 KB
testcase_77 AC 278 ms
24,952 KB
testcase_78 AC 301 ms
24,556 KB
testcase_79 AC 332 ms
25,196 KB
testcase_80 AC 357 ms
26,056 KB
testcase_81 AC 360 ms
25,672 KB
testcase_82 AC 408 ms
25,800 KB
testcase_83 AC 469 ms
27,208 KB
testcase_84 AC 482 ms
27,336 KB
testcase_85 AC 549 ms
27,848 KB
testcase_86 AC 461 ms
27,208 KB
testcase_87 AC 502 ms
27,592 KB
testcase_88 AC 563 ms
27,720 KB
testcase_89 AC 471 ms
26,944 KB
testcase_90 AC 520 ms
27,720 KB
testcase_91 AC 436 ms
26,440 KB
testcase_92 AC 492 ms
27,592 KB
testcase_93 AC 477 ms
27,208 KB
testcase_94 AC 428 ms
26,816 KB
testcase_95 AC 467 ms
27,208 KB
testcase_96 AC 424 ms
26,184 KB
testcase_97 AC 488 ms
27,208 KB
testcase_98 AC 419 ms
26,696 KB
testcase_99 AC 437 ms
26,440 KB
testcase_100 AC 437 ms
26,696 KB
testcase_101 AC 479 ms
27,080 KB
testcase_102 AC 421 ms
26,696 KB
testcase_103 AC 433 ms
26,568 KB
testcase_104 AC 467 ms
27,080 KB
testcase_105 AC 526 ms
28,360 KB
testcase_106 AC 455 ms
27,080 KB
testcase_107 AC 531 ms
27,848 KB
testcase_108 AC 519 ms
27,848 KB
testcase_109 AC 545 ms
28,488 KB
testcase_110 AC 455 ms
26,960 KB
testcase_111 AC 521 ms
27,720 KB
testcase_112 AC 413 ms
26,952 KB
testcase_113 AC 547 ms
27,592 KB
testcase_114 AC 523 ms
27,592 KB
testcase_115 AC 507 ms
27,744 KB
testcase_116 AC 556 ms
27,976 KB
testcase_117 AC 505 ms
27,592 KB
testcase_118 AC 538 ms
27,848 KB
testcase_119 AC 521 ms
27,848 KB
testcase_120 AC 451 ms
26,696 KB
testcase_121 AC 474 ms
27,360 KB
testcase_122 AC 469 ms
27,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

struct random : std::mt19937 {
  using std::mt19937::mt19937;
  using std::mt19937::operator();

  static int64_t gen_seed() {
    return std::chrono::steady_clock::now().time_since_epoch().count();
  }

  random() : std::mt19937(gen_seed()) {}

  template <class Int>
  auto operator()(Int a, Int b)
      -> std::enable_if_t<std::is_integral_v<Int>, Int> {
    return std::uniform_int_distribution<Int>(a, b)(*this);
  }
  template <class Real>
  auto operator()(Real a, Real b)
      -> std::enable_if_t<std::is_floating_point_v<Real>, Real> {
    return std::uniform_real_distribution<Real>(a, b)(*this);
  }
} rng;

#pragma region my_template

struct Rep {
  struct I {
    int i;
    void operator++() { ++i; }
    int operator*() const { return i; }
    bool operator!=(I o) const { return i < *o; }
  };
  const int l_, r_;
  Rep(int l, int r) : l_(l), r_(r) {}
  Rep(int n) : Rep(0, n) {}
  I begin() const { return {l_}; }
  I end() const { return {r_}; }
};
struct Per {
  struct I {
    int i;
    void operator++() { --i; }
    int operator*() const { return i; }
    bool operator!=(I o) const { return i > *o; }
  };
  const int l_, r_;
  Per(int l, int r) : l_(l), r_(r) {}
  Per(int n) : Per(0, n) {}
  I begin() const { return {r_ - 1}; }
  I end() const { return {l_ - 1}; }
};

template <class F>
struct Fix : private F {
  Fix(F f) : F(f) {}
  template <class... Args>
  decltype(auto) operator()(Args&&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class T = int>
T scan() {
  T res;
  std::cin >> res;
  return res;
}

template <class T, class U = T>
bool chmin(T& a, U&& b) {
  return b < a ? a = std::forward<U>(b), true : false;
}
template <class T, class U = T>
bool chmax(T& a, U&& b) {
  return a < b ? a = std::forward<U>(b), true : false;
}

#ifndef LOCAL
#define DUMP(...) void(0)
template <int OnlineJudge, int Local>
constexpr int OjLocal = OnlineJudge;
#endif

using namespace std;

#define ALL(c) begin(c), end(c)

#pragma endregion

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int n = scan();

  int num_queries = 0;
  auto query = [&](int i, int j) -> array<int, 2> {
    assert(0 <= i), assert(i < n * (n - 1));
    assert(0 <= j), assert(j < n * (n - 1));
    ++num_queries;
    assert(num_queries <= n * (n - 1) / 2 * 3);
    cout << "? " << i + 1 << ' ' << j + 1 << endl;
    array<int, 2> res;
    if (OjLocal<0, 1>) {
      static vector<int> ans;
      if (empty(ans)) {
        ans.resize(n * (n - 1));
        iota(ALL(ans), n);
        shuffle(ALL(ans), rng);
        DUMP(ans);
      }
      res[0] = ans[i] / n - ans[j] / n;
      res[1] = ans[i] % n - ans[j] % n;
      sort(ALL(res));
    } else {
      res = {scan(), scan()};
    }
    assert(is_sorted(ALL(res)));
    return res;
  };

  map<map<int, int>, int> mp;
  for (int j : Rep(n, n * n)) {
    map<int, int> cnt;
    for (int i : Rep(n, n * n))
      if (i != j) {
        ++cnt[i / n - j / n];
        ++cnt[i % n - j % n];
      }
    mp[cnt] = j;
  }
  assert(int(size(mp)) == n * (n - 1));

  vector<array<int, 2>> res(n * (n - 1));
  map<int, int> cnt;
  for (int i : Rep(1, n * (n - 1))) {
    res[i] = query(i, 0);
    for (int z : Rep(2)) ++cnt[res[i][z]];
  }
  assert(mp.count(cnt));

  vector<int> ans(n * (n - 1));
  ans[0] = mp[cnt];

  vector<array<int, 2>> pre(n * n);
  for (int x : Rep(n, n * n)) {
    pre[x][0] = x / n - ans[0] / n;
    pre[x][1] = x % n - ans[0] % n;
    sort(ALL(pre[x]));
  }

  vector<vector<int>> pos(n * n);
  pos[ans[0]] = {0};
  for (int i : Rep(1, n * (n - 1))) {
    for (int x : Rep(n, n * n))
      if (x != ans[0] and res[i] == pre[x]) {
        pos[x].push_back(i);
      }
  }
  DUMP(pos);

  int off = -1;
  for (int x : Rep(n, n * n))
    if (size(pos[x]) == 1) {
      ans[pos[x][0]] = x;
      if (x != ans[0] and x / n - ans[0] / n != x % n - ans[0] % n) off = x;
    }
  DUMP(off);

  int pos_off = find(ALL(ans), off) - begin(ans);
  assert(pos_off < n * (n - 1));
  for (int x : Rep(n, n * n))
    if (size(pos[x]) == 2) {
      bool first = true;
      for (int i : pos[x]) {
        array<int, 2> expected;
        expected[0] = x / n - off / n;
        expected[1] = x % n - off % n;
        sort(ALL(expected));
        if (not exchange(first, false) or query(i, pos_off) == expected) {
          ans[i] = x;
          for (int y : Rep(x + 1, n * n))
            if (pos[y] == pos[x]) {
              int other = pos[x][0] ^ pos[x][1] ^ i;
              ans[other] = y;
              pos[y].clear();
              break;
            }
          break;
        }
      }
    }

  cout << '!';
  for (auto&& e : ans) cout << ' ' << e;
  cout << endl;
}
0