| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1052192 | khanhtb | Combo (IOI18_combo) | C++14 | 1 ms | 344 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 "combo.h"
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define vii vector<vi>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define fi first
#define se second
using namespace std;
const ll mod = 1e9+7;
const ll inf = 2e18;
const ll B = 320;
const ll N = 1e5+8;
string ans = "";
vector<char> bt = {'A','B','X','Y'};
string guess_sequence(int N){
int fid = 0;
if(press("AB")){
if(press("A")) fid = 0;
else fid = 1;
}
else{
if(press("X")) fid = 2;
else fid = 3;
}
ans += bt[fid];
int x = -1, y = -1, z = -1;
for(int i = 0; i < 4; i++){
if(i == fid) continue;
if(x == -1) x = i;
else if(y == -1) y = i;
else z = i;
}
for(int i = 2; i < N; i++){
string query = (ans + bt[x]) + (ans + bt[y] + bt[x]) + (ans + bt[y] + bt[y]) + (ans + bt[y] + bt[z]);
int rep = press(query);
if(rep == ans.size()+1) ans += bt[x];
else if(rep == ans.size()+2) ans += bt[y];
else ans += bt[z];
}
string query1 = ans + bt[x], query2 = ans + bt[y];
if (press(query1) == N) return query1;
if (press(query2) == N) return query2;
return ans + bt[z];
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
