結果

問題 No.1306 Exactly 2 Digits
ユーザー maspymaspy
提出日時 2022-10-15 11:10:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 140 ms / 2,000 ms
コード長 9,799 bytes
コンパイル時間 3,321 ms
コンパイル使用メモリ 242,904 KB
実行使用メモリ 24,408 KB
平均クエリ数 1236.78
最終ジャッジ日時 2023-09-09 02:24:17
合計ジャッジ時間 19,193 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,048 KB
testcase_01 AC 24 ms
23,412 KB
testcase_02 AC 24 ms
23,400 KB
testcase_03 AC 24 ms
24,000 KB
testcase_04 AC 25 ms
23,376 KB
testcase_05 AC 25 ms
23,844 KB
testcase_06 AC 25 ms
23,640 KB
testcase_07 AC 25 ms
24,336 KB
testcase_08 AC 25 ms
23,652 KB
testcase_09 AC 25 ms
24,048 KB
testcase_10 AC 24 ms
24,360 KB
testcase_11 AC 25 ms
24,264 KB
testcase_12 AC 25 ms
23,340 KB
testcase_13 AC 25 ms
23,412 KB
testcase_14 AC 25 ms
24,240 KB
testcase_15 AC 26 ms
23,988 KB
testcase_16 AC 26 ms
23,784 KB
testcase_17 AC 25 ms
23,856 KB
testcase_18 AC 26 ms
24,036 KB
testcase_19 AC 25 ms
24,336 KB
testcase_20 AC 25 ms
24,228 KB
testcase_21 AC 25 ms
23,664 KB
testcase_22 AC 26 ms
23,544 KB
testcase_23 AC 26 ms
23,592 KB
testcase_24 AC 26 ms
23,784 KB
testcase_25 AC 25 ms
23,424 KB
testcase_26 AC 26 ms
23,484 KB
testcase_27 AC 26 ms
24,348 KB
testcase_28 AC 26 ms
23,376 KB
testcase_29 AC 25 ms
24,372 KB
testcase_30 AC 26 ms
24,276 KB
testcase_31 AC 25 ms
24,324 KB
testcase_32 AC 27 ms
23,340 KB
testcase_33 AC 25 ms
23,652 KB
testcase_34 AC 24 ms
23,484 KB
testcase_35 AC 29 ms
23,652 KB
testcase_36 AC 27 ms
24,288 KB
testcase_37 AC 28 ms
23,532 KB
testcase_38 AC 27 ms
24,036 KB
testcase_39 AC 25 ms
24,384 KB
testcase_40 AC 27 ms
24,060 KB
testcase_41 AC 25 ms
23,376 KB
testcase_42 AC 25 ms
23,400 KB
testcase_43 AC 25 ms
23,328 KB
testcase_44 AC 27 ms
23,388 KB
testcase_45 AC 28 ms
23,484 KB
testcase_46 AC 27 ms
24,000 KB
testcase_47 AC 28 ms
24,372 KB
testcase_48 AC 29 ms
24,408 KB
testcase_49 AC 29 ms
23,628 KB
testcase_50 AC 31 ms
23,544 KB
testcase_51 AC 31 ms
23,172 KB
testcase_52 AC 35 ms
23,424 KB
testcase_53 AC 37 ms
23,988 KB
testcase_54 AC 35 ms
24,024 KB
testcase_55 AC 37 ms
24,012 KB
testcase_56 AC 39 ms
23,376 KB
testcase_57 AC 41 ms
23,616 KB
testcase_58 AC 43 ms
23,352 KB
testcase_59 AC 41 ms
23,844 KB
testcase_60 AC 50 ms
23,784 KB
testcase_61 AC 53 ms
24,060 KB
testcase_62 AC 52 ms
24,264 KB
testcase_63 AC 55 ms
24,288 KB
testcase_64 AC 53 ms
23,376 KB
testcase_65 AC 56 ms
23,424 KB
testcase_66 AC 62 ms
23,328 KB
testcase_67 AC 64 ms
23,388 KB
testcase_68 AC 64 ms
23,796 KB
testcase_69 AC 66 ms
24,048 KB
testcase_70 AC 67 ms
23,616 KB
testcase_71 AC 71 ms
23,580 KB
testcase_72 AC 71 ms
23,844 KB
testcase_73 AC 70 ms
24,240 KB
testcase_74 AC 81 ms
23,424 KB
testcase_75 AC 78 ms
24,048 KB
testcase_76 AC 88 ms
23,616 KB
testcase_77 AC 95 ms
23,388 KB
testcase_78 AC 99 ms
24,324 KB
testcase_79 AC 107 ms
23,424 KB
testcase_80 AC 112 ms
24,360 KB
testcase_81 AC 90 ms
23,964 KB
testcase_82 AC 115 ms
24,072 KB
testcase_83 AC 116 ms
23,388 KB
testcase_84 AC 126 ms
23,664 KB
testcase_85 AC 135 ms
23,496 KB
testcase_86 AC 112 ms
24,360 KB
testcase_87 AC 115 ms
23,376 KB
testcase_88 AC 137 ms
23,640 KB
testcase_89 AC 121 ms
24,276 KB
testcase_90 AC 104 ms
23,484 KB
testcase_91 AC 120 ms
23,352 KB
testcase_92 AC 106 ms
23,796 KB
testcase_93 AC 125 ms
24,300 KB
testcase_94 AC 103 ms
24,060 KB
testcase_95 AC 110 ms
23,340 KB
testcase_96 AC 104 ms
24,048 KB
testcase_97 AC 103 ms
24,228 KB
testcase_98 AC 98 ms
24,240 KB
testcase_99 AC 116 ms
24,012 KB
testcase_100 AC 117 ms
23,592 KB
testcase_101 AC 127 ms
24,240 KB
testcase_102 AC 103 ms
23,628 KB
testcase_103 AC 110 ms
23,640 KB
testcase_104 AC 113 ms
24,228 KB
testcase_105 AC 112 ms
24,384 KB
testcase_106 AC 99 ms
23,856 KB
testcase_107 AC 112 ms
23,424 KB
testcase_108 AC 105 ms
24,288 KB
testcase_109 AC 128 ms
23,592 KB
testcase_110 AC 103 ms
24,024 KB
testcase_111 AC 106 ms
23,580 KB
testcase_112 AC 96 ms
24,228 KB
testcase_113 AC 132 ms
24,312 KB
testcase_114 AC 134 ms
23,412 KB
testcase_115 AC 113 ms
23,328 KB
testcase_116 AC 140 ms
24,372 KB
testcase_117 AC 117 ms
23,484 KB
testcase_118 AC 124 ms
23,604 KB
testcase_119 AC 109 ms
23,376 KB
testcase_120 AC 97 ms
23,352 KB
testcase_121 AC 119 ms
23,556 KB
testcase_122 AC 119 ms
23,616 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: ラムダ関数内:
main.cpp:37:3: 警告: 制御が非 void 関数の終りに到達しました [-Wreturn-type]
   37 | #define vvvv(type, name, a, b, c, ...)       \
      |   ^

