結果

問題 No.850 企業コンテスト2位
ユーザー fumiphysfumiphys
提出日時 2019-08-02 01:42:37
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 3,968 bytes
コンパイル時間 1,735 ms
コンパイル使用メモリ 173,340 KB
実行使用メモリ 25,476 KB
平均クエリ数 200.11
最終ジャッジ日時 2024-07-16 17:51:10
合計ジャッジ時間 4,027 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
25,476 KB
testcase_01 AC 22 ms
24,836 KB
testcase_02 AC 21 ms
24,964 KB
testcase_03 AC 21 ms
24,836 KB
testcase_04 AC 20 ms
25,220 KB
testcase_05 AC 21 ms
24,836 KB
testcase_06 AC 20 ms
25,220 KB
testcase_07 AC 25 ms
25,220 KB
testcase_08 AC 26 ms
25,220 KB
testcase_09 AC 26 ms
24,836 KB
testcase_10 AC 31 ms
25,092 KB
testcase_11 AC 31 ms
25,220 KB
testcase_12 AC 31 ms
24,836 KB
testcase_13 AC 30 ms
24,836 KB
testcase_14 AC 30 ms
24,836 KB
testcase_15 AC 30 ms
25,476 KB
testcase_16 AC 29 ms
24,964 KB
testcase_17 AC 31 ms
25,220 KB
testcase_18 AC 29 ms
25,220 KB
testcase_19 AC 30 ms
24,964 KB
testcase_20 AC 31 ms
25,220 KB
testcase_21 AC 32 ms
24,580 KB
testcase_22 AC 32 ms
24,836 KB
testcase_23 AC 32 ms
24,580 KB
testcase_24 AC 31 ms
24,836 KB
testcase_25 AC 30 ms
24,836 KB
testcase_26 AC 30 ms
24,580 KB
testcase_27 AC 21 ms
25,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
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){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n);
  vector<vector<int>> v(11); v[0].resize(n);
  rep(i, n)v[0][i] = i + 1;
  int j = 0;
  while(sz(v[j]) > 1){
    for(int i = 0; i + 1 < sz(v[j]); i += 2){
      cout << "? " << v[j][i] << " " << v[j][i+1] << endl;
      INT(u);
      v[j+1].pb(u);
    }
    if(sz(v[j]) & 1)v[j+1].pb(v[j].back());
    j++;
  }
  vector<int> can;
  int top = v[j][0];
  rep(i, j){
    rep(k, sz(v[i])){
      if(v[i][k] == top){
        if(k % 2 == 0){
          if(k + 1 < sz(v[i]))can.pb(v[i][k+1]);
        }else{
          can.pb(v[i][k-1]);
        }
        break;
      }
    }
  }
  int ans = can[0];
  FOR(i, 1, sz(can)){
    cout << "? " << ans << " " << can[i] << endl;
    cin >> ans;
  }
  cout << "! " << ans << endl;
  return 0;
}
0