# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420803 | bipartite_matching | Combo (IOI18_combo) | C++14 | 113 ms | 324 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>
#define forint(i, N) for (int i = 0; i < (N); i++)
using namespace std;
int press(string p);
string test = "ABBBXXYX";
string guess_sequence(int N) {
string ans = "";
if (press("A") == 1) {
ans += 'A';
}
if (press("B") == 1) {
ans += 'B';
}
if (press("X") == 1) {
ans += 'X';
}
if (press("Y") == 1) {
ans += 'Y';
}
//int pos = 1;
for (int i = 1; i < N; i++) {
if (ans[0] != 'A') {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |