oj.uz

답안 #1038924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038924 2024-07-30T09:25:38 Z Warinchai COVID tests (CEOI24_covid) C++14
0 / 100
 60 ms 8096 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
int n,t;
double p;
int use=0;
map<string,int>mp;
int ask(string v){
    if(mp[v]!=0)return mp[v]-1;
    //use++;
    cout<<"Q ";
    cout<<v;
    cout<<endl;
    //cerr<<"input:"<<endl;
    char ans;
    cin>>ans;
    //cerr<<ans<<endl;
    return (mp[v]=(ans=='P'?1:0)+1)-1;
}
int ask(int st,int en){
    string temp(n,'0');
    for(int i=st;i<=en;i++)temp[i]='1';
    return ask(temp);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>p>>t;
    int freq=p*n;
    int mx=0;
    while((1<<mx)<freq)mx++;
    mx*=2;
    mx=min(9,mx);
    string temp=string(n,'0');
    while(t--){
        //cerr<<"work"<<endl;
        int cur=-1;
        string ans=string(n,'0');
        while(cur<n-1){
            int nmx=0;
            if(cur+(1<<mx)>=n){
                while(cur+(1<<nmx)<n)nmx++;
                nmx--;
            }else{
                nmx=mx;
            }
            if(ask(cur+1,cur+(1<<nmx))){
                for(int i=nmx-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                cur++;
                ans[cur]='1';
            }else{
                int nw=nmx+1;
                while(cur+(1<<nw)<n&&ask(cur+1,cur+(1<<nw))==0){
                    nw++;
                }
                if(cur+(1<<nw)>=n){
                    if(!ask(cur+1,n-1))break;
                    for(int i=nw-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                    cur++;
                    ans[cur]='1';
                }else{
                    for(int i=nw-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                    cur++;
                    ans[cur]='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 Incorrect 0 ms 344 KB translate:wrong
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 60 ms 8096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB translate:wrong
2 Halted 0 ms 0 KB -