제출 #1222535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222535		Ariadna	COVID tests (CEOI24_covid)	C++20	10 / 100	7046 ms	476 KiB

Main

#include <bits/stdc++.h>
using namespace std;

mt19937 rng;
int n;
double p;
vector<int> idx;

bool ask(vector<int>& a) {
    cout << "Q ";
    for (int i: a) cout << i;
    cout << endl;
    char c;
    cin >> c;
    if (c == 'P') return 1;
    return 0;
}

void recorrer_arbre(int l, int r, vector<int>& ans) {
    if (l == r) {
        ans[idx[l]] = 1;
        return;
    }
    vector<int> a(n, 0);
    int m = (l+r)/2;
    for (int i = l; i <= m; ++i) a[idx[i]] = 1;
    bool aux = ask(a);
    for (int i = l; i <= m; ++i) a[idx[i]] = 0;
    if (aux) {
        recorrer_arbre(l, m, ans);
        for (int i = m+1; i <= r; ++i) a[idx[i]] = 1;
        bool aux = ask(a);
        if (aux) recorrer_arbre(m+1, r, ans);
    } else recorrer_arbre(m+1, r, ans);
    
}
bool ok = true;
void solve() {
    idx = vector<int>(n);
    for (int i = 0; i < n; ++i) idx[i] = i;
    shuffle(idx.begin(), idx.end(), rng);
    vector<int> a(n, 1);
    vector<int> ans(n, 0);
    if (ask(a)) recorrer_arbre(0, n-1, ans);
    cout << "A ";
    for (int i = 0; i < n; ++i) {
        cout << ans[i];
    }
    cout << endl;
    char c;
    cin >> c;
    if (c == 'W') ok = false;
}

int main() {
    rng = std::mt19937(chrono::steady_clock::now().time_since_epoch().count());
    int t;
    cin >> n >> p >> t;
    while (t--) {
        solve();
        if (!ok) break;
    }

    return 0;
}

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