# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042615 | 2024-08-03T08:31:59 Z | Tob | COVID tests (CEOI24_covid) | C++14 | 7000 ms | 344 KB |
#include <bits/stdc++.h> #define F first #define S second #define all(x) x.begin(), x.end() #define pb push_back #define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) using namespace std; typedef long long ll; typedef pair <ll, ll> pii; int N; double P; bool test_students(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'; } vector<bool> find_positive() { int n = N, d = 0; double p = P; double cur = 1-p; while (cur >= 0.5) cur *= 1-p, d++; auto iv = [&](int l, int r) { vector <bool> v(N, 0); for (int i = l; i <= r; i++) v[i] = 1; return test_students(v); }; vector <bool> res(n, 0); if (p > 0.2) { for (int i = 0; i < n; i++) res[i] = iv(i, i); return res; } for (int i = 0; i < n; i += d) { int r = min(n, i+d)-1; while (i <= r && iv(i, r)) { int lo = i, hi = r; while (lo < hi) { int mid = (lo + hi) / 2; if (iv(i, mid)) hi = mid; else lo = mid+1; } res[lo] = 1; r = min(n-1, lo+d); i = lo+1; } } return res; } int main() { int T; scanf("%d %lf %d", &N, &P, &T); 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 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 344 KB | Output is correct |
2 | Correct | 5 ms | 344 KB | Output is correct |
3 | Correct | 6 ms | 344 KB | Output is correct |
4 | Correct | 5 ms | 344 KB | Output is correct |
5 | Correct | 6 ms | 344 KB | Output is correct |
6 | Correct | 6 ms | 344 KB | Output is correct |
7 | Correct | 5 ms | 344 KB | Output is correct |
8 | Correct | 6 ms | 344 KB | Output is correct |
9 | Correct | 5 ms | 344 KB | Output is correct |
10 | Correct | 3 ms | 344 KB | Output is correct |
11 | Correct | 5 ms | 344 KB | Output is correct |
12 | Correct | 6 ms | 344 KB | Output is correct |
13 | Correct | 7 ms | 344 KB | Output is correct |
14 | Correct | 6 ms | 344 KB | Output is correct |
15 | Correct | 5 ms | 344 KB | Output is correct |
16 | Correct | 5 ms | 344 KB | Output is correct |
17 | Execution timed out | 7075 ms | 344 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 344 KB | Output is correct (P=0.001, F=15.1, Q=11.0) -> 90.00 points |
2 | Correct | 93 ms | 344 KB | Output is correct (P=0.005256, F=51.1, Q=46.6) -> 90.00 points |
3 | Correct | 185 ms | 344 KB | Output is correct (P=0.011546, F=94.9, Q=91.1) -> 90.00 points |
4 | Correct | 369 ms | 344 KB | Output is correct (P=0.028545, F=191.5, Q=190.8) -> 90.00 points |
5 | Correct | 512 ms | 344 KB | Output is correct (P=0.039856, F=246.3, Q=246.8) -> 89.28 points |
6 | Correct | 754 ms | 344 KB | Output is correct (P=0.068648, F=366.2, Q=372.2) -> 84.46 points |
7 | Correct | 1016 ms | 344 KB | Output is correct (P=0.104571, F=490.3, Q=499.5) -> 83.72 points |
8 | Correct | 1332 ms | 344 KB | Output is correct (P=0.158765, F=639.1, Q=633.1) -> 90.00 points |
9 | Correct | 1575 ms | 344 KB | Output is correct (P=0.2, F=731.4, Q=760.7) -> 77.57 points |