This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#include "combo.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
string guess_sequence(int n){
char fst;
if(press("AB") >= 1){
if(press("A")==1)fst='A';
else fst = 'B';
}else{
if(press("X")==1)fst='X';
else fst = 'Y';
}
string s;
for(char j:{'A','B','X','Y'}){
if(j != fst)s+=j;
}
string res;
res+=fst;
for(int i=1;4*i+7<=4*n;i++){
string p=res+s[0]+s[0]+res+s[0]+s[1]+res+s[0]+s[2]+res+s[1];
int now = press(p);
if(now == i+2)res+=s[0];
else if(now == i+1)res+=s[1];
else res+=s[2];
}
if((int)(res.length()) == n-1){
if(press(res+"A"+res+"B") == n){
if(press(res+"A")==n)res+="A";
else res+="B";
}else{
if(press(res+"X")==n)res+="X";
else res+= "Y";
}
}
//cout<<res<<'\n';
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |