# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581642 | teki | Combo (IOI18_combo) | C++11 | 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 "combo.h"
using namespace std;
char seq[] = {'A','B','X','Y'}; // niza so 4te mozni karakteri
string guess_sequence(int n) {
string curr;
// prvo utvrudvame prv karakter, probuvame so AB, ako dade 1, znaeme deka resnieto e ili A ili B, ako ne, ili C ili D
int ans1 = press("AB");
if (ans1 > 0) {
int ans2 = press("A");
if (ans2 > 0) curr = "A";
else curr = "B";
} else {
int ans2 = press("X");
if (ans2 > 0) curr = "X";
else curr = "Y";
}
if (n == 1) return curr; // ako ima samo eden karakter zapri tuka
for (int i = 1; i<n-1; i++) {
string query;
int ctr = 1;
char koi[3];
for (int j = 0; j<4; j++) {
if (curr[0] == seq[j]) continue; // ako karakterot sto go razgleduvame e ist so prviot, ripni go
// dodaj go karakterot sto go razgleduvame vo mozni, i vo kverito (ako e prv ili vtor), soglasno objasnuvanjeto
koi[ctr-1] = seq[j];
if (ctr == 1) query += curr+seq[j]; // za prviot razgledan karakter samo go dodavame nego
else if (ctr == 2) {
string tmp = curr+seq[j];
for (int k = 0; k<4; k++) {
if (curr[0] == seq[k]) continue;
query += tmp+seq[k]; // za vtoriot razgledan karakter go dodavame nego plus site mozni naredni
}
}
ctr++;
}
int ans = press(query);
if (ans == curr.length()) curr += koi[2];
else if (ans == curr.length()+1) curr += koi[0];
else if (ans == curr.length()+2) curr += koi[1];
// sega go znaeme sledniot karakter i moze da prodolzime
}
// posledniot karakter se utvrudva kako prviot
int ans1 = press(curr + "A" + curr + "B");
if (ans1 > n-1) {
int ans2 = press(curr + "A");
if (ans2 > n-1) curr += "A";
else curr += "B";
} else {
int ans2 = press(curr + "X");
if (ans2 > n-1) curr += "X";
else curr += "Y";
}
return curr;
}