結果

問題 No.1306 Exactly 2 Digits
ユーザー tokusakuraitokusakurai
提出日時 2020-12-03 14:32:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,048 bytes
コンパイル時間 2,557 ms
コンパイル使用メモリ 220,496 KB
実行使用メモリ 24,540 KB
平均クエリ数 1237.78
最終ジャッジ日時 2023-09-24 08:24:21
合計ジャッジ時間 23,594 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
23,448 KB
testcase_01 AC 26 ms
24,060 KB
testcase_02 AC 24 ms
24,384 KB
testcase_03 AC 24 ms
23,640 KB
testcase_04 AC 24 ms
23,652 KB
testcase_05 AC 25 ms
23,400 KB
testcase_06 AC 25 ms
24,060 KB
testcase_07 AC 25 ms
24,336 KB
testcase_08 AC 25 ms
23,412 KB
testcase_09 AC 26 ms
24,348 KB
testcase_10 AC 26 ms
23,544 KB
testcase_11 WA -
testcase_12 AC 25 ms
23,496 KB
testcase_13 AC 26 ms
23,652 KB
testcase_14 WA -
testcase_15 AC 25 ms
23,640 KB
testcase_16 AC 26 ms
23,856 KB
testcase_17 AC 26 ms
24,468 KB
testcase_18 AC 25 ms
23,664 KB
testcase_19 AC 25 ms
24,084 KB
testcase_20 WA -
testcase_21 AC 25 ms
23,976 KB
testcase_22 AC 25 ms
24,336 KB
testcase_23 AC 27 ms
24,048 KB
testcase_24 AC 25 ms
24,324 KB
testcase_25 AC 26 ms
23,556 KB
testcase_26 WA -
testcase_27 AC 27 ms
24,096 KB
testcase_28 AC 25 ms
23,604 KB
testcase_29 AC 26 ms
23,964 KB
testcase_30 WA -
testcase_31 AC 26 ms
23,376 KB
testcase_32 WA -
testcase_33 AC 25 ms
24,036 KB
testcase_34 WA -
testcase_35 AC 25 ms
23,544 KB
testcase_36 AC 25 ms
23,556 KB
testcase_37 AC 25 ms
23,988 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 27 ms
23,424 KB
testcase_41 AC 26 ms
24,336 KB
testcase_42 AC 26 ms
24,060 KB
testcase_43 AC 27 ms
24,300 KB
testcase_44 AC 27 ms
23,340 KB
testcase_45 WA -
testcase_46 AC 28 ms
24,312 KB
testcase_47 AC 30 ms
24,000 KB
testcase_48 AC 31 ms
23,436 KB
testcase_49 WA -
testcase_50 AC 31 ms
23,568 KB
testcase_51 AC 32 ms
23,568 KB
testcase_52 AC 35 ms
23,496 KB
testcase_53 WA -
testcase_54 AC 36 ms
23,436 KB
testcase_55 WA -
testcase_56 AC 41 ms
24,000 KB
testcase_57 WA -
testcase_58 WA -
testcase_59 AC 41 ms
23,604 KB
testcase_60 WA -
testcase_61 AC 54 ms
24,336 KB
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 AC 65 ms
23,508 KB
testcase_69 AC 65 ms
23,988 KB
testcase_70 AC 70 ms
23,652 KB
testcase_71 WA -
testcase_72 AC 73 ms
23,664 KB
testcase_73 AC 73 ms
23,628 KB
testcase_74 WA -
testcase_75 AC 77 ms
23,544 KB
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 AC 110 ms
23,424 KB
testcase_81 AC 93 ms
23,448 KB
testcase_82 AC 118 ms
23,448 KB
testcase_83 AC 118 ms
23,628 KB
testcase_84 WA -
testcase_85 WA -
testcase_86 AC 114 ms
23,604 KB
testcase_87 WA -
testcase_88 AC 141 ms
23,508 KB
testcase_89 AC 117 ms
24,240 KB
testcase_90 AC 105 ms
23,988 KB
testcase_91 AC 118 ms
23,568 KB
testcase_92 AC 107 ms
24,216 KB
testcase_93 WA -
testcase_94 WA -
testcase_95 AC 116 ms
23,340 KB
testcase_96 AC 109 ms
23,496 KB
testcase_97 AC 104 ms
24,216 KB
testcase_98 AC 101 ms
23,988 KB
testcase_99 AC 114 ms
24,312 KB
testcase_100 WA -
testcase_101 WA -
testcase_102 AC 107 ms
23,988 KB
testcase_103 AC 114 ms
23,436 KB
testcase_104 WA -
testcase_105 AC 112 ms
23,652 KB
testcase_106 AC 106 ms
24,372 KB
testcase_107 AC 113 ms
24,324 KB
testcase_108 AC 109 ms
24,324 KB
testcase_109 WA -
testcase_110 WA -
testcase_111 WA -
testcase_112 WA -
testcase_113 WA -
testcase_114 WA -
testcase_115 WA -
testcase_116 AC 138 ms
23,484 KB
testcase_117 AC 121 ms
23,856 KB
testcase_118 AC 124 ms
23,988 KB
testcase_119 AC 111 ms
23,436 KB
testcase_120 WA -
testcase_121 WA -
testcase_122 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int N;

