Submission #1137607

#	Time	Username	Problem	Language	Result	Execution time	Memory
1137607		Muhammad_Aneeq	COVID tests (CEOI24_covid)	C++20	0 / 100	7041 ms	98196 KiB

Main

#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <iostream>
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(vector<bool> mask) {
    assert(mask.size() == (size_t)N);

    string mask_str(N, ' ');
    for (int i = 0; i < N; i++)
        mask_str[i] = mask[i] ? '1' : '0';

    cout<<"Q "<<mask_str<<endl;
    fflush(stdout);
    char answer;
    cin>>answer;
    return answer == 'P';
}
vector<bool>vals;
vector<bool> answer;
bool ask(int l,int r)
{
    for (int i=l;i<=r;i++)
        vals[i]=1;
    int f=test_students(vals);
    for (int i=l;i<=r;i++)
        vals[i]=0;
    return f;
}
void divi(int l,int r)
{
    int mid=(l+r)/2;
    if (l==r)
    {
        answer[l]=1;
        return;
    }
    if (ask(l,mid))
        divi(l,r);
    if (ask(mid+1,r))
        divi(mid+1,r);
}
vector<bool> find_positive() 
{
    vals={};
    vals.resize(N);
    answer=vals;
    divi(0,N-1);
    return answer;
}

int main() {
    int T;
    cin>>N>>P>>T;

    // You may perform any extra initialization here.

    for (int i = 0; i < T; i++) {
        vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);

        string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';

        cout<<"A "<<answer_str<<endl;
        fflush(stdout);

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

    return 0;
}

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