結果

問題 No.1306 Exactly 2 Digits
ユーザー trineutrontrineutron
提出日時 2020-12-03 02:06:02
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 144 ms / 2,000 ms
コード長 2,311 bytes
コンパイル時間 2,445 ms
コンパイル使用メモリ 216,528 KB
実行使用メモリ 24,396 KB
平均クエリ数 1236.78
最終ジャッジ日時 2023-09-24 07:54:36
合計ジャッジ時間 17,147 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
23,616 KB
testcase_01 AC 26 ms
23,640 KB
testcase_02 AC 26 ms
23,832 KB
testcase_03 AC 27 ms
23,844 KB
testcase_04 AC 26 ms
23,808 KB
testcase_05 AC 26 ms
23,424 KB
testcase_06 AC 26 ms
23,508 KB
testcase_07 AC 27 ms
23,640 KB
testcase_08 AC 26 ms
23,388 KB
testcase_09 AC 26 ms
23,832 KB
testcase_10 AC 26 ms
23,640 KB
testcase_11 AC 27 ms
24,048 KB
testcase_12 AC 27 ms
23,520 KB
testcase_13 AC 26 ms
24,372 KB
testcase_14 AC 26 ms
23,616 KB
testcase_15 AC 26 ms
24,036 KB
testcase_16 AC 27 ms
24,276 KB
testcase_17 AC 27 ms
24,048 KB
testcase_18 AC 27 ms
23,832 KB
testcase_19 AC 27 ms
24,012 KB
testcase_20 AC 27 ms
24,348 KB
testcase_21 AC 27 ms
24,036 KB
testcase_22 AC 27 ms
23,820 KB
testcase_23 AC 27 ms
24,024 KB
testcase_24 AC 27 ms
23,508 KB
testcase_25 AC 26 ms
24,024 KB
testcase_26 AC 27 ms
23,532 KB
testcase_27 AC 27 ms
24,036 KB
testcase_28 AC 26 ms
23,520 KB
testcase_29 AC 27 ms
24,036 KB
testcase_30 AC 27 ms
23,640 KB
testcase_31 AC 27 ms
24,360 KB
testcase_32 AC 27 ms
23,364 KB
testcase_33 AC 27 ms
23,640 KB
testcase_34 AC 28 ms
24,048 KB
testcase_35 AC 28 ms
24,060 KB
testcase_36 AC 28 ms
23,640 KB
testcase_37 AC 27 ms
24,360 KB
testcase_38 AC 28 ms
23,400 KB
testcase_39 AC 27 ms
24,036 KB
testcase_40 AC 27 ms
23,376 KB
testcase_41 AC 27 ms
24,036 KB
testcase_42 AC 27 ms
24,036 KB
testcase_43 AC 28 ms
23,388 KB
testcase_44 AC 29 ms
23,400 KB
testcase_45 AC 28 ms
23,532 KB
testcase_46 AC 30 ms
23,820 KB
testcase_47 AC 31 ms
24,048 KB
testcase_48 AC 33 ms
24,288 KB
testcase_49 AC 32 ms
23,520 KB
testcase_50 AC 34 ms
24,348 KB
testcase_51 AC 35 ms
23,520 KB
testcase_52 AC 37 ms
23,364 KB
testcase_53 AC 39 ms
23,640 KB
testcase_54 AC 37 ms
23,532 KB
testcase_55 AC 40 ms
23,652 KB
testcase_56 AC 41 ms
24,048 KB
testcase_57 AC 42 ms
24,324 KB
testcase_58 AC 44 ms
24,288 KB
testcase_59 AC 44 ms
23,424 KB
testcase_60 AC 51 ms
24,396 KB
testcase_61 AC 56 ms
24,324 KB
testcase_62 AC 53 ms
23,412 KB
testcase_63 AC 59 ms
24,048 KB
testcase_64 AC 57 ms
24,276 KB
testcase_65 AC 59 ms
24,372 KB
testcase_66 AC 63 ms
23,628 KB
testcase_67 AC 66 ms
23,640 KB
testcase_68 AC 65 ms
24,012 KB
testcase_69 AC 71 ms
23,412 KB
testcase_70 AC 70 ms
23,376 KB
testcase_71 AC 74 ms
24,288 KB
testcase_72 AC 72 ms
24,024 KB
testcase_73 AC 73 ms
24,024 KB
testcase_74 AC 85 ms
24,000 KB
testcase_75 AC 81 ms
23,892 KB
testcase_76 AC 91 ms
23,388 KB
testcase_77 AC 96 ms
23,364 KB
testcase_78 AC 105 ms
23,520 KB
testcase_79 AC 112 ms
24,036 KB
testcase_80 AC 115 ms
24,360 KB
testcase_81 AC 96 ms
24,060 KB
testcase_82 AC 115 ms
23,532 KB
testcase_83 AC 119 ms
24,360 KB
testcase_84 AC 128 ms
24,348 KB
testcase_85 AC 137 ms
24,024 KB
testcase_86 AC 112 ms
24,276 KB
testcase_87 AC 121 ms
24,372 KB
testcase_88 AC 144 ms
23,376 KB
testcase_89 AC 123 ms
23,532 KB
testcase_90 AC 104 ms
23,640 KB
testcase_91 AC 122 ms
23,832 KB
testcase_92 AC 110 ms
24,276 KB
testcase_93 AC 128 ms
23,652 KB
testcase_94 AC 108 ms
24,264 KB
testcase_95 AC 117 ms
23,652 KB
testcase_96 AC 106 ms
23,616 KB
testcase_97 AC 106 ms
23,508 KB
testcase_98 AC 101 ms
23,376 KB
testcase_99 AC 112 ms
24,384 KB
testcase_100 AC 119 ms
23,628 KB
testcase_101 AC 131 ms
23,688 KB
testcase_102 AC 106 ms
24,252 KB
testcase_103 AC 115 ms
23,664 KB
testcase_104 AC 113 ms
24,360 KB
testcase_105 AC 114 ms
23,400 KB
testcase_106 AC 103 ms
23,820 KB
testcase_107 AC 118 ms
23,640 KB
testcase_108 AC 107 ms
24,276 KB
testcase_109 AC 131 ms
23,628 KB
testcase_110 AC 108 ms
23,712 KB
testcase_111 AC 110 ms
23,640 KB
testcase_112 AC 100 ms
23,604 KB
testcase_113 AC 137 ms
24,276 KB
testcase_114 AC 139 ms
23,832 KB
testcase_115 AC 114 ms
24,348 KB
testcase_116 AC 143 ms
24,012 KB
testcase_117 AC 121 ms
23,388 KB
testcase_118 AC 128 ms
23,832 KB
testcase_119 AC 112 ms
24,384 KB
testcase_120 AC 103 ms
23,376 KB
testcase_121 AC 123 ms
23,364 KB
testcase_122 AC 121 ms
23,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    int m = n * (n - 1);
    vector<int> dx(m), dy(m);
    for (int i = 1; i < m; i++) {
        cout << "? " << i + 1 << " " << 1 << endl;
        cin >> dx.at(i) >> dy.at(i);
    }
    int dxmax = *max_element(dx.begin(), dx.end()),
        dymax = *max_element(dy.begin(), dy.end()),
        dxmin = *min_element(dx.begin(), dx.end()),
        dymin = *min_element(dy.begin(), dy.end());
    if (dxmax - dxmin < n - 1) {
        swap(dxmax, dymax);
        swap(dxmin, dymin);
        for (int i = 0; i < m; i++) {
            swap(dx.at(i), dy.at(i));
        }
    }
    assert(dxmax - dxmin == n - 1);
    assert(dymax - dymin == n - 2);
    map<pair<int, int>, bool> twoway;
    vector index(n, vector(n - 1, -1));
    for (int i = 0; i < m; i++) {
        if (index.at(dx.at(i) - dxmin).at(dy.at(i) - dymin) != -1) {
            twoway[{dx.at(i), dy.at(i)}] = true;
            swap(dx.at(i), dy.at(i));
            twoway[{dx.at(i), dy.at(i)}] = true;
        }
        index.at(dx.at(i) - dxmin).at(dy.at(i) - dymin) = i;
    }
    int base = -1;
    for (int i = 0; i < m; i++) {
        if (dxmin != dymin and dx.at(i) == dxmin and dy.at(i) == dymin) {
            base = i;
            break;
        }
        if (dxmin == dymin and dx.at(i) == dxmax and dy.at(i) == dymax) {
            base = i;
            break;
        }
    }
    vector<bool> visited(m);
    for (int i = 0; i < m; i++) {
        if (visited.at(i)) continue;
        if (not twoway[{dx.at(i), dy.at(i)}]) continue;
        int co_i = index.at(dy.at(i) - dxmin).at(dx.at(i) - dymin);
        cout << "? " << i + 1 << " " << base + 1 << endl;
        int dxbase, dybase;
        cin >> dxbase >> dybase;
        if (dx.at(i) != dxbase + dx.at(base)) {
            swap(dx.at(i), dy.at(i));
        }
        if (dx.at(i) != dxbase + dx.at(base)) {
            swap(dxbase, dybase);
        }
        if (dx.at(i) != dxbase + dx.at(base)) {
            swap(dx.at(i), dy.at(i));
        }
        dx.at(co_i) = dy.at(i);
        dy.at(co_i) = dx.at(i);
        visited.at(co_i) = true;
    }
    cout << "!";
    for (int i = 0; i < m; i++) {
        cout << " " << n * (dy.at(i) - dymin) + (dx.at(i) - dxmin) + n;
    }
    cout << endl;
}
0