| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 152374 | nicolaalexandra | 콤보 (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.
string guess_sequence (int n){
string s("");
string v("");
/// mai intai trb sa aflu primul caracter
string c("ABXY");
int first;
v += "AB";
if (press(v) == 0){ /// stiu clar ca e X sau Y
v.clear(); v = "X";
if (press(v)){ /// stiu sigur ca e X
s += "X";
first = 2;
} else {
s += "Y";
first = 3;
}
} else {
v.clear(); v = "A";
if (press(v)){
s += "A";
first = 0;
} else {
s += "B";
first = 2;
}}
if (n == 1)
return s;
/// acum determin cele 3 caractere pe care le mai am de pus
int ch1=0,ch2=0,ch3=0;
for (int j=0,pas=0;j<4;j++){
if (j == first)
continue;
pas++;
if (pas == 1) ch1 = j;
if (pas == 2) ch2 = j;
if (pas == 3) ch3 = j;
}
for (int i=1;i<n-1;i++){
v.clear();
v += s, v += c[ch1];
v += s, v += c[ch2], v += c[ch1];
v += s, v += c[ch2], v += c[ch2];
v += s, v += c[ch2], v += c[ch3];
int val = press (v);
if (val == i){
s += c[ch3];
continue;
}
if (val == i+1)
s += c[ch1];
else s += c[ch2];
}
/// trb sa fac separat pt ultimul pt ca depasesc 4*n;
v.clear();
v += s, v += c[ch1];
if (press(v) == n)
s += c[ch1];
else {
v.clear();
v += s, v += c[ch2];
if (press(v) == n)
s += c[ch2];
else s += c[ch3];
}
return s;
}