| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 259075 | knightron0 | Combo (IOI18_combo) | C++14 | 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>
#include <string>
#include <iostream>
#include "combo.h"
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printarray(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
string guess_sequence(int N){
string options[4] = {"A", "B", "X", "Y"};
string starting = "";
string curr = "";
for(int i= 0;i<4;i++){
if(press(options[i]) == 1){
starting = options[i];
break;
}
}
curr += starting;
for(int i = 2;i<=N;i++){
for(int j = 0;j<4;j++){
if(options[j] == starting) continue;
if(press(curr + options[j]) == i){
curr += options[j];
break;
}
}
}
return curr;
}