結果

問題 No.850 企業コンテスト2位
ユーザー 👑 hitonanodehitonanode
提出日時 2019-07-05 22:39:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,488 bytes
コンパイル時間 2,228 ms
コンパイル使用メモリ 180,612 KB
実行使用メモリ 24,420 KB
平均クエリ数 216.14
最終ジャッジ日時 2023-09-23 17:32:46
合計ジャッジ時間 5,428 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
23,664 KB
testcase_01 AC 24 ms
23,964 KB
testcase_02 AC 24 ms
23,952 KB
testcase_03 AC 25 ms
23,364 KB
testcase_04 AC 23 ms
23,508 KB
testcase_05 AC 24 ms
23,592 KB
testcase_06 AC 24 ms
24,156 KB
testcase_07 AC 29 ms
24,228 KB
testcase_08 AC 31 ms
24,000 KB
testcase_09 AC 30 ms
24,108 KB
testcase_10 WA -
testcase_11 AC 34 ms
23,508 KB
testcase_12 WA -
testcase_13 AC 37 ms
23,964 KB
testcase_14 AC 34 ms
23,328 KB
testcase_15 AC 34 ms
23,772 KB
testcase_16 AC 34 ms
24,216 KB
testcase_17 WA -
testcase_18 AC 34 ms
23,760 KB
testcase_19 AC 36 ms
24,000 KB
testcase_20 AC 34 ms
23,352 KB
testcase_21 WA -
testcase_22 AC 34 ms
23,604 KB
testcase_23 AC 36 ms
23,388 KB
testcase_24 AC 35 ms
23,940 KB
testcase_25 AC 35 ms
23,952 KB
testcase_26 WA -
testcase_27 AC 24 ms
23,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
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> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
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> ostream &operator<<(ostream &os, const unordered_set<T> &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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

int N;

vector<vector<int>> wins;

int main()
{
    cin >> N;
    wins.resize(N + 1);

    vector<int> ik(N);
    REP(i, N) ik[i] = i + 1;
    while (ik.size() > 1)
    {
        vector<int> ikn;
        for (int i = 0; i + 1 < ik.size(); i += 2)
        {
            cout << "? " << ik[i] << " " << ik[i + 1] << endl;
            int ans;
            cin >> ans;
            wins[ans].emplace_back(ik[i] + ik[i + 1] - ans);
            ikn.push_back(ans);
        }
        if (ik.size() % 2) ikn.push_back(ik.back());
        swap(ik, ikn);
    }

    vector<int> cand = wins[ik[0]];
    map<int, int> cinv;
    REP(i, cand.size()) cinv[cand[i]] = i;
    int M = cand.size();
    vector<vector<int>> D(M, vector<int>(M));
    REP(i, M) REP(j, i)
    {
        cout << "? " << cand[i] << " " << cand[j] << endl;
        int ans;
        cin >> ans;
        D[cinv[ans]][i + j - cinv[ans]] = 1;
    }
    REP(i, M) if (accumulate(ALL(D[i]), 0) == M - 1) cout << "! " << cand[i] << endl;
}
0