#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
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.
vector<bool> answer;
void calc(ll l, ll r)
{
    if (l > r)
        return;
    vector<bool> t(N, 0);
    ll i, piv, pos = -1, in = l;
    for (i = l; i <= r; i++)
        t[i] = 1;
    if (test_students(t))
    {
        if (l == r)
            answer[l] = 1;
    }
    else
        return;
    if(l==r)
        return;
    piv = (l + r) / 2;
    calc(l, piv);
    calc(piv + 1, r);
}
std::vector<bool> find_positive2()
{
    ll n = N;
    vector<bool> s(n, 0);
    vector<bool> ans(n, 0);
    for (int i = 0; i < n; i++)
    {
        s[i] = 1;
        if (test_students(s))
        {
            ans[i] = 1;
        }
        s[i] = 0;
    }
    return ans;
}
std::vector<bool> find_positive()
{
    if (P > 0.16)
        return find_positive2();
    answer.resize(0);
    answer.resize(N, 0);
    for(ll i=0; i<N; i+=100)
        calc(i,i+99);
    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;
}
컴파일 시 표준 에러 (stderr) 메시지
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:118:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         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... |