# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036034 | sleepntsheep | COVID tests (CEOI24_covid) | C11 | 8 ms | 592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <string.h>
int n, t;
double p;
char ask(char *q) {
char result;
printf("Q %s\n", q);
fflush(stdout);
scanf(" %c", &result);
return result;
}
char a[1001] = { 0 }, q[1001] = { 0 };
int main() {
scanf("%d%lf%d", &n, &p, &t);
if (t == 1) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
q[j] = '0' + (j == i);
a[i] = (ask(q) == 'P') + '0';
}
printf("A %s\n", a);
return 0;
}
int x = n / p;
while (t--) {
for (int i = 0; i < n; ++i)
a[i] = '0';
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
q[j] = '0' + (j == i);
a[i] = (ask(q) == 'P') + '0';
}
printf("A %s\n", a); fflush(stdout);
continue;
printf("A %s\n", a);
int at = 0;
while (at < n) {
char q[1001] = { 0 };
int lb = at - 1, ub = at + x;
if (ub > n)
ub = n;
int nx = ub;
while (ub - lb > 1) {
int md = lb + (ub - lb) / 2;
for (int i = 0; i < n; ++i)
q[i] = '0';
for (int i = at; i <= md; ++i)
q[i] = '1';
if (ask(q) == 'P') ub = md, nx = md + 1;
else lb = md;
}
if (ub < at + x)
a[ub] = '1';
at = nx;
}
printf("A %s\n", a);
fflush(stdout);
char verdict;
scanf(" %c", &verdict);
if ('W' == verdict)
return 0;
}
}
Compilation message (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... |