제출 #1204230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204230		NK_	COVID tests (CEOI24_covid)	C++20	22.32 / 100	691 ms	460 KiB

Main

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())

template<class T> using V = vector<T>;
using vi = V<int>;

int N;
double P;

string mask;
bool qry(vi sample) {
	if (sz(sample) == 0) return false;
    // assert(mask.size() == (size_t)N);

    for(auto& i : sample) mask[i] = '1';

    cout << "Q " << mask << endl;

    for(auto& i : sample) mask[i] = '0';

    char answer; cin >> answer;
    return answer == 'P';
}

// vi K = {2, 2, 3, 3, 4, 4, 4, 4, 4, 4};
vi K = {30, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3};

vi get() {
	vi ans;

    vi X; for(int i = 0; i < N; i++) X.pb(i);

    function<void(vi, int)> dnc = [&](vi A, int d) {
    	if (sz(A) == 1) {
    		ans.pb(A.front());
    		return;
    	}

    	V<vi> S(K[d]);
    	for(int i = 0; i < sz(A); i++) S[i % K[d]].pb(A[i]);
    	for(int i = 0; i < K[d]; i++) if (qry(S[i])) dnc(S[i], d + 1);
    };

	dnc(X, 0);

    return ans;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
    int T;
    cin >> N >> P >> T;

    mask = string(N, '0');

    // You may perform any extra initialization here.

    for (int i = 0; i < T; i++) {
		vi answer = get();
        // assert(answer.size() == (size_t)N);

       	string answer_str(N, '0');
        for(auto& i : answer) answer_str[i] = '1';

       	cout << "A " << answer_str << endl;

        char verdict; cin >> verdict;
        if (verdict == 'W')
            exit(0-0);
    }

    return 0;
}

// Breathe In, Breathe Out

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 12.32 / 90