結果

問題 No.253 ロウソクの長さ
ユーザー fumiphysfumiphys
提出日時 2019-10-13 22:55:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 3,653 bytes
コンパイル時間 1,422 ms
コンパイル使用メモリ 166,592 KB
実行使用メモリ 24,384 KB
平均クエリ数 30.67
最終ジャッジ日時 2023-09-24 02:20:51
合計ジャッジ時間 4,538 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
24,000 KB
testcase_01 AC 24 ms
23,628 KB
testcase_02 AC 27 ms
23,364 KB
testcase_03 AC 26 ms
24,036 KB
testcase_04 AC 25 ms
23,220 KB
testcase_05 AC 26 ms
24,000 KB
testcase_06 AC 25 ms
23,376 KB
testcase_07 AC 26 ms
23,808 KB
testcase_08 AC 26 ms
24,324 KB
testcase_09 AC 24 ms
23,628 KB
testcase_10 AC 26 ms
23,820 KB
testcase_11 AC 26 ms
23,820 KB
testcase_12 AC 25 ms
24,336 KB
testcase_13 AC 26 ms
24,324 KB
testcase_14 AC 25 ms
23,364 KB
testcase_15 AC 27 ms
23,364 KB
testcase_16 AC 25 ms
24,384 KB
testcase_17 AC 24 ms
23,364 KB
testcase_18 AC 25 ms
23,640 KB
testcase_19 AC 24 ms
24,252 KB
testcase_20 AC 24 ms
23,808 KB
testcase_21 AC 25 ms
24,036 KB
testcase_22 AC 25 ms
24,048 KB
testcase_23 AC 25 ms
23,352 KB
testcase_24 AC 27 ms
24,300 KB
testcase_25 AC 26 ms
23,400 KB
testcase_26 AC 25 ms
24,300 KB
testcase_27 AC 25 ms
23,628 KB
testcase_28 AC 25 ms
23,784 KB
testcase_29 AC 25 ms
23,376 KB
testcase_30 AC 25 ms
24,348 KB
testcase_31 AC 25 ms
24,216 KB
testcase_32 AC 25 ms
23,520 KB
testcase_33 AC 25 ms
24,240 KB
testcase_34 AC 24 ms
23,796 KB
testcase_35 AC 26 ms
24,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#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 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 bit(n) (1LL<<(n))
// functions
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>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  cout << "? 100" << endl;
  int u; cin >> u;
  if(u == 0){
    cout << "! 100" << endl;
    return 0;
  }else if(u == -1){
    int t = 1;
    for(int i = 10; i < 99; i++){
      cout << "? " << max(0, i - t) << endl;
      int c; cin >> c;
      if(c == 0){
        cout << "! " << i << endl;
        return 0;
      }
      t++;
    }
  }else{
    ll ld = 10, rd = (ll)inf + 1;
    int t = 1;
    while(rd - ld > 1){
      ll md = (ld + rd) / 2;
      cout << "? " << max(md - t, 0LL) << endl;
      int c; cin >> c;
      if(c == 0){
        cout << "! " << md << endl;
        return 0;
      }else if(c == -1){
        rd = md;
      }else{
        ld = md;
      }
      t++;
    }
    cout << "! " << ld << endl;
  }
  return 0;
}
0