結果
問題 | No.253 ロウソクの長さ |
ユーザー |
|
提出日時 | 2021-03-15 15:44:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 2,009 bytes |
コンパイル時間 | 2,481 ms |
コンパイル使用メモリ | 129,128 KB |
最終ジャッジ日時 | 2025-01-19 17:15:27 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <cmath>#include <queue>#include <string>#include <map>#include <set>#include <stack>#include <tuple>#include <deque>#include <array>#include <numeric>#include <bitset>#include <iomanip>#include <cassert>#include <chrono>#include <random>#include <limits>#include <iterator>#include <functional>#include <sstream>#include <fstream>#include <complex>#include <cstring>#include <unordered_map>#include <unordered_set>using namespace std;using ll = long long;constexpr int INF = 1001001001;constexpr int mod = 1000000007;// constexpr int mod = 998244353;template<class T>inline bool chmax(T& x, T y){if(x < y){x = y;return true;}return false;}template<class T>inline bool chmin(T& x, T y){if(x > y){x = y;return true;}return false;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);// int ans;// cin >> ans;int lb = 10, ub = 100, t = 0, x;while(ub - lb > 1){int mid = (lb + ub) / 2;cout << "? " << mid << endl;// cout << "ans:" << ans-- << endl;cin >> x;if(x == 0){cout << "! " << mid + t << endl;return 0;}if(x == 1) lb = mid;else ub = mid;--lb; --ub; ++t;// cout << "lb:" << lb << ",ub:" << ub << endl;}if(ub + t < 100){cout << "! " << lb + t << endl;return 0;}lb = 100 - t, ub = 1000000001 - t;while(ub - lb > 1){int mid = (lb + ub) / 2;cout << "? " << mid << endl;// cout << "ans:" << ans-- << endl;cin >> x;if(x == 0){cout << "! " << mid + t << endl;return 0;}if(x == 1) lb = mid;else ub = mid;--lb; --ub; ++t;// cout << "lb:" << lb << ",ub:" << ub << endl;}cout << "! " << lb + t << endl;return 0;}