結果
問題 |
No.253 ロウソクの長さ
|
ユーザー |
![]() |
提出日時 | 2018-09-26 04:01:59 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 2,253 bytes |
コンパイル時間 | 1,769 ms |
コンパイル使用メモリ | 167,560 KB |
実行使用メモリ | 25,476 KB |
平均クエリ数 | 28.44 |
最終ジャッジ日時 | 2024-07-17 01:56:05 |
合計ジャッジ時間 | 4,053 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/253> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); ll l = 10, r = 1000000000+1; ll add = 0; { cout << "? " << 50 << endl; ll rep; cin >> rep; add++; if(rep == 0){ cout << "! 50" << endl; return 0; } if(rep == -1){ while(true){ cout << "? 0" << endl; ll rep; cin >> rep; if(rep == 0){ cout << "! " << add << endl; return 0; } add++; } } } while(r-l>1){ ll m = (l+r)/2; cout << "? " << m << endl; ll rep; cin >> rep; if(rep == 0){ cout << "! " << m+add << endl; return 0; } if(rep >= 0){ l = m; }else{ r = m; } if(l!=0)l--; if(r!=0)r--; add++; } cout << "! " << l+add << endl; return 0; }