# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
554904 | 2022-04-29T14:54:40 Z | d4xn | 콤보 (IOI18_combo) | C++17 | 1 ms | 276 KB |
#include "combo.h" #pragma GCC optimize ("Ofast") #include <bits/stdc++.h> using namespace std; #define pb push_back string guess_sequence(int N) { string p; string dict1 = "ABXY"; /* int x = press("AB"); if (x >= 1) { if (press("A")) { p.pb('A'); } else { p.pb('B'); } } else { if (press("X")) { p.pb('X'); } else { p.pb('Y'); } } */ if (press("A")) { p.pb('A'); } else if (press("B")) { p.pb('B'); } else if (press("X")) { p.pb('X'); } else { p.pb('Y'); } string dict2; for (char &c : dict1) { if (c == p[0]) continue; dict2.pb(c); } for (int i = 1; i < N-1; i++) { string s1 = p; s1.pb(dict2[0]); string s2 = p; s2.pb(dict2[1]); s2.pb(dict2[0]); string s3 = p; s3.pb(dict2[1]); s3.pb(dict2[1]); string s4 = p; s4.pb(dict2[1]); s4.pb(dict2[2]); int y = press(s1 + s2 + s3 + s4); if (y == i+1) { p.pb(dict2[0]); } else if (y == i+2) { p.pb(dict2[1]); } else { p.pb(dict2[2]); } } for (int i = 0; i < 2; i++) { char c = dict2[i]; p.pb(c); if (press(p) == N) break; p.pop_back(); } if (p.size() < N) { p.pb(dict2[2]); } return p; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 1 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Correct | 1 ms | 208 KB | Output is correct |
6 | Correct | 0 ms | 208 KB | Output is correct |
7 | Correct | 1 ms | 208 KB | Output is correct |
8 | Correct | 1 ms | 208 KB | Output is correct |
9 | Correct | 0 ms | 208 KB | Output is correct |
10 | Correct | 1 ms | 276 KB | Output is correct |
11 | Correct | 0 ms | 208 KB | Output is correct |
12 | Correct | 1 ms | 208 KB | Output is correct |
13 | Correct | 0 ms | 208 KB | Output is correct |
14 | Correct | 1 ms | 208 KB | Output is correct |
15 | Correct | 0 ms | 208 KB | Output is correct |
16 | Correct | 0 ms | 208 KB | Output is correct |
17 | Correct | 0 ms | 208 KB | Output is correct |
18 | Correct | 1 ms | 208 KB | Output is correct |
19 | Correct | 0 ms | 208 KB | Output is correct |
20 | Correct | 1 ms | 208 KB | Output is correct |
21 | Correct | 0 ms | 208 KB | Output is correct |
22 | Correct | 0 ms | 208 KB | Output is correct |
23 | Correct | 0 ms | 208 KB | Output is correct |
24 | Correct | 1 ms | 208 KB | Output is correct |
25 | Correct | 0 ms | 208 KB | Output is correct |
26 | Correct | 0 ms | 208 KB | Output is correct |
27 | Correct | 1 ms | 208 KB | Output is correct |
28 | Correct | 0 ms | 208 KB | Output is correct |
29 | Correct | 0 ms | 208 KB | Output is correct |
30 | Correct | 0 ms | 208 KB | Output is correct |
31 | Correct | 0 ms | 208 KB | Output is correct |
32 | Correct | 0 ms | 208 KB | Output is correct |
33 | Correct | 1 ms | 208 KB | Output is correct |
34 | Correct | 0 ms | 208 KB | Output is correct |
35 | Correct | 0 ms | 208 KB | Output is correct |
36 | Correct | 0 ms | 208 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer: wrong guess. |
2 | Halted | 0 ms | 0 KB | - |