# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076737 | 2024-08-26T16:03:51 Z | abouton | COVID tests (CEOI24_covid) | C++17 | 0 ms | 0 KB |
#include <cassert> #include <cstdio> #include <string> #include <vector> using namespace std; /// You may use: // The number of students int N; // The probability any given student is positive double P; int K = 2; vector<bool> answer(1000); void tester(int a, int b) { if (b == a) return; if (b==a+1) { vector<bool> quest(N); quest[a] = true; answer[a] = test_students(quest); } int t = (b-a)/K; int r = (b-a)%K; int nbit = 0, cur = a; while (cur < b) { int deb = cur; cur += t; cur += (nbit<r); nbit++; vector<bool> quest(N); for (int i = deb; i < cur; i ++) quest[i] = true; if (test_students(quest)) { tester(deb, cur); } } } // 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); 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. vector<bool> find_positive() { answer.clear(); answer.resize(1000); tester(0,N); return answer; } int main() { int T; scanf("%d %lf %d", &N, &P, &T); // 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; }