oj.uz

Submission #1109501

# Submission time Handle Problem Language Result Execution time Memory
1109501 2024-11-07T00:40:33 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5427 ms 348 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int N;
double P;
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';
}
 
int T;
int answer[1001];
vector<bool>qry;
void solve(int ql,int qr){
    int l=ql,r=qr;
    while(l<=qr){
        r=qr;
        int pos=N;
        for(int j=0;j<N;j++)qry[j]=0;
        for(int j=l;j<=r;j++)qry[j]=1;
        if(!test_students(qry))return;
        while(l<=r){
            int mid=l+(r-l)/2;
            for(int j=0;j<N;j++)qry[j]=0;
            for(int j=l;j<=mid;j++)qry[j]=1;
            if(test_students(qry))pos=min(pos,mid),r=mid-1;
            else l=mid+1;
        }
        if(pos==N)return;
        l=pos+1;
        answer[pos]=1;
    }
}
void find_positive(int gap){
    for(int j=0;(j*gap)<N;j++){
        solve(j*gap,min(N-1,(j*gap)+gap-1));
    }
}
int main() {
    scanf("%d %lf %d", &N, &P, &T);
    qry.resize(N);
    for (int i = 0; i < T; i++) {
        for(int j=0;j<N;j++)answer[j]=0;
        int gap;
        if(T==1)gap=1;
        else if(P==0.001)gap=700;
        else if(P==0.005256)gap=138;
        else if(P==0.011546)gap=63;
        else if(P==0.028545)gap=25;
        else if(P==0.039856)gap=17;
        else if(P==0.068648)gap=10;
        else if (P==0.104571)gap=7;
        else if(P==0.158765)gap=5;
        else if(P==0.2)gap=3;
        else assert(0);
        find_positive(gap);
        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:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 336 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 336 KB Output is correct
2 Correct 31 ms 336 KB Output is correct
3 Correct 38 ms 336 KB Output is correct
4 Correct 32 ms 336 KB Output is correct
5 Correct 34 ms 336 KB Output is correct
6 Correct 36 ms 336 KB Output is correct
7 Correct 27 ms 336 KB Output is correct
8 Correct 23 ms 336 KB Output is correct
9 Correct 36 ms 336 KB Output is correct
10 Correct 21 ms 336 KB Output is correct
11 Correct 26 ms 336 KB Output is correct
12 Correct 28 ms 336 KB Output is correct
13 Correct 28 ms 336 KB Output is correct
14 Correct 27 ms 336 KB Output is correct
15 Correct 35 ms 336 KB Output is correct
16 Correct 42 ms 336 KB Output is correct
17 Correct 20 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 336 KB Output is correct (P=0.001, F=15.1, Q=11.0) -> 90.00 points
2 Correct 328 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=48.1) -> 90.00 points
3 Correct 652 ms 348 KB Output is correct (P=0.011546, F=94.9, Q=93.2) -> 90.00 points
4 Correct 1377 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=196.5) -> 81.49 points
5 Correct 1701 ms 348 KB Output is correct (P=0.039856, F=246.3, Q=255.4) -> 78.41 points
6 Correct 2632 ms 340 KB Output is correct (P=0.068648, F=366.2, Q=387.4) -> 73.08 points
7 Correct 3589 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=527.3) -> 69.13 points
8 Correct 4748 ms 336 KB Output is correct (P=0.158765, F=639.1, Q=698.3) -> 65.67 points
9 Execution timed out 5427 ms 336 KB Time limit exceeded (wall clock)
10 Halted 0 ms 0 KB -