# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712785 | Marslai24 | Combo (IOI18_combo) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
//#define int long long // a.k.a. TLE creator
#define all(x) x.begin(), x.end()
template<class A, class B> istream& operator >>(istream &o, pair<A, B> &x){return o >> x.first >> x.second;}
template<class A, class B> ostream& operator <<(ostream &o, pair<A, B> &x){return o << x.first << ' ' << x.second << ' ';}
void setIO(){ios::sync_with_stdio(false); cin.tie(0);}
const int INF = 2e18, MOD = 998244353, N = 1e6 + 1, K = __lg(N) + 2;
string guess_sequence(int n){
string chr[4]{"A", "B", "C", "D"};
string ans;
if(press(chr[0] + chr[1]) == 1){
if(press(chr[1]) == 1)
swap(chr[0], chr[1]);
}else{
if(press(chr[2]) == 1)
swap(chr[0], chr[2]);
else swap(chr[0], chr[3]);
}
ans += chr[0];
for(int len = 1; len < n; len++){
int cur = press(ans + chr[1] + ans + chr[2] + chr[1] + ans + chr[2] + chr[2] + ans + chr[2] + chr[3]);
if(cur == ans.size() + 1)ans += chr[1];
else if(cur == ans.size() + 2)ans += chr[2];
else ans += chr[3];
}
return ans;
}