제출 #292109

#제출 시각아이디문제언어결과실행 시간메모리
292109CSQ31콤보 (IOI18_combo)C++17
0 / 100
1 ms204 KiB
#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;i+2<=n;i+=2){ string p = res+s[0]+s[1]+res+s[0]+s[2]+res+s[1]; int now = press(p); if(now == i+2){ if(press(res+s[0]+s[1]) == 2)res+=s[0]+s[1]; else res+=s[0]+s[2]; }else if(now == i+1){ if(press(res+s[1]+s[0]) == 2)res+=s[1]+s[0]; else res+=s[1]+s[2]; }else{ if(press(res+s[2]+s[0]) == 2)res+=s[2]+s[0]; else res+=s[2]+s[1]; } } if((int)(res.length()) != n){ if(press("AB") >= 1){ if(press("A")==1)res+="A"; else res+="B"; }else{ if(press("X")==1)res+="X"; else res+= "Y"; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...