oj.uz

답안 #1042063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042063 2024-08-02T13:41:48 Z Warinchai COVID tests (CEOI24_covid) C++14
77.73 / 100
 1480 ms 1972 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){
    en=min(n-1,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=n/(p*n);
    int mx=0;
    while((1<<mx)<freq)mx++;
    mx-=2;
    mx=min(9,mx);
    mx=max(0,mx);
    while(t--){
        //cerr<<"work"<<endl;
        mp.clear();
        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;
            }
            //cout<<nmx<<endl;
            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{
                //cout<<"overflow"<<endl;
                int nw=nmx+1;
                while(cur+(1<<nw)<n&&ask(cur+1,cur+(1<<nw))==0){
                    nw++;
                }
                //cout<<"end"<<nw<<endl;
                if(cur+(1<<nw)>=n){
                    //cout<<"still ov"<<cur<<" "<<n<<endl;
                    if(!ask(cur+1,n-1))break;
                    //cout<<"what"<<endl;
                    for(int i=nw-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                    cur++;
                    ans[cur]='1';
                }else{
                    //cout<<"not ov"<<endl;
                    for(int i=nw-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                    cur++;
                    ans[cur]='1';
                }
            }
        }
        //cout<<x<<endl;
        //cout<<ask(x)<<endl;
        //assert(ask(x)==0);
        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 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

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

Subtask #2
67.730000004 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 492 KB Output is correct (P=0.001, F=15.1, Q=11.8) -> 90.00 points
2 Correct 92 ms 516 KB Output is correct (P=0.005256, F=51.1, Q=48.8) -> 90.00 points
3 Correct 155 ms 848 KB Output is correct (P=0.011546, F=94.9, Q=94.7) -> 90.00 points
4 Correct 366 ms 1188 KB Output is correct (P=0.028545, F=191.5, Q=193.6) -> 86.22 points
5 Correct 442 ms 1260 KB Output is correct (P=0.039856, F=246.3, Q=258.9) -> 74.71 points
6 Correct 760 ms 1408 KB Output is correct (P=0.068648, F=366.2, Q=396.3) -> 67.73 points
7 Correct 1036 ms 1972 KB Output is correct (P=0.104571, F=490.3, Q=509.8) -> 77.65 points
8 Correct 1367 ms 1500 KB Output is correct (P=0.158765, F=639.1, Q=688.3) -> 68.81 points
9 Correct 1480 ms 1836 KB Output is correct (P=0.2, F=731.4, Q=771.4) -> 73.85 points