#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
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:
void rec(int l, int r, vector<bool>& answer)
{
vector<bool> v(N, false);
for (int i = l; i <= r; ++i)
v[i] = true;
if (test_students(v) == false)
return;
if (l == r)
{
answer[l] = true;
return;
}
int m = (l + r) / 2;
rec(l, m, answer);
rec(m + 1, r, answer);
}
void solv0(vector<bool>& answer)
{
int s = 0;
while (s < N)
{
int l = s, r = N - 1;
vector<bool> v(N, false);
for (int i = l; i <= r; ++i)
v[i] = true;
if (!test_students(v))
break;
int u;
while (l <= r)
{
int m = (l + r) / 2;
vector<bool> v(N, false);
for (int i = s; i <= m; ++i)
v[i] = true;
if (test_students(v))
{
u = m;
r = m - 1;
}
else
l = m + 1;
}
answer[u] = true;
s = u + 1;
}
}
double dp[1003];
int u[1003];
void coolrec(int l, int r, vector<bool>& ans)
{
if (u[r - l + 1] == 0)
{
vector<bool> v(N, false);
for (int i = l; i <= r; ++i)
{
v[i] = true;
if (test_students(v))
{
ans[i] = true;
}
v[i] = false;
}
return;
}
vector<bool> v(N, false);
for (int i = l; i <= r; ++i)
v[i] = true;
if (!test_students(v))
return;
coolrec(l, l + u[r - l + 1] - 1, ans);
coolrec(l + u[r - l + 1], r, ans);
}
// 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.
std::vector<bool> find_positive() {
std::vector<bool> answer(N, false);
for (int n = 1; n <= N; ++n)
{
dp[n] = n;
u[n] = 0;
double t = 1;
for (int i = 1; i <= n; ++i)
t *= (1 - P);
for (int j = 1; j < n; ++j)
{
if (t + (1 - t) * (1 + dp[j] + dp[n - j]) < dp[n])
{
dp[n] = t + (1 - t) * (1 + dp[j] + dp[n - j]);
u[n] = j;
}
}
}
//printf("%f\n", dp[N]);
//exit(0);
coolrec(0, N - 1, answer);
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;
}
// 1000 0.001 300
// 1000 0.005256 300
// 1000 0.011546 300
// 1000 0.028545 300
// 1000 0.039856 300
// 1000 0.068648 300
// 1000 0.104571 300
// 1000 0.158765 300
// 1000 0.2 300
Compilation message
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:143:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
143 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:159:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
159 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp: In function 'void solv0(std::vector<bool>&)':
Main.cpp:80:11: warning: 'u' may be used uninitialized in this function [-Wmaybe-uninitialized]
80 | s = u + 1;
| ~~^~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
344 KB |
Output is correct |
| 2 |
Correct |
8 ms |
344 KB |
Output is correct |
| 3 |
Correct |
8 ms |
344 KB |
Output is correct |
| 4 |
Correct |
6 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 |
6 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 |
7 ms |
428 KB |
Output is correct |
| 11 |
Correct |
7 ms |
344 KB |
Output is correct |
| 12 |
Correct |
6 ms |
344 KB |
Output is correct |
| 13 |
Correct |
6 ms |
344 KB |
Output is correct |
| 14 |
Correct |
5 ms |
344 KB |
Output is correct |
| 15 |
Correct |
6 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
344 KB |
Output is correct |
| 17 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
393 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=60.7) -> 6.88 points |
| 2 |
Correct |
505 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=119.6) -> 14.15 points |
| 3 |
Correct |
739 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=240.8) -> 12.59 points |
| 4 |
Correct |
1112 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=417.1) -> 15.76 points |
| 5 |
Correct |
1334 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=501.7) -> 17.48 points |
| 6 |
Correct |
1681 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=683.8) -> 20.14 points |
| 7 |
Correct |
2009 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=862.3) -> 22.31 points |
| 8 |
Correct |
2375 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=1066.5) -> 24.49 points |
| 9 |
Correct |
2542 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=1177.0) -> 26.19 points |
