# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044461 | 2024-08-05T09:57:17 Z | VahanAbraham | COVID tests (CEOI24_covid) | C++17 | 12 ms | 444 KB |
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <string> #include <algorithm> #include <cstring> #include <cstdio> #include <sstream> #include <map> #include <stack> #include <set> #include <queue> #include <list> #include <unordered_set> #include <unordered_map> #include <math.h> #include <bitset> #include <cmath> #include <vector> #include <iomanip> #include <random> #include <chrono> #include <cassert> #include <cassert> #include <cstdio> #include <string> #include <vector> /// You may use: using namespace std; // The number of students int N; #define ll long long #define fr first #define sc second #define pb push_back // 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'; } int ans[10000]; void rec(int l, int r) { vector<bool> v; v.resize(N); for (int i = 0; i < N; ++i) { if (i >= l && i <= r) { v[i] = 1; } else { v[i] = 0; } } if (l == r) { if (test_students(v) != 0) { for (int i = l; i <= r; ++i) { ans[i] = -1; } return; } return; } if (test_students(v) != 0) { for (int i = l; i <= r; ++i) { ans[i] = 0; } return; } else { int mid = (l + r) / 2; rec(l, mid); rec(mid + 1, r); } } /// 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> find_positive() { std::vector<bool> answer(N); vector<bool> v; v.resize(N); int l = 0, r = N - 1; rec(0, N - 1); for (int i = 0; i < N; ++i) { if (ans[i] == -1) { answer[i] = 0; } else { answer[i] = 1; } } for (int i = 0; i < N; ++i) { ans[i] = 0; } 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; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | translate:wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | translate:wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 444 KB | translate:wrong |
2 | Halted | 0 ms | 0 KB | - |