# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071725 | Rigobertus | Combo (IOI18_combo) | C++17 | 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 <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
//#define int long long
#include "combo.h"
using namespace std;
string guess_sequence(int n) {
string c[4] = {"A", "B", "X", "Y"};
string s = "";
set<int> vis;
for (int i = 0; i < 4; i++) {
vis.insert(i);
}
int j;
for (int i = 0; i < 4; i++) {
if (press(c[i]) || vis.size() == 1) {
s = c[i];
j = i;
vis.erase(i);
break;
}
else {
vis.erase(i);
}
}
for (int i = 0; i < 4; i++) {
vis.insert(i);
}
vis.erase(j);
while (s.size() < n) {
int last = *s.end();
for (int i = 0; i < 4; i++) {
if (i == j) {
continue;
}
if (!vis.count(i)) {
vis.insert(i);
continue;
}
if (i == last) {
s += c[i];
break;
}
string p = s + c[i] + c[i];
if (press(p) == p.size()) {
s = p;
break;
}
else if (press(p) == p.size() - 1) {
s += c[i];
vis.erase(i);
break;
}
}
}
return s;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |