oj.uz

Submission #1109499

# Submission time Handle Problem Language Result Execution time Memory
1109499 2024-11-07T00:32:04 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5211 ms 504 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
//#include<iostream>
//#include <bits/stdc++.h>
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+10];

void solve(int ql,int qr){
    int l=ql,r=qr;
    vector<bool>qry(N,0);
    for(int j=l;j<=r;j++)qry[j]=1;
    if(!test_students(qry))return;
    while(l<=qr){
        r=qr;
        int pos=N;
        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);
    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:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         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 36 ms 504 KB Output is correct
2 Correct 28 ms 348 KB Output is correct
3 Correct 35 ms 348 KB Output is correct
4 Correct 35 ms 348 KB Output is correct
5 Correct 41 ms 348 KB Output is correct
6 Correct 30 ms 340 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 27 ms 348 KB Output is correct
9 Correct 33 ms 348 KB Output is correct
10 Correct 16 ms 348 KB Output is correct
11 Correct 30 ms 348 KB Output is correct
12 Correct 26 ms 336 KB Output is correct
13 Correct 32 ms 336 KB Output is correct
14 Correct 25 ms 336 KB Output is correct
15 Correct 29 ms 336 KB Output is correct
16 Correct 32 ms 336 KB Output is correct
17 Correct 23 ms 348 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 348 KB Output is correct (P=0.001, F=15.1, Q=15.4) -> 83.37 points
2 Correct 464 ms 348 KB Output is correct (P=0.005256, F=51.1, Q=64.7) -> 43.59 points
3 Correct 820 ms 340 KB Output is correct (P=0.011546, F=94.9, Q=121.3) -> 42.60 points
4 Correct 1651 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=241.4) -> 44.07 points
5 Correct 2048 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=304.7) -> 46.19 points
6 Correct 3006 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=440.1) -> 49.80 points
7 Correct 3825 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=573.6) -> 53.58 points
8 Correct 4879 ms 336 KB Output is correct (P=0.158765, F=639.1, Q=728.3) -> 57.76 points
9 Execution timed out 5211 ms 336 KB Time limit exceeded (wall clock)
10 Halted 0 ms 0 KB -