ソースコード

diff # 

#line 1 "/home/maspy/compro/library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
  overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

template <typename T, typename U>
T SUM(const vector<U> &A) {
  T sum = 0;
  for (auto &&a: A) sum += a;
  return sum;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
T pick(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}

template <typename T>
T pick(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}

template <typename T>
T pick(pqg<T> &que) {
  assert(que.size());
  T a = que.top();
  que.pop();
  return a;
}

template <typename T>
T pick(vc<T> &que) {
  assert(que.size());
  T a = que.back();
  que.pop_back();
  return a;
}

template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}

template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}

template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

template <typename F>
ll binary_search(F check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return ok;
}

template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

vc<int> s_to_vi(const string &S, char first_char) {
  vc<int> A(S.size());
  FOR(i, S.size()) { A[i] = S[i] - first_char; }
  return A;
}

template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
  vc<CNT> C(size);
  for (auto &&x: A) { ++C[x]; }
  return C;
}

// stable
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(A.size());
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  int n = len(I);
  vc<T> B(n);
  FOR(i, n) B[i] = A[I[i]];
  return B;
}
#line 1 "/home/maspy/compro/library/other/io2.hpp"
#define INT(...) \
  int __VA_ARGS__; \
  IN(__VA_ARGS__)
#define LL(...) \
  ll __VA_ARGS__; \
  IN(__VA_ARGS__)
#define STR(...) \
  string __VA_ARGS__; \
  IN(__VA_ARGS__)