pii query(int i, int j){
    cout << "? " << j+1 << ' ' << i+1 << endl;
    int x, y; cin >> x >> y;
    return pii(x, y);
}

void answer(vector<pii> ans){
    cout << '!';
    each(e, ans) cout << ' ' << N*(e.second+1)+e.first;
    cout << endl;
}

int main(){
    cin >> N;
    map<pii, vector<int>> mp;
    rep(i, N*(N-1)){
        mp[query(0, i)].eb(i);
    }

    vector<pii> ans(N*(N-1), pii(-1, -1));
    int l = 0;
    while(mp.count(pii(l, l))) --l;
    int r = 0;
    while(mp.count(pii(r, r))) ++r;

    int k = r-l-1;
    pii c1 = pii(0, N-1-k), c2 = pii(N-k, 0);
    c1.first -= l+1, c1.second -= l+1, c2.first -= l+1, c2.second -= l+1;

    map<pii, int> cmp;
    rep(i, N) rep(j, N-1){
        int x = i-c1.first, y = j-c1.second;
        cmp[minmax(x, y)]++;
    }

    bool flag = true;
    each(e, mp){
        if(sz(e.second) != cmp[e.first]) flag = false;
    }
    if(!flag) swap(c1, c2);
    auto [cx, cy] = c1;

    each(e, mp){
        if(sz(e.second) == 1){
            auto [dx, dy] = e.first;
            if(0 <= cx+dx && cx+dx < N && 0 <= cy+dy && cy+dy < N-1) ans[e.second[0]] = pii(cx+dx, cy+dy);
            else ans[e.second[0]] = pii(cx+dy, cy+dx);
        }
    }

    int id1 = 0, id2 = 0;
    rep(i, N*(N-1)){
        if(ans[i].first == 0 && ans[i].second == 0) id1 = i;
        if(ans[i].first == N-1 && ans[i].second == N-2) id2 = i;
    }
    
    each(e, mp){
        if(sz(e.second) == 2){
            auto [dx, dy] = e.first;
            int p = e.second[0], q = e.second[1];
            if(cx != cy){
                auto [x, y] = query(id1, p);
                if(x == cx+dx && y == cy+dy) ans[p] = pii(cx+dx, cy+dy), ans[q] = pii(cx+dy, cy+dx); 
                else ans[q] = pii(cx+dx, cy+dy), ans[p] = pii(cx+dy, cy+dx); 
            }
            else{
                auto [x, y] = query(id2, p);
                if(N-1-x == cx+dx && N-2-y == cy+dy) ans[p] = pii(cx+dx, cy+dy), ans[q] = pii(cx+dy, cy+dx); 
                else ans[q] = pii(cx+dx, cy+dy), ans[p] = pii(cx+dy, cy+dx); 
            }
        }
    }

    answer(ans);
}
0