oj.uz

Submission #1090400

# Submission time Handle Problem Language Result Execution time Memory
1090400 2024-09-18T10:38:56 Z lucri COVID tests (CEOI24_covid) C++17
10 / 100
 3954 ms 356 KB 
#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,int sz)
{
    if(b>e)
        return;
    int ce=e;
    e=std::min(e,b+2*sz-1);
    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,sz);
    }
    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],sz);
}
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(1);
    }
    else if(P>0.17)//P=0.2
    {
        raspunde(N);
    }
    else if(P>0.11)//P=0.158765
    {
        raspunde(N);
    }
    else if(P>0.1)//P=0.104571
    {
        raspunde(N);
    }
    else if(P>0.06)//P=0.068648
    {
        raspunde(N);
    }
    else if(P>0.03)//P=0.039856
    {
        raspunde(N);
    }
    else if(P>0.02)//P=0.028545
    {
        raspunde(N);
    }
    else if(P>0.01)//P=0.011546
    {
        raspunde(N);
    }
    else if(P>0.005)//P=0.005256
    {
        raspunde(N);
    }
    else//P=0.001
    {
        raspunde(500);
    }
    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

Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:134:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:153:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 15 ms 344 KB Output is correct
6 Correct 15 ms 356 KB Output is correct
7 Correct 9 ms 356 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 12 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 344 KB Output is correct (P=0.001, F=15.1, Q=15.0) -> 90.00 points
2 Correct 126 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=55.2) -> 68.13 points
3 Correct 268 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=109.0) -> 56.45 points
4 Correct 577 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=254.0) -> 39.04 points
5 Correct 858 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=353.5) -> 32.84 points
6 Correct 1405 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=598.4) -> 25.45 points
7 Correct 2127 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=901.1) -> 20.68 points
8 Correct 3171 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=1343.6) -> 16.64 points
9 Execution timed out 3954 ms 344 KB Time limit exceeded (wall clock)
10 Halted 0 ms 0 KB -