# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1042760 | 2024-08-03T10:45:53 Z | Tob | COVID tests (CEOI24_covid) | C++14 | 1417 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 = 1, d_ = 0; double p = P; 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) return res; if (p >= 0.3) { for (int i = 0; i < n; i++) res[i] = iv(i, i); return res; } double cur = 1-p; while (cur >= 0.5) cur *= 1-p, d_++; while (d < d_) d *= 2; if (p < 0.1) d /= 2; else if (p < 0.12) d--; else d = d_; 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, br = 0; while (lo < hi) { int mid = (lo + hi - 1) / 2; if (iv(lo, 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 344 KB | Output is correct |
2 | Correct | 5 ms | 344 KB | Output is correct |
3 | Correct | 5 ms | 344 KB | Output is correct |
4 | Correct | 5 ms | 344 KB | Output is correct |
5 | Correct | 5 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 | 5 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 | 6 ms | 344 KB | Output is correct |
12 | Correct | 6 ms | 344 KB | Output is correct |
13 | Correct | 5 ms | 344 KB | Output is correct |
14 | Correct | 7 ms | 344 KB | Output is correct |
15 | Correct | 5 ms | 344 KB | Output is correct |
16 | Correct | 8 ms | 344 KB | Output is correct |
17 | Correct | 0 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 344 KB | Output is correct (P=0.001, F=15.1, Q=10.9) -> 90.00 points |
2 | Correct | 94 ms | 340 KB | Output is correct (P=0.005256, F=51.1, Q=46.5) -> 90.00 points |
3 | Correct | 211 ms | 344 KB | Output is correct (P=0.011546, F=94.9, Q=94.7) -> 90.00 points |
4 | Correct | 386 ms | 344 KB | Output is correct (P=0.028545, F=191.5, Q=191.0) -> 90.00 points |
5 | Correct | 475 ms | 344 KB | Output is correct (P=0.039856, F=246.3, Q=244.0) -> 90.00 points |
6 | Correct | 707 ms | 344 KB | Output is correct (P=0.068648, F=366.2, Q=365.8) -> 90.00 points |
7 | Correct | 966 ms | 344 KB | Output is correct (P=0.104571, F=490.3, Q=489.2) -> 90.00 points |
8 | Correct | 1272 ms | 344 KB | Output is correct (P=0.158765, F=639.1, Q=633.1) -> 90.00 points |
9 | Correct | 1417 ms | 344 KB | Output is correct (P=0.2, F=731.4, Q=729.4) -> 90.00 points |