#588540 (C++17) No.1306 Exactly 2 Digits

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	trineutron
提出日時	2020-12-03 03:08:17
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	141 ms / 2,000 ms
コード長	2,481 bytes
コンパイル時間	3,596 ms
コンパイル使用メモリ	217,684 KB
実行使用メモリ	24,432 KB
平均クエリ数	1236.78
最終ジャッジ日時	2023-09-24 07:59:25
合計ジャッジ時間	16,434 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	30 ms 23,676 KB
testcase_01	AC	24 ms 23,928 KB
testcase_02	AC	24 ms 23,748 KB
testcase_03	AC	24 ms 23,400 KB
testcase_04	AC	25 ms 23,292 KB
testcase_05	AC	25 ms 23,748 KB
testcase_06	AC	25 ms 23,412 KB
testcase_07	AC	24 ms 24,240 KB
testcase_08	AC	24 ms 23,568 KB
testcase_09	AC	24 ms 23,556 KB
testcase_10	AC	25 ms 23,748 KB
testcase_11	AC	24 ms 23,292 KB
testcase_12	AC	25 ms 23,448 KB
testcase_13	AC	24 ms 23,928 KB
testcase_14	AC	25 ms 23,760 KB
testcase_15	AC	25 ms 23,436 KB
testcase_16	AC	25 ms 23,676 KB
testcase_17	AC	25 ms 23,580 KB
testcase_18	AC	25 ms 23,328 KB
testcase_19	AC	24 ms 23,448 KB
testcase_20	AC	24 ms 23,748 KB
testcase_21	AC	23 ms 23,556 KB
testcase_22	AC	24 ms 23,304 KB
testcase_23	AC	25 ms 23,748 KB
testcase_24	AC	26 ms 23,448 KB
testcase_25	AC	25 ms 23,280 KB
testcase_26	AC	24 ms 24,168 KB
testcase_27	AC	25 ms 23,568 KB
testcase_28	AC	24 ms 23,280 KB
testcase_29	AC	24 ms 24,216 KB
testcase_30	AC	25 ms 23,400 KB
testcase_31	AC	25 ms 24,276 KB
testcase_32	AC	26 ms 23,556 KB
testcase_33	AC	26 ms 23,700 KB
testcase_34	AC	26 ms 24,084 KB
testcase_35	AC	26 ms 23,280 KB
testcase_36	AC	26 ms 23,544 KB
testcase_37	AC	26 ms 24,048 KB
testcase_38	AC	26 ms 24,300 KB
testcase_39	AC	26 ms 23,664 KB
testcase_40	AC	26 ms 23,748 KB
testcase_41	AC	27 ms 23,868 KB
testcase_42	AC	26 ms 23,928 KB
testcase_43	AC	26 ms 24,060 KB
testcase_44	AC	27 ms 24,288 KB
testcase_45	AC	27 ms 24,348 KB
testcase_46	AC	28 ms 23,868 KB
testcase_47	AC	29 ms 23,424 KB
testcase_48	AC	30 ms 23,748 KB
testcase_49	AC	31 ms 24,360 KB
testcase_50	AC	30 ms 24,288 KB
testcase_51	AC	33 ms 23,580 KB
testcase_52	AC	35 ms 24,288 KB
testcase_53	AC	37 ms 23,448 KB
testcase_54	AC	35 ms 24,288 KB
testcase_55	AC	39 ms 24,072 KB
testcase_56	AC	41 ms 23,688 KB
testcase_57	AC	42 ms 23,448 KB
testcase_58	AC	44 ms 24,060 KB
testcase_59	AC	44 ms 24,288 KB
testcase_60	AC	50 ms 23,880 KB
testcase_61	AC	54 ms 23,928 KB
testcase_62	AC	52 ms 24,300 KB
testcase_63	AC	57 ms 23,412 KB
testcase_64	AC	54 ms 23,976 KB
testcase_65	AC	58 ms 24,420 KB
testcase_66	AC	63 ms 24,132 KB
testcase_67	AC	64 ms 23,964 KB
testcase_68	AC	61 ms 23,556 KB
testcase_69	AC	66 ms 23,700 KB
testcase_70	AC	70 ms 23,280 KB
testcase_71	AC	73 ms 24,300 KB
testcase_72	AC	71 ms 23,328 KB
testcase_73	AC	70 ms 23,940 KB
testcase_74	AC	80 ms 23,868 KB
testcase_75	AC	77 ms 23,568 KB
testcase_76	AC	88 ms 23,676 KB
testcase_77	AC	96 ms 23,448 KB
testcase_78	AC	101 ms 23,952 KB
testcase_79	AC	110 ms 23,316 KB
testcase_80	AC	111 ms 24,252 KB
testcase_81	AC	93 ms 24,048 KB
testcase_82	AC	115 ms 23,448 KB
testcase_83	AC	121 ms 24,288 KB
testcase_84	AC	128 ms 23,976 KB
testcase_85	AC	133 ms 23,928 KB
testcase_86	AC	111 ms 24,288 KB
testcase_87	AC	117 ms 24,048 KB
testcase_88	AC	137 ms 23,448 KB
testcase_89	AC	121 ms 23,436 KB
testcase_90	AC	107 ms 23,556 KB
testcase_91	AC	117 ms 23,424 KB
testcase_92	AC	107 ms 23,412 KB
testcase_93	AC	126 ms 23,556 KB
testcase_94	AC	105 ms 23,328 KB
testcase_95	AC	108 ms 23,412 KB
testcase_96	AC	100 ms 23,688 KB
testcase_97	AC	103 ms 23,568 KB
testcase_98	AC	97 ms 23,580 KB
testcase_99	AC	116 ms 23,940 KB
testcase_100	AC	117 ms 23,688 KB
testcase_101	AC	122 ms 23,676 KB
testcase_102	AC	103 ms 23,448 KB
testcase_103	AC	111 ms 23,316 KB
testcase_104	AC	113 ms 23,412 KB
testcase_105	AC	113 ms 23,316 KB
testcase_106	AC	97 ms 24,432 KB
testcase_107	AC	112 ms 24,180 KB
testcase_108	AC	104 ms 23,448 KB
testcase_109	AC	124 ms 23,568 KB
testcase_110	AC	102 ms 23,292 KB
testcase_111	AC	106 ms 24,276 KB
testcase_112	AC	94 ms 24,276 KB
testcase_113	AC	135 ms 23,292 KB
testcase_114	AC	134 ms 23,412 KB
testcase_115	AC	115 ms 23,556 KB
testcase_116	AC	141 ms 23,460 KB
testcase_117	AC	120 ms 23,568 KB
testcase_118	AC	123 ms 23,580 KB
testcase_119	AC	108 ms 23,412 KB
testcase_120	AC	99 ms 23,880 KB
testcase_121	AC	121 ms 24,336 KB
testcase_122	AC	120 ms 23,316 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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;
        assert(i == index.at(dx.at(i) - dxmin).at(dy.at(i) - dymin));
        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));
        }
        assert(dx.at(i) == dxbase + dx.at(base));
        assert(dy.at(i) == dybase + dy.at(base));
        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;
}

yukicoder

結果

テストケース

ソースコード