#include <bits/stdc++.h>
using namespace std;
/// You may use:
// The number of students
int N;
// The probability any given student is positive
double P;
// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.
bool test_students(std::vector<bool> mask)
{
assert(mask.size() == (size_t)N);
std::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';
}
/// You should implement:
// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
void rectest(int L, int R, vector<bool> &test, vector<bool> &answer)
{
if (test_students(test) == 0)
return;
if (L == R)
{
answer[L] = 1;
return;
}
int m = (L + R) / 2;
for (int i = L; i <= m; i++)
test[i] = 0;
rectest(m + 1, R, test, answer);
for (int i = L; i <= m; i++)
test[i] = 1;
for (int i = m + 1; i <= R; i++)
test[i] = 0;
rectest(L, m, test, answer);
}
std::vector<bool> find_positive()
{
std::vector<bool> answer(N);
vector<bool> left(N);
int div = N;
if (P < 0.1)
div = ceil((double)1 / P);
if (P == 0.2)
div = 3;
if (P == 0.158765)
div = 5;
if (P == 0.104571)
div = 6;
vector<bool> test(N, 0);
if (div == N)
{
test.assign(N, 1);
rectest(0, N - 1, test, answer);
return answer;
}
int t;
int L = 0, R = 1;
test[0] = 1;
while (L < N)
{
t = 1;
while (L + div > R && R < N)
{
test[R] = 1;
R++;
}
if (test_students(test))
{
int L2 = L, R2 = R;
while (L2 != R2)
{
int m = (L2 + R2) / 2;
for (int i = L2; i <= m; i++)
left[i] = 1;
bool b = test_students(left);
for (int i = L2; i <= m; i++)
left[i] = 0;
if (b)
R2 = m;
else
L2 = m + 1;
}
answer[L2] = 1;
while (L <= L2)
{
test[L] = 0;
L++;
}
}
else
{
while (L < R)
{
test[L] = 0;
L++;
}
}
}
return answer;
}
int main()
{
int T;
scanf("%d %lf %d", &N, &P, &T);
// You may perform any extra initialization here.
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
Main.cpp: In function 'std::vector<bool> find_positive()':
Main.cpp:77:9: warning: variable 't' set but not used [-Wunused-but-set-variable]
77 | int t;
| ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
28 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:126:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
126 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:143:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
143 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
344 KB |
Output is correct |
| 2 |
Correct |
13 ms |
344 KB |
Output is correct |
| 3 |
Correct |
12 ms |
344 KB |
Output is correct |
| 4 |
Correct |
13 ms |
344 KB |
Output is correct |
| 5 |
Correct |
12 ms |
344 KB |
Output is correct |
| 6 |
Correct |
17 ms |
344 KB |
Output is correct |
| 7 |
Correct |
12 ms |
344 KB |
Output is correct |
| 8 |
Correct |
13 ms |
344 KB |
Output is correct |
| 9 |
Correct |
16 ms |
344 KB |
Output is correct |
| 10 |
Correct |
8 ms |
344 KB |
Output is correct |
| 11 |
Correct |
12 ms |
344 KB |
Output is correct |
| 12 |
Correct |
11 ms |
344 KB |
Output is correct |
| 13 |
Correct |
12 ms |
360 KB |
Output is correct |
| 14 |
Correct |
11 ms |
344 KB |
Output is correct |
| 15 |
Correct |
13 ms |
344 KB |
Output is correct |
| 16 |
Correct |
15 ms |
344 KB |
Output is correct |
| 17 |
Execution timed out |
4237 ms |
344 KB |
Time limit exceeded (wall clock) |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
37 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=17.8) -> 52.47 points |
| 2 |
Correct |
117 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=47.4) -> 90.00 points |
| 3 |
Correct |
230 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=93.0) -> 90.00 points |
| 4 |
Correct |
507 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=195.2) -> 83.54 points |
| 5 |
Correct |
647 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=256.4) -> 77.32 points |
| 6 |
Correct |
890 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=381.4) -> 77.19 points |
| 7 |
Correct |
1331 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=530.9) -> 67.61 points |
| 8 |
Correct |
1646 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=715.7) -> 60.83 points |
| 9 |
Correct |
2079 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=812.6) -> 62.32 points |
