제출 #1198790

#제출 시각아이디문제언어결과실행 시간메모리
1198790BigBadBullyCOVID tests (CEOI24_covid)C++17
10 / 100
2089 ms432 KiB
// Online C++ compiler to run C++ program online #include <bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second int n,t; bool guess(int l,int r){ cout << "Q "; for (int i = 0; i < n; i++) { if (i >= l && i <= r) cout << '1'; else cout << '0'; } cout << endl; char la; cin >> la; if (la == 'P') return 1; return 0; } int calc( int l, int r) { if (l==r) return l; int mid = l+r>>1; if (guess(l,mid)) return calc(l,mid); return calc(mid+1,r); } void linear(vector<bool>&mask,int mile) { int prev = 0; while(prev<n) { if (guess(prev,min(n-1,prev+mile))) for (int i = prev;i <= min(n-1,prev+mile); i++) if (guess(i,i)) mask[i] = 1; prev = min(n,prev+mile+1); } } signed main() { double p; ios::sync_with_stdio(0); cin >> n >> p >> t; double tte = 1-p; int cnt = 1; if (tte <= 0.5) { while(tte>0.5) tte*=1-p,cnt++; if (abs(tte-0.5) > abs(tte/(1-p) - 0.5)) cnt--; } while(t--) { vector<bool> mask(n,0); int prev = -1; while(prev < n-1) if (guess(prev+1,min(n-1,prev+1+cnt))) mask[prev = calc(prev+1,min(n-1,prev+1+cnt))] = 1; else prev = prev+1+cnt; cout << "A "; for (int i = 0; i < n; i++) cout << (char)(mask[i]+'0'); cout << endl; char c; cin >> c; if(c=='C') continue; else break; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...