oj.uz

답안 #1038851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038851 2024-07-30T08:20:08 Z Warinchai COVID tests (CEOI24_covid) C++14
36.18 / 100
 1713 ms 344 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
int n,t;
double p;
int use=0;
int ask(string v){
    //use++;
    cout<<"Q ";
    cout<<v;
    cout<<endl;
    //cerr<<"input:"<<endl;
    char ans;
    cin>>ans;
    //cerr<<ans<<endl;
    return ans=='P'?1:0;
}
string temp;
string ans;
void fans(int st,int en){
    //cerr<<st<<" "<<en<<endl;
    if(st==en){
        temp[st]='1';
        ans[st]=ask(temp)?'1':'0';
        temp[st]='0';
        return;
    }
    if(st>en)return;
    int m=(st+en)/2;
    for(int i=st;i<=m;i++)temp[i]='1';
    bool tans;tans=ask(temp);
    for(int i=st;i<=m;i++)temp[i]='0';
    if(tans){
        if(st==m)ans[st]='1';
        else fans(st,m);

        for(int i=m+1;i<=en;i++)temp[i]='1';
        tans=ask(temp);
        for(int i=m+1;i<=en;i++)temp[i]='0';
        if(tans){
            if(m+1==en)ans[en]='1';
            else fans(m+1,en);
        }
    }else{
        if(m+1==en)ans[en]='1';
        else fans(m+1,en);
    }
}
double pp[9]={0.001,0.005256,0.011546,0.028545,0.039856,0.068648,0.104571,0.158765,0.2};
double ep=0.0001;
//int mx[9]={15,51,94,191,246,366,490,639,731};
//int mx[9]={5,10,94,50,125,125,250,250,250};
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>p>>t;
    temp=string(n,'0');
    int cur=-1;
    for(int i=0;i<9;i++)if(abs(pp[cur]-p)<ep)cur=i;
    int div=64;
    //int prob=1000/div;
    //cerr<<"prob:"<<prob<<endl;
    //cerr<<"div:"<<div<<endl;
    while(t--){
        //cerr<<"work"<<endl;
        ans=string(n,'0');
        use=0;
        int i=1;
        for(;i*div-1<n;i++){
            //cerr<<"prob-"<<i<<endl;
            string t(n,'0');
            for(int j=div*(i-1);j<=div*i-1;j++)t[j]='1';
            if((i-1)*div==div*i-1||ask(t))fans(div*(i-1),div*i-1);
            for(int j=div*(i-1);j<=div*i-1;j++)t[j]='0';
        }
        if((i-1)*div<n){
            string temp(n,'0');
            for(int j=div*(i-1);j<=n-1;j++)temp[j]='1';
            if((i-1)*div==n-1||ask(temp))fans(div*(i-1),n-1);
        }
        cout<<"A ";
        cout<<ans;
        cout<<endl;
        char res;
        cin>>res;
        //cerr<<"use:"<<use<<endl;
        if(res=='W')break;
    }
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
26.180000001 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 344 KB Output is correct (P=0.001, F=15.1, Q=24.3) -> 26.18 points
2 Correct 106 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=59.6) -> 54.04 points
3 Correct 195 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=109.8) -> 55.28 points
4 Correct 377 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=228.5) -> 50.77 points
5 Correct 507 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=296.9) -> 49.40 points
6 Correct 793 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=447.0) -> 47.81 points
7 Correct 1072 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=600.6) -> 47.37 points
8 Correct 1419 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=790.8) -> 46.17 points
9 Correct 1713 ms 344 KB Output is correct (P=0.2, F=731.4, Q=921.5) -> 44.13 points