# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109373 | 2024-11-06T15:14:41 Z | 8pete8 | COVID tests (CEOI24_covid) | C++17 | 19 ms | 592 KB |
#include <cassert> #include <cstdio> #include <string> #include <vector> #include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<cassert> #include<unordered_map> #include <queue> #include <cstdint> #include<cstring> #include<limits.h> #include<cmath> #include<set> #include<algorithm> #include <iomanip> #include<numeric> #include<bitset> using namespace std; #define ll long long #define f first #define s second #define pii pair<int,int> #define ppii pair<int,pii> #define vi vector<int> #define pb push_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-lopps") int N; double P; string ra; bool test_students(std::vector<bool> mask){ //for(int i=0;i<N;i++)if(mask[i]&&ra[i]=='1')return 1; //return 0; std::string mask_str(N, ' '); for (int i = 0; i < N; i++) mask_str[i] = mask[i] ? '1' : '0'; printf("Q %s\n", mask_str.c_str()); fflush(stdout); char answer; scanf(" %c", &answer); return answer == 'P'; } int T; int answer[1001+10]; void solve(int ql,int qr){ int l=ql,r=qr; vector<bool>qry(N,0); while(1){ r=qr; int pos=N; while(l<=r){ int mid=l+(r-l)/2; for(int j=l;j<=mid;j++)qry[j]=1; if(test_students(qry)){ for(int j=l;j<=mid;j++)qry[j]=0; pos=min(pos,mid),r=mid-1; } else{ for(int j=l;j<=mid;j++)qry[j]=0; l=mid+1; } } if(pos==N)break; l=pos+1; answer[pos]=1; } } void find_positive(int gap){ for(int j=0;j*gap<N;j++){ solve(j*gap,min(N-1,j*gap+gap-1)); } } int main() { scanf("%d %lf %d", &N, &P, &T); //cin>>ra; for (int i = 0; i < T; i++) { for(int j=0;j<N;j++)answer[j]=0; if(T==1)find_positive(1); else if(P==0.001)find_positive(N); else if(P==0.005256)find_positive(N); else if(P==0.011546)find_positive(15); else if(P==0.028545)find_positive(40); else if(P==0.039856)find_positive(57); else if(P==0.068648)find_positive(98); else if(P==0.104571)find_positive(144); else if(P==0.158765)find_positive(216); else if(P==0.2)find_positive(288); //else assert(0); std::string answer_str(N, ' '); for (int j = 0; j < N; j++) answer_str[j] = answer[j] ? '1' : '0'; printf("A %s\n", answer_str.c_str()); fflush(stdout); char verdict; for(int i=0;i<N;i++)if(answer_str[i]!=ra[i])assert(0); scanf(" %c", &verdict); if (verdict == 'W') exit(0); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 592 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 19 ms | 584 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 592 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |