#include<bits/stdc++.h>
using namespace std;
int n,t;
double p;
int use=0;
int ask(vector<int>v){
//use++;
cout<<"Q ";
for(auto x:v)cout<<x;
cout<<endl;
//cerr<<"input:"<<endl;
char ans;
cin>>ans;
//cerr<<ans<<endl;
return ans=='P'?1:0;
}
vector<int>temp;
void fans(int st,int en,vector<int>&ans){
//cerr<<st<<" "<<en<<endl;
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,ans);
}
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,ans);
}
}
vector<int>ans;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>p>>t;
temp.resize(n);
ans.resize(n);
while(t--){
//cerr<<"work"<<endl;
for(auto &x:ans)x=0;
use=0;
fans(0,n-1,ans);
cout<<"A ";
for(auto x:ans)cout<<x;
cout<<endl;
char res;
cin>>res;
//cerr<<"use:"<<use<<endl;
if(res=='W')break;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
60 ms |
344 KB |
Output is correct |
2 |
Correct |
59 ms |
344 KB |
Output is correct |
3 |
Correct |
60 ms |
344 KB |
Output is correct |
4 |
Correct |
59 ms |
340 KB |
Output is correct |
5 |
Correct |
68 ms |
344 KB |
Output is correct |
6 |
Correct |
60 ms |
344 KB |
Output is correct |
7 |
Correct |
51 ms |
344 KB |
Output is correct |
8 |
Correct |
50 ms |
344 KB |
Output is correct |
9 |
Correct |
56 ms |
344 KB |
Output is correct |
10 |
Correct |
30 ms |
344 KB |
Output is correct |
11 |
Correct |
54 ms |
344 KB |
Output is correct |
12 |
Correct |
49 ms |
344 KB |
Output is correct |
13 |
Correct |
52 ms |
344 KB |
Output is correct |
14 |
Correct |
47 ms |
344 KB |
Output is correct |
15 |
Correct |
50 ms |
344 KB |
Output is correct |
16 |
Correct |
78 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
185 ms |
344 KB |
Output is correct (P=0.001, F=15.1, Q=17.7) -> 53.29 points |
2 |
Correct |
788 ms |
344 KB |
Output is correct (P=0.005256, F=51.1, Q=77.0) -> 29.73 points |
3 |
Correct |
1447 ms |
344 KB |
Output is correct (P=0.011546, F=94.9, Q=149.0) -> 27.44 points |
4 |
Correct |
2967 ms |
344 KB |
Output is correct (P=0.028545, F=191.5, Q=302.5) -> 27.12 points |
5 |
Correct |
3749 ms |
344 KB |
Output is correct (P=0.039856, F=246.3, Q=387.5) -> 27.33 points |
6 |
Correct |
5293 ms |
344 KB |
Output is correct (P=0.068648, F=366.2, Q=568.4) -> 28.05 points |
7 |
Execution timed out |
7012 ms |
344 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |