| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 212227 | MarcoMeijer | Combo (IOI18_combo) | C++14 | 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 <bits/stdc++.h>
using namespace std;
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
string guess_sequence(int N) {
string knows;
if(press("AB")) {
if(press("A")) knows="A";
else knows="B";
} else {
if(press("X")) knows="X";
else knows="Y";
}
string t[3]; int m=0;
if(knows != "A") t[m++]="A";
if(knows != "B") t[m++]="B";
if(knows != "X") t[m++]="X";
if(knows != "Y") t[m++]="Y";
while(knows.size() < N-1) {
int res=press(knows+t[1]+knows+t[2]+t[0]+knows+t[2]+t[1]+knows+t[2]+t[2])-knows.size();
knows += t[res];
}
if(knows.size() == N-1) {
if(press(knows+t[0])) knows += t[0];
else if(press(knows+t[1])) knows += t[1];
else knows += t[2];
}
return knows;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
