結果

問題 No.1306 Exactly 2 Digits
ユーザー 👑 hitonanodehitonanode
提出日時 2020-12-03 01:27:28
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 143 ms / 2,000 ms
コード長 6,136 bytes
コンパイル時間 2,794 ms
コンパイル使用メモリ 222,152 KB
実行使用メモリ 24,384 KB
平均クエリ数 1236.78
最終ジャッジ日時 2023-09-24 07:44:16
合計ジャッジ時間 17,081 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x) {}
#endif

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

pint simulate(pint pi, pint pj) {
    pint ret = pi - pj;
    if (ret.first > ret.second) swap(ret.first, ret.second);
    return ret;
}

int main()
{
    int N;
    cin >> N;
    const int L = N * N - N;
    vector<pint> ans(L);
    map<int, int> mp;
    map<pint, vector<int>> p2i;
    mp[0] += 2;
    FOR(i, 1, L) {
        ans[i] = query(i, 0);
        p2i[ans[i]].emplace_back(i);
        if (ans[i].first * ans[i].second == 0) mp[ans[i].first + ans[i].second]++;
    }
    const int lo = mp.begin()->first;
    const int hi = prev(mp.end())->first;
    int lo2 = lo, hi2 = hi;
    while (mp[lo2] == 1) lo2++;
    while (mp[hi2] == 1) hi2--;
    int d1 = hi2 - lo, d2 = hi - lo2;
    vector<pint> ret(L, pint(-1, -1));
    if (hi2 - lo == N - 1 and hi - lo2 == N - 2) {
        ret[0] = make_pair(-lo2 + 1, -lo); // (十, 一)
    } else if (hi2 - lo == N - 2 and hi - lo2 == N - 1) {
        ret[0] = make_pair(-lo + 1, -lo2);
    } else {
        exit(8);
    }

    auto is_valid = [&](pint p) -> bool { return p.first > 0 and p.first < N and p.second >= 0 and p.second < N; };

    vector<int> ics;
    for (const auto [p, is] : p2i) {
        pint pa = p;
        if (is.size() == 1) {
            int i = is[0];
            pint pcand = ret[0] + pa;
            if (is_valid(pcand)) ret[i] = pcand;
            else {
                swap(pa.first, pa.second);
                ret[i] = ret[0] + pa;
            }
            ics.emplace_back(i);
        }
    }

    assert(ics.size() > 0);


    for (const auto [p, is] : p2i) {
        if (is.size() == 2) {
            pint pa = p;
            int i = is[0], j = is[1];

            pint p1 = ret[0] + pa;
            swap(pa.first, pa.second);
            pint p2 = ret[0] + pa;
            for (auto ic : ics) {
                pint psim1 = simulate(p1, ret[ic]);
                pint psim2 = simulate(p2, ret[ic]);
                if (psim1 != psim2) {
                    pint ptmp = query(i, ic);
                    if (psim1 == ptmp) ret[i] = p1, ret[j] = p2;
                    else ret[i] = p2, ret[j] = p1;
                    break;
                }
            }
        }
    }
    cout << "! ";
    for (auto x : ret) cout << x.first * N + x.second << ' ';
    cout << endl;
}
0