# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960982 | 2024-04-11T10:31:34 Z | aminjon__ | Combo (IOI18_combo) | C++17 | 1 ms | 344 KB |
#include<bits/stdc++.h> using namespace std; deque<char> button = {'A' , 'B', 'X' , 'Y'}; int press(string s); // string c; // int N; // int G = 0; // int press(string a){ // G++; // int rrv = 0; // for(int i = 0;i < a.size();i++){ // int cnt = 0; // for(int j = i;j < a.size() && (j-i) < c.size();j++){ // if(a[j] == c[j-i]){ // cnt++; // rrv=max(rrv , cnt); // } // else{ // break; // } // } // } // return rrv; // } string guess_sequence(int N){ string ans; if(press("AB") > 0){ if(press("A") > 0){ ans = "A"; button.erase(button.begin()); } else{ ans = "B"; button.erase(button.begin()+1); } } else{ if(press("X") > 0){ ans = "X"; button.erase(button.begin()+2); } else{ ans = "Y"; button.erase(button.begin()+3); } } for(int i = 2;i <= N-1;i++){ int r = press(ans+button[1] + ans+button[2]+button[0]+ans+button[2]+button[1]+ans+button[2]+button[2] ); ans += button[r - ans.size()]; } if(press(ans+button[0]+ans+button[1]) > ans.size()){ if(press(ans+button[0]) > ans.size()){ ans += button[0]; } else{ ans += button[1]; } } else{ ans += button[2]; } return ans; } // int main(){ // cin >> N >> c; // // cout<<guess_sequence(N)<<'\n'; // cout<<G; // return 0; // }
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 | 1 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 344 KB | Output is correct |
7 | Correct | 1 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 | 1 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 | 1 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 | 0 ms | 344 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 0 ms | 344 KB | Output is correct |
20 | Correct | 0 ms | 344 KB | Output is correct |
21 | Correct | 1 ms | 344 KB | Output is correct |
22 | Correct | 1 ms | 344 KB | Output is correct |
23 | Correct | 0 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 | 0 ms | 344 KB | Output is correct |
27 | Correct | 0 ms | 344 KB | Output is correct |
28 | Correct | 0 ms | 344 KB | Output is correct |
29 | Correct | 1 ms | 344 KB | Output is correct |
30 | Correct | 0 ms | 344 KB | Output is correct |
31 | Correct | 0 ms | 344 KB | Output is correct |
32 | Correct | 1 ms | 344 KB | Output is correct |
33 | Correct | 0 ms | 340 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: wrong guess. |
2 | Halted | 0 ms | 0 KB | - |