| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1090393 | lucri | COVID tests (CEOI24_covid) | C++17 | 515 ms | 344 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
/// You may use:
// The number of students
int N,T;
// 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.
std::vector<bool> answer;
std::vector<bool> test;
std::vector<int> ind;
int p[1010];
void calculeaza(int b,int e)
{
    if(b>e)
        return;
    int ce=e;
    while(b<=e)
    {
        int mid=(b+e)/2;
        for(int i=b;i<=mid;++i)
            test[p[i]]=1;
        bool r=test_students(test);
        for(int i=b;i<=mid;++i)
            test[p[i]]=0;
        if(r==false)
            b=mid+1;
        else
            e=mid-1;
    }
    if(b<=ce)
    {
        answer[p[b]]=1;
        calculeaza(b+1,ce);
    }
    return;
}
void raspunde(int sz)
{
    p[0]=0;
    for(int i=0;i<N;i+=sz)
    {
        for(int j=i;j<i+sz&&j<N;++j)
            test[j]=1;
        if(test_students(test)==true)
        {
            for(int j=i;j<i+sz&&j<N;++j)
                p[++p[0]]=j;
        }
        for(int j=i;j<i+sz&&j<N;++j)
            test[j]=0;
    }
    calculeaza(1,p[0]);
}
std::vector<bool> find_positive()
{
    for(int i=0;i<N;++i)
    {
        answer[i]=test[i]=0;
        ind[i]=i;
    }
    random_shuffle(ind.begin(),ind.end());
    if(T==1)//subtask 1
    {
        raspunde(N);
    }
    else if(P>0.17)//P=0.2
    {
        raspunde(5);
    }
    else if(P>0.11)//P=0.158765
    {
        raspunde(5);
    }
    else if(P>0.1)//P=0.104571
    {
        raspunde(5);
    }
    else if(P>0.06)//P=0.068648
    {
        raspunde(5);
    }
    else if(P>0.03)//P=0.039856
    {
        raspunde(5);
    }
    else if(P>0.02)//P=0.028545
    {
        raspunde(5);
    }
    else if(P>0.01)//P=0.011546
    {
        raspunde(5);
    }
    else if(P>0.005)//P=0.005256
    {
        raspunde(5);
    }
    else//P=0.001
    {
        raspunde(5);
    }
    return answer;
}
int main() {
    scanf("%d %lf %d", &N, &P, &T);
    // You may perform any extra initialization here.
    srand(time(0));
    answer.resize(N);
    ind.resize(N);
    test.resize(N);
    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;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
