結果
問題 |
No.3212 SUPER Guess the Number
|
ユーザー |
![]() |
提出日時 | 2025-07-25 22:57:59 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 3,818 bytes |
コンパイル時間 | 4,213 ms |
コンパイル使用メモリ | 258,340 KB |
実行使用メモリ | 25,972 KB |
平均クエリ数 | 21.83 |
最終ジャッジ日時 | 2025-07-25 22:58:05 |
合計ジャッジ時間 | 5,533 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 12 |
ソースコード
#define ATCODER #include <bit> #include <cstdint> #include <iostream> #include <algorithm> #include <vector> #include <string> #include <queue> #include <cassert> #include <unordered_map> #include <unordered_set> #include <math.h> #include <climits> #include <set> #include <map> #include <list> #include <iterator> #include <bitset> #include <chrono> #include <type_traits> using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector<ll> #define VVL vector<vector<ll>> #define VP vector< pair<ll,ll> > #define VVP vector<vector<pair<ll,ll>>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include <atcoder/all> using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template<typename T = ll> vector<T> read(size_t n) { vector<T> ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template<typename TV, const ll N> void read_tuple_impl(TV&) {} template<typename TV, const ll N, typename Head, typename... Tail> void read_tuple_impl(TV& ts) { get<N>(ts).emplace_back(*(istream_iterator<Head>(cin))); read_tuple_impl<TV, N + 1, Tail...>(ts); } template<typename... Ts> decltype(auto) read_tuple(size_t n) { tuple<vector<Ts>...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts); return ts; } template<typename T> T det2(array<T, 4> ar) { return ar[0] * ar[3] - ar[1] * ar[2]; } template<typename T> T det3(array<T, 9> ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; } template<typename T> bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; } template<typename T> bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; } template<typename T> void inc(vector<T>& ar) { for (auto& v : ar) v++; } template<typename T> void dec(vector<T>& ar) { for (auto& v : ar) v--; } template<typename T> vector<pair<T, int>> id_sort(vector<T>& a) { vector<T, int> res(a.size()); for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i); SORT(res); return res; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return 0; } val op2(val a, val b) { return min(a, b); } val e2() { return 1e18; } //val mp(func f, val a) { return MP(a.first + f * a.second, a.second); } //func comp(func f, func g) { return f + g; } //func id() { return 0; } // Rook ll dxr[4] = { 1,0,-1,0 }; ll dyr[4] = { 0,1,0,-1 }; // Bishop ll dxb[4] = { -1,-1,1,1 }; ll djb[4] = { -1,1,-1,1 }; // qween ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dyq[8] = { -1,-1,0,1,1,1,0,-1 }; // NekoTanuki // Ponnyaaaaaaaaaaaaaaaaaaaaaaaaaa void solve() { ll l = 0, r = 1000000LL; ll rev = 900000000; //ll l = 0, r = 10; //ll rev = 100; cout << "? " << rev << endl;; //ll ans; //cin >> ans; ll cc = 1; while (l + 1 < r) { cc++; ll m = (l + r) / 2; ll v = m * 2 - rev; ll res; if (rev > v) { v++; cout << "? " << v << endl; cin >> res; // res = bool((abs(v - ans) <= abs(rev - ans))); if (res) { r = m; } else { l = m; } } else { v++; cout << "? " << v << endl; cin >> res; // res = bool((abs(v - ans) <= abs(rev - ans))); if (res) { l = m; } else { r = m; } } rev = v; } cerr << cc << "\n"; cout << "! " << r << endl; } int main() { ll t = 1; // cin >> t; while (t--) { solve(); } return 0; }