#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=min(9,mx);
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')assert(false);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
52 ms |
8016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
