#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n, LOG;
double p;
int block;
vector<bool> ans;
bool ask(int l, int r){
cout<<"Q ";
string s(n,'0');
FOR(i,l,r+1)
s[i]='1';
cout<<s;
cout<<endl;
char ans;
cin>>ans;
return ans=='P';
}
int f(int L, int R){
int l=L, r=R;
int res=l;
// while(l<=r){
// int m=(l+r)/2;
// bool b=ask(l,m);
// if(b){
// res=m;
// r=m-1;
// }
// else{
// l=m+1;
// }
// }
res=0;
F0Rd(k,LOG+1){
if(L+res+(1<<k)>R)
continue;
dbg(k, L+res+(1<<k))
bool b=ask(L, L+res+(1<<k)-1);
if(!b)
res+=1<<k;
}
return L+res;
}
void solve(){
int i=0;
while(i<n){
bool b=ask(i,min(n-1,i+block-1));
if(!b)
i+=block;
else{
int j=f(i,min(n-1,i+block-1));
ans[j]=1;
i=j+1;
}
}
cout<<"A ";
F0R(i,n)
cout<<ans[i];
cout<<endl;
char c;
cin>>c;
}
int32_t main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int TC = 1;
// cin >> TC;
cin>>n>>p>>TC;
block=1;
double tmp=p;
while(tmp+p<=0.5){
block++;
tmp+=p;
}
LOG=block?__builtin_clz(1)-__builtin_clz(block):-1;
ans.resize(n);
while(TC--){
ans.assign(n,0);
solve();
}
return 0;
}
Compilation message
Main.cpp: In function 'int first(int, int)':
Main.cpp:52:14: warning: unused variable 'r' [-Wunused-variable]
52 | int l=L, r=R;
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
336 KB |
Output is correct |
2 |
Correct |
7 ms |
508 KB |
Output is correct |
3 |
Correct |
7 ms |
336 KB |
Output is correct |
4 |
Correct |
9 ms |
336 KB |
Output is correct |
5 |
Correct |
6 ms |
336 KB |
Output is correct |
6 |
Correct |
10 ms |
336 KB |
Output is correct |
7 |
Correct |
7 ms |
336 KB |
Output is correct |
8 |
Correct |
7 ms |
336 KB |
Output is correct |
9 |
Correct |
8 ms |
336 KB |
Output is correct |
10 |
Correct |
5 ms |
336 KB |
Output is correct |
11 |
Correct |
7 ms |
336 KB |
Output is correct |
12 |
Correct |
7 ms |
336 KB |
Output is correct |
13 |
Correct |
8 ms |
336 KB |
Output is correct |
14 |
Correct |
7 ms |
336 KB |
Output is correct |
15 |
Correct |
8 ms |
336 KB |
Output is correct |
16 |
Correct |
8 ms |
336 KB |
Output is correct |
17 |
Execution timed out |
7062 ms |
336 KB |
Time limit exceeded |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
336 KB |
Output is correct (P=0.001, F=15.1, Q=11.3) -> 90.00 points |
2 |
Correct |
122 ms |
336 KB |
Output is correct (P=0.005256, F=51.1, Q=47.9) -> 90.00 points |
3 |
Correct |
237 ms |
336 KB |
Output is correct (P=0.011546, F=94.9, Q=94.9) -> 90.00 points |
4 |
Correct |
538 ms |
336 KB |
Output is correct (P=0.028545, F=191.5, Q=210.6) -> 64.33 points |
5 |
Correct |
697 ms |
336 KB |
Output is correct (P=0.039856, F=246.3, Q=252.8) -> 81.41 points |
6 |
Correct |
962 ms |
336 KB |
Output is correct (P=0.068648, F=366.2, Q=375.0) -> 82.11 points |
7 |
Correct |
1287 ms |
336 KB |
Output is correct (P=0.104571, F=490.3, Q=503.0) -> 81.55 points |
8 |
Correct |
1626 ms |
336 KB |
Output is correct (P=0.158765, F=639.1, Q=663.6) -> 78.03 points |
9 |
Correct |
1999 ms |
336 KB |
Output is correct (P=0.2, F=731.4, Q=756.3) -> 79.21 points |