#define CHR(...) \
  char __VA_ARGS__; \
  IN(__VA_ARGS__)
#define DBL(...) \
  long double __VA_ARGS__; \
  IN(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void read(int &a) { cin >> a; }
void read(long long &a) { cin >> a; }
void read(char &a) { cin >> a; }
void read(double &a) { cin >> a; }
void read(long double &a) { cin >> a; }
void read(string &a) { cin >> a; }
template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }
template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}
template <class T> void read(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
  read(head);
  IN(tail...);
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& A) {
  os << A.fi << " " << A.se;
  return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& A) {
  for (size_t i = 0; i < A.size(); i++) {
    if(i) os << " ";
    os << A[i];
  }
  return os;
}

void print() {
  cout << "\n";
  cout.flush();
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail)) cout << " ";
  print(forward<Tail>(tail)...);
}

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 3 "main.cpp"

void solve() {
  LL(N);

  auto ask = [&](int i, int j) -> pi {
    if (i == j) return {0, 0};
    print("?", 1 + i, 1 + j);
    LL(a, b);
    return {a, b};
  };

  ll L = N * N - N;

  vc<pi> F(L);
  FOR(j, N * N - N) { F[j] = ask(j, 0); }

  vi SM(L);
  FOR(i, L) {
    auto [a, b] = F[i];
    SM[i] = a + b;
  }

  ll p = min_element(all(SM)) - SM.begin();
  ll q = max_element(all(SM)) - SM.begin();
  // A[p] = (1, 0), A[q] = (N-1, N-1)
  // A[0] を決める
  auto [a, b] = [&]() -> pi {
    FOR(a, 1, N) FOR(b, N) {
      pi x = {1 - a, 0 - b};
      pi y = {N - 1 - a, N - 1 - b};
      if (x.fi > x.se) swap(x.fi, x.se);
      if (y.fi > y.se) swap(y.fi, y.se);
      if (x == F[p] && y == F[q]) return {a, b};
    }
  }();

  // A[0] = (a, b)
  // A[p] = (1, 0), A[q] = (N-1, N-1)
  vc<pi> ANS(L);
  ANS[0] = {a, b};
  ANS[p] = {1, 0};
  ANS[q] = {N - 1, N - 1};

  map<pi, vi> IDS;
  FOR(i, L) { IDS[F[i]].eb(i); }

  for (auto&& [key, I]: IDS) {
    auto [s, t] = key;
    // A[0] との差が (s,t) であるようなもののインデックスが I
    vc<pi> cand;
    int x1 = a + s, y1 = b + t;
    int x2 = a + t, y2 = b + s;
    if (1 <= x1 && x1 < N && 0 <= y1 && y1 < N) cand.eb(x1, y1);
    if (1 <= x2 && x2 < N && 0 <= y2 && y2 < N) cand.eb(x2, y2);
    UNIQUE(cand);

    if (len(I) == 1) {
      assert(len(cand) == 1);
      ANS[I[0]] = cand[0];
      continue;
    }
    if (a == b) {
      // ask (1,0)
      int i = I[0];
      pi t = ask(i, p);
      pi u = {x1 - 1, y1 - 0};
      if (u.fi > u.se) swap(u.fi, u.se);
      if (t == u) {
        ANS[I[0]] = {x1, y1};
        ANS[I[1]] = {x2, y2};
      } else {
        ANS[I[0]] = {x2, y2};
        ANS[I[1]] = {x1, y1};
      }
    } else {
      // ask (N-1,N-1)
      int i = I[0];
      pi t = ask(i, q);
      pi u = {x1 - (N - 1), y1 - (N - 1)};
      if (u.fi > u.se) swap(u.fi, u.se);
      if (t == u) {
        ANS[I[0]] = {x1, y1};
        ANS[I[1]] = {x2, y2};
      } else {
        ANS[I[0]] = {x2, y2};
        ANS[I[1]] = {x1, y1};
      }
    }
  }

  vi A(L);
  FOR(i, L) {
    auto [a, b] = ANS[i];
    A[i] = N * a + b;
  }
  print("!", A);
}

signed main() {
  cout << fixed << setprecision(15);

  ll T = 1;
  // LL(T);
  FOR(T) solve();

  return 0;
}
0