#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
using ll = long long;
using vi = vector<int>;
using ar2 = array<int,2>;
using ar3 = array<int,3>;
using ar4 = array<int,4>;
const int INF = (int)2e9;
const int mxN = (int)1e6+10;
int N;
double P;
map<vector<bool>,bool> M;
// 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);
//if(M.count(mask)) return M[mask];
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.
vector<bool> find_positive() {
vector<bool> answer(N,false), test(N,false);
vector<int> XD(N,0); iota(all(XD),0); random_shuffle(all(XD));
if(P>0.08){
int likely = P*1000*1.8;
for(int i = 0; i < N; i++){
if(!likely) break;
test[XD[i]]=1;
if(test_students(test))
answer[XD[i]]=1, likely--;
test[XD[i]]=0;
}
return answer;
}
int l = 0;
while(l<N){
for(int i = 0; i < N; i++) test[XD[i]]=0;
for(int i = l; i < N; i++) test[XD[i]]=1;
if(!test_students(test)) return answer;
for(int i = 0; i < N; i++) test[XD[i]]=0;
int r = N-1, oldL = l;
while(l<r){
int mid = (l+r)/2;
for(int i = oldL; i<=mid; i++) test[XD[i]]=1;
if(test_students(test)) r=mid;
else l=mid+1;
for(int i = oldL; i<=mid; i++) test[XD[i]]=0;
}
answer[XD[l]]=1; 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++) {
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;
}
Compilation message
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf(" %c", &answer);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
77 | scanf("%d %lf %d", &N, &P, &T);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:93:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
93 | scanf(" %c", &verdict);
| ~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
344 KB |
Output is correct |
| 2 |
Correct |
7 ms |
344 KB |
Output is correct |
| 3 |
Correct |
4 ms |
344 KB |
Output is correct |
| 4 |
Correct |
7 ms |
344 KB |
Output is correct |
| 5 |
Correct |
7 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 |
6 ms |
344 KB |
Output is correct |
| 9 |
Correct |
6 ms |
344 KB |
Output is correct |
| 10 |
Correct |
6 ms |
344 KB |
Output is correct |
| 11 |
Correct |
7 ms |
344 KB |
Output is correct |
| 12 |
Correct |
9 ms |
340 KB |
Output is correct |
| 13 |
Correct |
9 ms |
344 KB |
Output is correct |
| 14 |
Correct |
8 ms |
344 KB |
Output is correct |
| 15 |
Correct |
8 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
344 KB |
Output is correct |
| 17 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=10.8) -> 90.00 points |
| 2 |
Correct |
128 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=53.0) -> 78.35 points |
| 3 |
Correct |
282 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=114.6) -> 49.17 points |
| 4 |
Correct |
655 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=280.0) -> 31.59 points |
| 5 |
Correct |
939 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=392.2) -> 26.71 points |
| 6 |
Correct |
1620 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=674.1) -> 20.63 points |
| 7 |
Correct |
2291 ms |
344 KB |
Output is correct (P=0.104571, F=490.3, Q=1000.0) -> 17.45 points |
| 8 |
Correct |
2339 ms |
344 KB |
Output is correct (P=0.158765, F=639.1, Q=1000.0) -> 27.62 points |
| 9 |
Correct |
2322 ms |
344 KB |
Output is correct (P=0.2, F=731.4, Q=1000.0) -> 36.45 points |
