Submission #1075029

#TimeUsernameProblemLanguageResultExecution timeMemory
1075029pawnedCOVID tests (CEOI24_covid)C++17
0 / 100
1161 ms596 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; const char nl = '\n'; void fastIO() { ios::sync_with_stdio(false); cin.tie(0); } int N, T; double P; char query(vi v) { string s(N, '0'); for (int x : v) s[x] = '1'; cout<<"Q "<<s<<endl; cout.flush(); char c; cin>>c; return c; } char query(int l, int r) { string s(N, '0'); for (int i = l; i <= r; i++) { s[i] = '1'; } cout<<"Q "<<s<<endl; cout.flush(); char c; cin>>c; return c; } int main() { fastIO(); cin>>N>>P>>T; int len = min((int)(1.0 / P) + 1, N); for (int i = 0; i < T; i++) { string ans(N, '0'); for (int j = 0; j < N; j += len) { int lp = j; int rp = min(j + len - 1, N - 1); if (query(lp, rp) == 'N') continue; if (lp == rp) { ans[lp] = '1'; continue; } for (int k = lp; k <= rp; k++) { vi v; v.pb(k); char c = query(v); if (c == 'P') ans[k] = '1'; } } // cout<<"ANSWER: "; cout<<"A "<<ans<<endl; cout.flush(); char c; cin>>c; if (c == 'W') break; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...