#include <stdio.h>
#include <math.h>
#include <stdlib.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 = -1;
double P_[] = { 0.001, 0.005256, 0.011546, 0.028545, 0.039856, 0.068648, 0.104571, 0.158765, 0.2 };
int X_[] = { 1000, 999, 999, 254, 246, 126, 62, 31, 30 };
for (int i = 0; i < 9; ++i) {
if (fabs(P_[i] - p) < 0.001)
x = X_[i];
}
if (x == -1)
x = 999;
while (t--) {
for (int i = 0; i < n; ++i)
a[i] = '0';
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
Main.c: In function 'ask':
Main.c:13:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | scanf(" %c", &result);
| ^~~~~~~~~~~~~~~~~~~~~
Main.c: In function 'main':
Main.c:20:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
20 | scanf("%d%lf%d", &n, &p, &t);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:77:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
77 | scanf(" %c", &verdict);
| ^~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Protocol violation |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
344 KB |
Output is correct |
2 |
Correct |
7 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 |
5 ms |
344 KB |
Output is correct |
6 |
Correct |
5 ms |
344 KB |
Output is correct |
7 |
Correct |
8 ms |
344 KB |
Output is correct |
8 |
Correct |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
5 ms |
344 KB |
Output is correct |
10 |
Correct |
7 ms |
344 KB |
Output is correct |
11 |
Correct |
5 ms |
344 KB |
Output is correct |
12 |
Correct |
7 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 |
6 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |