結果
問題 | No.1306 Exactly 2 Digits |
ユーザー |
![]() |
提出日時 | 2020-12-04 01:19:13 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 188 ms / 2,000 ms |
コード長 | 5,499 bytes |
コンパイル時間 | 3,209 ms |
コンパイル使用メモリ | 211,628 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 1236.78 |
最終ジャッジ日時 | 2024-07-17 09:22:49 |
合計ジャッジ時間 | 19,384 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 123 |
ソースコード
//*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/#include <bits/stdc++.h>// #include <atcoder/all>using namespace std;// using namespace atcoder;#define DEBUG(x) cerr<<#x<<": "<<x<<endl;#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector< vector<int> >#define vll vector< vector<ll> >#define vs vector<string>#define pii pair<int,int>#define pis pair<int,string>#define psi pair<string,int>#define pll pair<ll,ll>template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }#define X first#define Y second#define rep(i,n) for(int i=0;i<(int)(n);i++)#define rep1(i,n) for(int i=1;i<=(int)(n);i++)#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)#define rrep1(i,n) for(int i=(int)(n);i>0;i--)#define REP(i,a,b) for(int i=a;i<b;i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(),c.end()void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };#define fio() cin.tie(0); ios::sync_with_stdio(false);// const ll MOD = 1000000007;const ll MOD = 998244353;// #define mp make_pair//#define endl '\n'pii ask(int i, int j) {cout << "? " << i + 1 << " " << j + 1 << endl;int p, q;cin >> p >> q;return pii(p, q);}signed main() {fio();map<vi, vi> mp;int n;cin >> n;for (int i = n; i < n * n; i++) {int sum = 0;int mi = inf, ma = -inf;for (int j = n; j < n * n; j++) {if (i == j) continue;int p = i / n - j / n;int q = i % n - j % n;sum += p + q;chmin(mi, min(p, q));chmax(ma, max(p, q));}vi temp = {sum, mi, ma};mp[temp].push_back(i);}int mi = inf, ma = -inf;int sum = 0;map<pii, vi> as;for (int i = 1; i < n * n - n; i++) {pii res = ask(0, i);as[res].push_back(i);sum += res.first + res.second;chmin(mi, res.first);chmax(ma, res.second);}vi temp = {sum, mi, ma};vi ans(n * n - n);ans[0] = mp[temp][0];int x = ans[0];int y;if (x == n) y = n * n - 1;else y = n;pii mm;if (x == n) mm = pii(inf, inf);else mm = pii(-inf, -inf);for (auto itr = as.begin(); itr != as.end(); itr++) {if (itr->second.size() == 2) continue;pii p = itr->first;int y = itr->second[0];if (x == n) {chmin(mm, pii(p.first + p.second, y));}else {chmax(mm, pii(p.first + p.second, y));}}// DEBUG(mm);int yi = mm.second;ans[yi] = y;// DEBUG(pii(x, y));map<pii, vi> to1, to2;for (int j = n; j < n * n; j++) {int p = x / n - j / n;int q = x % n - j % n;to1[pii(min(p, q), max(p, q))].push_back(j);p = y / n - j / n;q = y % n - j % n;to2[pii(min(p, q), max(p, q))].push_back(j);}// DEBUG_VEC(ans);for (auto itr = as.begin(); itr != as.end(); itr++) {if (itr->second.size() == 1) {int idx = itr->second[0];// DEBUG(itr->first);// DEBUG(to1[itr->first].size());int value = to1[itr->first][0];ans[idx] = value;continue;}int idx1 = itr->second[0], idx2 = itr->second[1];pii res = ask(yi, idx1);for (int val1: to1[itr->first]) {for (int val2: to2[res]) {if (val1 == val2) {ans[idx1] = val1;for (int val3: to1[itr->first]) {if (val3 != val1) {ans[idx2] = val3;break;}}break;}}}}cout << "! ";rep (i, ans.size()) {cout << ans[i] << " ";}cout << endl;}