Submission #1090445

#TimeUsernameProblemLanguageResultExecution timeMemory
1090445lucriCOVID tests (CEOI24_covid)C++17
49.68 / 100
2339 ms600 KiB
#include <bits/stdc++.h> /// You may use: // The number of students int N,T; // The probability any given student is positive double P; // This function performs a test on a subset of samples. // Its argument is a vector of Booleans of length N, // where the i-th element is true if the i-th sample should be added to the mix. // It returns true if (and only if) at least one of the samples in the mix is positive. bool test_students(std::vector<bool> mask) { assert(mask.size() == (size_t)N); 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'; } /// You should implement: // This function will be called once for each test instance. // It should use test_students to determine which samples are positive. // It must return a vector of Booleans of length N, // where the i-th element is true if and only if the i-th sample is positive. std::vector<bool> answer; std::vector<bool> test; std::vector<int> ind; int p[5010]; int determina(int b,int e,int tip,int ce) { if(b>ce) return -1; if(tip==-1) { for(int i=b;i<=e;++i) test[p[i]]=true; bool r=test_students(test); for(int i=b;i<=e;++i) test[p[i]]=false; if(r==false) return 1; } if(b==e) { answer[p[b]]=true; return -1; } int val=determina(b,(b+e)/2,-1,ce); determina((b+e)/2+1,e,val,ce); return -1; } void calculeaza(int b,int e,int sz) { if(b>e) return; int ce=e; e=b+2*sz-1; while(e>p[0]) { ++p[0]; p[p[0]]=p[p[0]]=ce; } determina(b,e,1,ce); calculeaza(e+1,ce,sz); return; } void raspunde(int sz) { p[0]=0; for(int i=0;i<N;i+=sz) { for(int j=i;j<i+sz&&j<N;++j) test[j]=1; if(test_students(test)==true) { for(int j=i;j<i+sz&&j<N;++j) p[++p[0]]=j; } for(int j=i;j<i+sz&&j<N;++j) test[j]=0; } calculeaza(1,p[0],sz); } std::vector<bool> find_positive() { for(int i=0;i<N;++i) { answer[i]=test[i]=0; ind[i]=i; } random_shuffle(ind.begin(),ind.end()); if(T==1)//subtask 1 { raspunde(1); } else if(P>0.17)//P=0.2 { raspunde(5); } else if(P>0.11)//P=0.158765 { raspunde(6); } else if(P>0.1)//P=0.104571 { raspunde(6); } else if(P>0.06)//P=0.068648 { raspunde(10); } else if(P>0.03)//P=0.039856 { raspunde(17); } else if(P>0.02)//P=0.028545 { raspunde(24); } else if(P>0.01)//P=0.011546 { raspunde(58); } else if(P>0.005)///P=0.005256 { raspunde(200); } else///P=0.001 { raspunde(500); } return answer; } int main() { scanf("%d %lf %d", &N, &P, &T); // You may perform any extra initialization here. srand(time(0)); answer.resize(N); ind.resize(N); test.resize(N); for (int i = 0; i < T; i++) { std::vector<bool> answer = find_positive(); assert(answer.size() == (size_t)N); 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; scanf(" %c", &verdict); if (verdict == 'W') exit(0); } return 0; }

Compilation message (stderr)

Main.cpp: In function 'void calculeaza(int, int, int)':
Main.cpp:71:16: warning: operation on 'p[p[0]]' may be undefined [-Wsequence-point]
   71 |         p[p[0]]=p[p[0]]=ce;
      |         ~~~~~~~^~~~~~~~~~~
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:146:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:165:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...