# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975279 | 2024-05-04T16:48:07 Z | ShaShi | Combo (IOI18_combo) | C++17 | 1 ms | 600 KB |
#include "combo.h" #include <bits/stdc++.h> #define F first #define S second #define pii pair<int, int> #define all(x) x.begin(), x.end() #define mp make_pair #define pb push_back using namespace std; typedef long long ll; typedef long double ld; const int MAX = (int)2e3 + 7; const int MOD = 998244353; const int INF = (int)1e9 + 7; string guess_sequence(int N) { string res, s, op; res = ""; int x = press("AB"); if (x) { x = press("A"); if (x) res.pb('A'); else res.pb('B'); } else { x = press("X"); if (x) res.pb('X'); else res.pb('Y'); } s = ""; if (res[0] != 'A') s.pb('A'); if (res[0] != 'B') s.pb('B'); if (res[0] != 'X') s.pb('X'); if (res[0] != 'Y') s.pb('Y'); while (res.size() != N-1) { op.clear(); op.pb(res[0]); op.pb(s[0]); op.pb(res[0]); op.pb(s[1]); op.pb(s[0]); op.pb(res[0]); op.pb(s[1]); op.pb(s[1]); op.pb(res[0]); op.pb(s[1]); op.pb(s[2]); x = press(op); if (x == res.size()) { res.pb(s[2]); } else if (x == res.size()+1) { res.pb(s[0]); } else { res.pb(s[1]); } } res.pb(s[0]); x = press(res); if (x == N) return res; res.pop_back(); res.pb(s[1]); x = press(res); if (x == N) return res; res.pop_back(); res.pb(s[2]); return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 500 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Correct | 1 ms | 344 KB | Output is correct |
12 | Correct | 0 ms | 344 KB | Output is correct |
13 | Correct | 0 ms | 344 KB | Output is correct |
14 | Correct | 0 ms | 344 KB | Output is correct |
15 | Correct | 0 ms | 344 KB | Output is correct |
16 | Correct | 0 ms | 344 KB | Output is correct |
17 | Correct | 1 ms | 344 KB | Output is correct |
18 | Correct | 0 ms | 340 KB | Output is correct |
19 | Correct | 1 ms | 344 KB | Output is correct |
20 | Correct | 0 ms | 600 KB | Output is correct |
21 | Correct | 0 ms | 340 KB | Output is correct |
22 | Correct | 0 ms | 344 KB | Output is correct |
23 | Correct | 1 ms | 344 KB | Output is correct |
24 | Correct | 0 ms | 344 KB | Output is correct |
25 | Correct | 0 ms | 344 KB | Output is correct |
26 | Correct | 1 ms | 344 KB | Output is correct |
27 | Correct | 0 ms | 344 KB | Output is correct |
28 | Correct | 0 ms | 596 KB | Output is correct |
29 | Correct | 1 ms | 344 KB | Output is correct |
30 | Correct | 1 ms | 344 KB | Output is correct |
31 | Correct | 0 ms | 344 KB | Output is correct |
32 | Correct | 0 ms | 344 KB | Output is correct |
33 | Correct | 0 ms | 344 KB | Output is correct |
34 | Correct | 0 ms | 344 KB | Output is correct |
35 | Correct | 0 ms | 344 KB | Output is correct |
36 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong Answer: invalid press |
2 | Halted | 0 ms | 0 KB | - |