# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162495 | abacaba | 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 <iostream>
#include <string>
#include <unordered_map>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <assert.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
#include "combo.h"
using namespace std;
string seq[4] = {"A", "B", "X", "Y"};
int n, let1 = 3;
string guess_sequence(int N) {
srand(time(NULL));
vector <pair <string, int> > cur_seq = {{"A", 0}, {"B", 1}, {"X", 2}, {"Y", 3}};
random_shuffle(cur_seq.begin(), cur_seq.end());
let1 = cur_seq[3].se;
for(int i = 0; i < 3; ++i)
if(press(cur_seq[i].f)) {
let1 = cur_seq[i].se;
break;
}
string s = seq[let1];
swap(seq[3], seq[let1]);
if(N == 1)
return s;
for(int i = 2; i < N; ++i) {
string now = s + seq[0];
for(int j = 0; j < 3; ++j)
now += s + seq[1] + seq[j];
int p = press(now);
if(p == s.size())
s += seq[2];
else if(p == s.size() + 1)
s += seq[0];
else
s += seq[1];
}
vector <string> cur = {seq[0], seq[1], seq[2]};
random_shuffle(cur.begin(), cur.end());
for(int i = 0; i < 2; ++i)
if(press(s + cur[i]) == N)
return s + cur[i];
return s + cur[2];
}