oj.uz

Submission #1039310

# Submission time Handle Problem Language Result Execution time Memory
1039310 2024-07-30T16:51:12 Z Dalek_of_Rivia COVID tests (CEOI24_covid) C++17
61.67 / 100
 1505 ms 388 KB 
#include <bits/stdc++.h>
using namespace std;

bool ans[1000];
string question;
int N;

bool ask(int inf, int sup, bool preg){
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    char c='P';
    if(preg){
        cout<<"Q ";
        for(int i=inf; i<=sup; i++){
            question[i]='1';
        }
        cout<<question<<endl;
        for(int i=inf; i<=sup; i++){
            question[i]='0';
        }
        cout.flush();
        cin>>c;
    }
    if(c=='N'){
        for(int i=inf; i<=sup; i++) ans[i]=false;
        return false;
    }else if(inf==sup){
        ans[inf]=true;
        return true;
    }else{
        int m = (inf+sup)/2;
        ask(m+1, sup, ask(inf, m, true));
        return true;
    }
}

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int T;
    double P;
    cin>>N>>P>>T;
    double jaskier=1.2;
    for(int i=0; i<1000; i++) question.push_back('0');
    for(int dalekofrivia=0; dalekofrivia<T; dalekofrivia++){
        if(P<0.001) P=0.001;
        int u=0.5+log(jaskier/P)/log(2);
        int lambda=1;
        for(int i=0; i<u; i++) lambda*=2;
        for(int i=0; i<N; i++) question[i]='0';
        for(int i=0; i<N; i=i+lambda) ask(i, min(i+lambda, N)-1, true);
        cout<<"A ";
        for(int i=0; i<N; i++) cout<<ans[i];
        cout<<endl;
        cout.flush();
        char C;
        cin>>C;
        if(C!='C') break;
    }

    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

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

Subtask #2
51.669999999 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 344 KB Output is correct (P=0.001, F=15.1, Q=13.9) -> 90.00 points
2 Correct 116 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=58.5) -> 56.99 points
3 Correct 216 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=112.5) -> 51.67 points
4 Correct 387 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=221.2) -> 55.54 points
5 Correct 472 ms 340 KB Output is correct (P=0.039856, F=246.3, Q=286.7) -> 54.34 points
6 Correct 711 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=414.4) -> 58.96 points
7 Correct 997 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=559.7) -> 57.46 points
8 Correct 1313 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=701.6) -> 64.69 points
9 Correct 1505 ms 344 KB Output is correct (P=0.2, F=731.4, Q=823.5) -> 59.85 points