Submission #1071987

#TimeUsernameProblemLanguageResultExecution timeMemory
1071987_8_8_COVID tests (CEOI24_covid)C++17
100 / 100
1722 ms344 KiB
#include <cassert> #include <cstdio> #include <string> #include <vector> #include <bits/stdc++.h> using namespace std;; /// You may use: string s; // The number of students int N; // 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 loc = 0; bool test_students(std::vector<bool> mask) { if(loc) { bool ans = false; for(int i = 0; i < N; i++) { if(mask[i] && s[i] == '1') { ans = 1; } } return ans; } 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: mt19937 rng(123321); // 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 as(int l,int r) { vector<bool> ask(N,0); for(int i = l;i <= min(N - 1,r);i++) { ask[i] = 1; } return test_students(ask); } std::vector<bool> find_positive() { vector<bool> answer(N),ask(N,0); function<void(int,int)>go1 = [&](int l,int r) { if(l == r) { answer[l] = 1; return; } int mid = (l + r) >> 1; if(as(l,mid)) { go1(l,mid); } if(as(mid+1,r)) go1(mid+1,r); }; function<int(int,int)>go = [&](int l,int r) { if(l == r) { answer[l] = 1; return l; } int mid = (l+ l + r) / 3; if(as(l,mid)) { return go(l,mid); } return go(mid+1,r); }; auto solve = [&](int b) { int i = 0; while(i < N) { int r = min(N - 1,i + b); if(as(i,r)) { go1(i,r); } i = r + 1; } }; if(P == 0) { return answer; } if(P > 0.2){ solve(70); return answer; } int b; if(P != 0.068648) { b = (int)(0.60 / P); } else { b = (int)(0.63 / P); } int i = 0; while(i < N) { int r = min(i + b,N - 1); if(as(i,r)) { i = go(i,r)+1; } else { i = r + 1; } } return answer; } int main() { int T; scanf("%d %lf %d", &N, &P, &T); if(loc) cin >> s; // You may perform any extra initialization here. 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:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:117:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:133:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...