제출 #1222528

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

Main

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

mt19937 rng;
int n;
double p;

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

void recorrer_arbre(int l, int r, vector<int>& ans) {
    if (l == r) {
        ans[l] = 1;
        return;
    }
    vector<int> a(n, 0);
    int m = (l+r)/2;
    if (cont) {
        for (int i = l; i <= m; ++i) a[i] = 1;
        int aux = ask(a);
        if (!cont) {
            return;
        }
        for (int i = l; i <= m; ++i) a[i] = 0;
        if (aux) recorrer_arbre(l, m, ans);
        if (!cont) return;
    } 
    if (cont) {
        for (int i = m+1; i <= r; ++i) a[i] = 1;
        int aux = ask(a);
        if (!cont) return; 
        if (aux) recorrer_arbre(m+1, r, ans);
        if (!cont) return;
    }
}
bool ok = true;
void solve() {
    vector<int> idx(n);
    for (int i = 0; i < n; ++i) idx[i] = i;
    shuffle(idx.begin(), idx.end(), rng);
    vector<int> ans(n, 0);
    cont = true;
    recorrer_arbre(0, n-1, ans);
    if (!cont) return;
    cout << "A ";
    for (int i = 0; i < n; ++i) {
        cout << ans[idx[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-- && ok) {
        solve();
    }

    return 0;
}

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