oj.uz

답안 #1042089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042089 2024-08-02T14:20:42 Z Warinchai COVID tests (CEOI24_covid) C++14
0 / 100
 7 ms 1624 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--;
    mx=min(9,mx);
    mx=max(0,mx);
    while(t--){
        //cerr<<"work"<<endl;
        mp.clear();
        int cur=-1;
        string ans=string(n,'0');
        int og=cur;
        while(cur<n-1){
            int nmx=0;
            int rmx=0;
            if(cur+freq>=n){
                while(cur+(1<<nmx)<n)nmx++;
                nmx--;
                rmx=(1<<nmx);
            }else{
                nmx=mx;
                rmx=freq;
            }
            //cout<<nmx<<endl;
            if(ask(cur+1,cur+rmx)){
                for(int i=nmx-1;i>=0;i--)if(!ask(cur+1,cur+(1<<i)))cur=cur+(1<<i);
                cur++;
                ans[cur]='1';
            }else{
                cur=cur+rmx;
                continue;
            }
        }
        //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;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:43:13: warning: unused variable 'og' [-Wunused-variable]
   43 |         int og=cur;
      |             ^~

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 Correct 5 ms 1380 KB Output is correct
2 Correct 6 ms 1432 KB Output is correct
3 Correct 5 ms 1304 KB Output is correct
4 Correct 7 ms 1432 KB Output is correct
5 Correct 5 ms 1368 KB Output is correct
6 Correct 5 ms 1368 KB Output is correct
7 Correct 5 ms 1624 KB Output is correct
8 Incorrect 4 ms 1112 KB translate:wrong
9 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 -