# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1212012 | yanb | COVID tests (CEOI24_covid) | C++20 | 1025 ms | 408 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N, Block;
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';
}
bool query(int l, int r) {
vector<bool> mask(N);
for (int i = l; i <= r; i++) mask[i] = 1;
return test_students(mask);
}
void dnc(vector<bool> &ans, int l, int r) {
if (l == r) {
ans[l] = 1;
} else {
int md = (l + r) / 2;
if (query(l, md)) {
dnc(ans, l, md);
if (query(md + 1, r)) dnc(ans, md + 1, r);
} else {
dnc(ans, md + 1, r);
}
}
}
/*double E(int x) {
double ans = 0;
for (int k = 0; k <= x; k++) {
int prob = pow(P, k) * pow(1.0 - P, x - k);
ans += prob * pow();
}
}
int get_block() {
int ans = 1;
for (int i = 1; i < N; i++) {
if (E(i) < E(ans)) {
ans = i;
}
}
return ans;
}*/
vector<bool> find_positive() {
vector<bool> answer(N);
for (int l = 0; l < N; l += Block) {
if (query(l, min(l + Block, N) - 1)) dnc(answer, l, min(l + Block, N) - 1);
}
return answer;
}
signed main() {
int T;
scanf("%d %lf %d", &N, &P, &T);
Block = 40.0 / P;//get_block();
for (int i = 0; i < T; i++) {
vector<bool> answer = find_positive();
assert(answer.size() == (size_t)N);
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;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |