#include<bits/stdc++.h>
#include<chrono>
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';
}
map<int,int> shuffled;
void rec(int l, int r, vector<bool>& ans){
    if(l == r){
        ans[shuffled[l]] = true;
        return;
    }
    int m = ceil((l+r)*P);
    vector<bool> lef(n);
    vector<bool> rig(n);
    for(int i = l; i <= m; i++){ 
        lef[shuffled[i]] = true;
    }
    for(int i = m+1; i <= r; i++){ 
        rig[shuffled[i]] = true;
    }
    bool lq = test_students(lef);
    bool rq = test_students(rig);
    if(lq){
        rec(l,m,ans);
    }
    if(rq){
        rec(m+1,r,ans); 
    }
}
/// 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.
std::vector<bool> find_positive() {
    vector<int> perm(n);
    iota(perm.begin(),perm.end(), 0);
    unsigned seed = chrono::system_clock::now().time_since_epoch().count();
    shuffle (perm.begin(), perm.end(), std::default_random_engine(seed));
    for(int i = 0; i < n; i++){ 
        shuffled[perm[i]] = i;
    }
    std::vector<bool> answer(n);
    
    rec(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;
}
Compilation message (stderr)
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:87:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |     scanf("%d %lf %d", &n, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:103:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |