제출 #1137538

#제출 시각아이디문제언어결과실행 시간메모리
1137538ghammazhassanCOVID tests (CEOI24_covid)C++20
14.78 / 100
672 ms408 KiB
// #include <bits/stdc++.h> #include <iostream> #include <cmath> #include <algorithm> #include <map> #include <vector> #include <iomanip> #include <string> #include <queue> #include <set> using namespace std; #define int long long #define endl "\n"; const int N=2e5+5; const int M=1e9+7; int n; double p; void solve() { string s,w; for (int i=0;i<n;i++){ s+='0'; w+='1'; } int co=max((1/p)/3,(double)1); int l=0,r=(1/p)/3; while (l<n){ for (int i=l;i<=r;i++){ s[i]='1'; } cout << "Q "+s << endl; char k; cin >> k; for (int i=l;i<=r;i++){ s[i]='0'; } if (k=='N'){ for (int i=l;i<=r;i++){ w[i]='0'; } l=r+1; r=min(l+co,n-1); } else{ if (l!=r){ r=(l+r)/2; } else{ l=r+1; r=min(l+co,n-1); } } } cout << "A " << w << endl; char e; cin >> e; if (e=='C'){ return; } else{ exit(0); } } signed main() { cout << fixed<<setprecision(9); int t=1; cin >> n >> p >> t; for (int _=1;_<=t;_++){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...