結果
問題 | No.253 ロウソクの長さ |
ユーザー | kei |
提出日時 | 2018-09-26 03:56:11 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,757 bytes |
コンパイル時間 | 1,467 ms |
コンパイル使用メモリ | 164,232 KB |
実行使用メモリ | 24,432 KB |
平均クエリ数 | 29.83 |
最終ジャッジ日時 | 2023-09-23 16:22:26 |
合計ジャッジ時間 | 7,160 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
23,352 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 25 ms
23,352 KB |
testcase_07 | AC | 25 ms
23,340 KB |
testcase_08 | AC | 24 ms
23,856 KB |
testcase_09 | WA | - |
testcase_10 | AC | 24 ms
23,412 KB |
testcase_11 | AC | 23 ms
23,952 KB |
testcase_12 | AC | 23 ms
24,036 KB |
testcase_13 | AC | 25 ms
23,364 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 23 ms
23,832 KB |
testcase_19 | WA | - |
testcase_20 | AC | 26 ms
23,304 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 25 ms
24,204 KB |
testcase_24 | WA | - |
testcase_25 | AC | 25 ms
23,316 KB |
testcase_26 | AC | 24 ms
23,772 KB |
testcase_27 | AC | 24 ms
23,388 KB |
testcase_28 | AC | 25 ms
23,976 KB |
testcase_29 | AC | 24 ms
23,424 KB |
testcase_30 | AC | 24 ms
24,336 KB |
testcase_31 | AC | 25 ms
23,640 KB |
testcase_32 | AC | 24 ms
24,276 KB |
testcase_33 | AC | 23 ms
23,472 KB |
testcase_34 | AC | 25 ms
23,592 KB |
testcase_35 | AC | 24 ms
23,328 KB |
ソースコード
#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; while(r-l>1){ ll m = (l+r)/2; cout << "? " << m << endl; ll rep; cin >> rep; if(rep == 0){ cout << "! " << m+add << "\n"; return 0; } if(rep >= 0){ l = m; }else{ r = m; } if(l!=0){ l--; add++;} if(r!=0) r--; } cout << "! " << l+add << "\n"; return 0; }