Submission #1076754

#TimeUsernameProblemLanguageResultExecution timeMemory
1076754antonCOVID tests (CEOI24_covid)C++17
31.39 / 100
7064 ms344 KiB
#include<bits/stdc++.h> using namespace std; /// You may use: // The number of students int N; // The probability any given student is positive double P; int group_sz =1; // 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. bool test_single(int u){ vector<bool> mask(N, false); mask[u] = true; return test_students(mask); } bool test_inter(int l, int r){ vector<bool> mask(N, false); for(int i = l; i<=r; i++){ mask[i] = true; } return test_students(mask); } void find_positive(int l, int r, vector<bool>& res){ if(l==r){ res[l] = true; return; } int mid = (l+r)/2; if(test_inter(l, mid)){ find_positive(l, mid, res); } if(test_inter(mid+1, r)){ find_positive(mid+1, r, res); } } std::vector<bool> find_positive() { std::vector<bool> answer(N); int K = (N+group_sz-1)/group_sz; for(int nb_g= 0; nb_g<K; nb_g++){ int l = nb_g * group_sz; int r= (nb_g+1)*group_sz-1; if(test_inter(l, min(r, N-1))){ find_positive(l, min(r, N-1), answer); } } /*for(int i = 0; i<N; i+=group_sz){ vector<bool>cur_mask (N, false); vector<int> order; for(int j = i; j<min(i+group_sz, N); j++){ cur_mask[j] = true; } if(test_students(cur_mask)){ bool found = false; for(int j = i; j<min(i+group_sz, N); j++){ answer[j] = test_single(j); cur_mask[j] = false; if(answer[j] && j<min(i+group_sz, N)-1){ if(!test_students(cur_mask)){ break; } } } } }*/ return answer; } int get_sz(double p, double target){ int res = 1; double cur_p = p; while(cur_p>0.5){ res ++; cur_p*=p; } return res; } int main() { int T; scanf("%d %lf %d", &N, &P, &T); // You may perform any extra initialization here. group_sz= min(max(get_sz((1.-P), 0.5), 1), N/2); 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 'bool test_students(std::vector<bool>)':
Main.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:115:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...