# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477059 | Genius3435 | Combo (IOI18_combo) | C++17 | 1 ms | 200 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 "combo.h"
#include <algorithm>
#include <chrono>
#include <random>
#include <string>
#include <ctime>
using namespace std::string_literals;
const int t = std::chrono::high_resolution_clock::now().time_since_epoch().count();
inline int gen(int i) {
static std::mt19937 rng = std::mt19937(t%10000/10);
return rng() % i;
}
std::string guess_sequence(int N) {
std::string cur;
for (const char c: "ABXY") {
if (press(cur = c)) break;
}
std::string poss = "ABXY"; poss.erase(poss.find(cur[0]), 1);
const char A = poss[0], B = poss[1], X = poss[2];
printf("A=%c;B=%c;X=%c\n",A,B,X);
while ((int) cur.size()+2 <= N) {
// Let s = cur, A,B,X = poss
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |