# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576243 | teki | Combo (IOI18_combo) | C++11 | 2 ms | 252 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"
typedef long long ll;
#define pb push_back
#define MS(x,y) memset((x),(y),sizeof((x)))
const ll MN = 1000000007;
using namespace std;
char seq[] = {'A','B','X','Y'};
string guess_sequence(int n) {
string curr;
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";
}
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;
koi[ctr-1] = seq[j];
if (ctr == 1) query += curr+seq[j];
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];
}
}
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];
}
for (int i = 0; i<4; i++) {
string query = curr;
query += seq[i];
if (press(query) >= n) {
curr += seq[i];
break;
}
}
return curr;
}
//int main()
//{
// #if LOCAL_DEBUG
// fstream cin("in.txt");
// #endif
//
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
//
// string secret = "ABXYY";
// cout<<guess_sequence(secret.length());
//
// return 0;
//}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |