結果

問題 No.1306 Exactly 2 Digits
ユーザー ei1333333
提出日時 2020-12-05 00:56:44
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 586 ms / 2,000 ms
コード長 4,064 bytes
コンパイル時間 2,663 ms
コンパイル使用メモリ 212,192 KB
最終ジャッジ日時 2025-01-16 16:38:14
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 123
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}
  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
pair< int, int > ask(int x, int y) {
  cout << "? " << x << " " << y << endl;
  int p, q;
  cin >> p >> q;
  return {p, q};
}
int main() {
  int N;
  cin >> N;
  int M = N * N - N;
  vector< int > ans(M, -1);
  auto f = [&](int a, int b) {
    int x = a / N - b / N;
    int y = a % N - b % N;
    if(x > y) swap(x, y);
    return make_pair(x, y);
  };
  vector< pair< int, int > > ret;
  for(int i = 1; i < M; i++) {
    ret.emplace_back(ask(1, i + 1));
  }
  {
    auto xs{ret};
    sort(begin(xs), end(xs));
    for(int i = 0; i < M; i++) {
      vector< pair< int, int > > X;
      for(int j = 0; j < M; j++) {
        if(i == j) continue;
        X.emplace_back(f(i + N, j + N));
      }
      sort(begin(X), end(X));
      if(X == xs) {
        ans[0] = i + N;
        break;
      }
    }
  }
  map< int, vector< int > > mp;
  for(int i = 0; i < ret.size(); i++) {
    for(int j = 0; j < M; j++) {
      if(ret[i] == f(ans[0], j + N)) {
        mp[j + N].emplace_back(i + 1);
        break;
      }
    }
  }
  while(mp.size()) {
    auto it = begin(mp);
    while(it != end(mp)) {
      if(it->second.size() == 1) {
        ans[it->second.front()] = it->first;
        it = mp.erase(it);
        continue;
      }
      int x = it->first;
      int y = -1;
      for(int i = x + 1; i < N * N; i++) {
        if(f(ans[0], x) == f(ans[0], i)) {
          y = i;
          break;
        }
      }
      bool check = false;
      for(int i = 0; i < M; i++) {
        if(ans[i] == -1) continue;
        if(f(ans[i], x) != f(ans[i], y)) {
          auto beet = ask(i + 1, it->second.front() + 1);
          if(beet == f(ans[i], x)) {
            ans[it->second.front()] = x;
            ans[it->second.back()] = y;
          } else {
            ans[it->second.front()] = y;
            ans[it->second.back()] = x;
          }
          check = true;
          break;
        }
      }
      if(check) {
        it = mp.erase(it);
      } else {
        ++it;
      }
    }
  }
  cout << "! " << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0