結果
問題 | No.1793 実数当てゲーム |
ユーザー | HIR180 |
提出日時 | 2021-12-22 21:21:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 141 ms / 2,000 ms |
コード長 | 4,421 bytes |
コンパイル時間 | 2,525 ms |
コンパイル使用メモリ | 182,912 KB |
実行使用メモリ | 25,476 KB |
平均クエリ数 | 2230.56 |
最終ジャッジ日時 | 2024-09-28 13:37:17 |
合計ジャッジ時間 | 6,608 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
24,580 KB |
testcase_01 | AC | 27 ms
25,220 KB |
testcase_02 | AC | 125 ms
25,220 KB |
testcase_03 | AC | 121 ms
24,580 KB |
testcase_04 | AC | 124 ms
24,836 KB |
testcase_05 | AC | 111 ms
25,220 KB |
testcase_06 | AC | 108 ms
24,836 KB |
testcase_07 | AC | 117 ms
24,836 KB |
testcase_08 | AC | 119 ms
24,580 KB |
testcase_09 | AC | 118 ms
24,580 KB |
testcase_10 | AC | 118 ms
24,964 KB |
testcase_11 | AC | 118 ms
24,836 KB |
testcase_12 | AC | 123 ms
25,220 KB |
testcase_13 | AC | 134 ms
25,220 KB |
testcase_14 | AC | 141 ms
25,448 KB |
testcase_15 | AC | 120 ms
25,220 KB |
testcase_16 | AC | 132 ms
25,476 KB |
testcase_17 | AC | 121 ms
25,220 KB |
ソースコード
//Let's join Kaede Takagaki Fan Club !! #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <ctime> #include <cassert> #include <string> #include <algorithm> #include <vector> #include <queue> #include <stack> #include <functional> #include <iostream> #include <map> #include <set> #include <unordered_map> #include <unordered_set> #include <cassert> #include <iomanip> #include <chrono> #include <random> #include <bitset> #include <complex> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; #define int long long //#define L __int128 typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define eb emplace_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define a first #define b second #define fi first #define sc second #define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) #define all(x) x.begin(),x.end() #define si(x) int(x.size()) #ifdef LOCAL #define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl #else #define dmp(x) void(0) #endif template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;} template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;} template<class t> using vc=vector<t>; template<class t,class u> ostream& operator<<(ostream& os,const pair<t,u>& p){ return os<<"{"<<p.fi<<","<<p.sc<<"}"; } template<class t> ostream& operator<<(ostream& os,const vc<t>& v){ os<<"{"; for(auto e:v)os<<e<<","; return os<<"}"; } //https://codeforces.com/blog/entry/62393 struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } size_t operator()(pair<int,int> x)const{ return operator()(uint64_t(x.first)<<32|x.second); } }; //unordered_set -> dtype, null_type //unordered_map -> dtype(key), dtype(value) using namespace __gnu_pbds; template<class t,class u> using hash_table=gp_hash_table<t,u,custom_hash>; template<class T> void g(T &a){ cin >> a; } template<class T> void o(const T &a,bool space=false){ cout << a << (space?' ':'\n'); } //ios::sync_with_stdio(false); const ll mod = 1000000007; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); template<class T> void add(T&a,T b){ a+=b; if(a >= mod) a-=mod; } ll modpow(ll x,ll n){ ll res=1; while(n>0){ if(n&1) res=res*x%mod; x=x*x%mod; n>>=1; } return res; } #define _sz 390005 ll F[_sz],R[_sz]; void make(){ F[0] = 1; for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod; R[_sz-1] = modpow(F[_sz-1], mod-2); for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod; } ll C(int a,int b){ if(b < 0 || a < b) return 0; return F[a]*R[b]%mod*R[a-b]%mod; } #define ld long double bool ask(ld v){ cout << "? " << v << endl; string s; cin >> s; return s == "Yes"; } void ans(ld v){ cout << "! " << v << endl; //cerr << min(abs(god-v), (god>=0.9?abs(god-v)/god:1e18)) << endl; } void sqr(ld lb, ld ub, int rc){ rep(i, rc){ auto mid = (lb + ub) / 2; auto f = ask(pow(10.0L, mid)); if(f) lb = mid; else ub = mid; } ans(pow(10.0L, (lb + ub) / 2.0L)); } void solve(){ ld lb = 0.0L; ld ub = 74.0L + log10(12.22L); ld uni = ub / 255.0L; for(int i=7;i>=0;i--){ int go = (1<<i)-1; ld check = uni * (ld)(go); auto f = ask(pow(10.0L, check)); if(f){ sqr(check, ub, i+16); return; } else{ ub = check; } } lb = 0.0, ub = 1.0; for(int i=0;i<16;i++){ auto mid = (lb + ub) / 2; auto f = ask(mid); if(f) lb = mid; else ub = mid; } ans((lb+ub) / 2.0L); } signed main(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(100); int t; cin >> t; while(t--) solve(); return 0; }