Submission #990037

# Submission time Handle Problem Language Result Execution time Memory
990037 2024-05-29T11:47:31 Z TitanicXDzz Combo (IOI18_combo) C++14
100 / 100
21 ms 1936 KB
#include "combo.h"
#include<bits/stdc++.h>
using namespace std;
std::string guess_sequence(int N) {
  std::string p = "AB";
  int coins = press(p);
  if(coins>=1){
        string s="A";
        coins=press(s);
        if(coins==1){
            if(N==1)
            return "A";
            p="A";
            for(int i=2;i<N;i++){
                s=p+"BB"+p+"BX"+p+"BY"+p+"X";
                coins=press(s);
                if(coins==i+1)
                    p+="B";
                else if(coins==i)
                    p+="X";
                else
                    p+="Y";
            }
            s=p+"B";
            coins=press(s);
            if(coins==N)
                p=s;
            else{
                s=p+"X";
                coins=press(s);
                if(coins==N)
                    p=s;
                else
                    p+="Y";
            }
        }
        else{
            if(N==1)
            return "B";
            p="B";
            for(int i=2;i<N;i++){
                s=p+"AA"+p+"AX"+p+"AY"+p+"X";
                coins=press(s);
                if(coins==i+1)
                    p+="A";
                else if(coins==i)
                    p+="X";
                else
                    p+="Y";
            }
            s=p+"A";
            coins=press(s);
            if(coins==N)
                p=s;
            else{
                s=p+"X";
                coins=press(s);
                if(coins==N)
                    p=s;
                else
                    p+="Y";
            }
        }
  }
  else{
    string s="X";
        coins=press(s);
        if(coins==1){
            if(N==1)
            return "X";
            p="X";
            for(int i=2;i<N;i++){
                s=p+"BB"+p+"BA"+p+"BY"+p+"A";
                coins=press(s);
                if(coins==i+1)
                    p+="B";
                else if(coins==i)
                    p+="A";
                else
                    p+="Y";
            }
            s=p+"B";
            coins=press(s);
            if(coins==N)
                p=s;
            else{
                s=p+"A";
                coins=press(s);
                if(coins==N)
                    p=s;
                else
                    p+="Y";
            }
        }
        else{
            p="Y";
        if(N==1)
            return "Y";
            for(int i=2;i<N;i++){
                s=p+"AA"+p+"AX"+p+"AB"+p+"X";
                coins=press(s);
                if(coins==i+1)
                    p+="A";
                else if(coins==i)
                    p+="X";
                else
                    p+="B";
            }
            s=p+"A";
            coins=press(s);
            if(coins==N)
                p=s;
            else{
                s=p+"X";
                coins=press(s);
                if(coins==N)
                    p=s;
                else
                    p+="B";
            }
        }
  }
  return p;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:97:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   97 |         if(N==1)
      |         ^~
combo.cpp:99:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   99 |             for(int i=2;i<N;i++){
      |             ^~~
# 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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 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 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 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 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 0 ms 340 KB Output is correct
30 Correct 0 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 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 0 ms 344 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 0 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 15 ms 1620 KB Output is correct
18 Correct 17 ms 684 KB Output is correct
19 Correct 15 ms 1260 KB Output is correct
20 Correct 15 ms 548 KB Output is correct
21 Correct 14 ms 608 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 452 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 14 ms 680 KB Output is correct
33 Correct 17 ms 1084 KB Output is correct
34 Correct 17 ms 788 KB Output is correct
35 Correct 16 ms 1664 KB Output is correct
36 Correct 17 ms 776 KB Output is correct
37 Correct 16 ms 732 KB Output is correct
38 Correct 17 ms 708 KB Output is correct
39 Correct 14 ms 608 KB Output is correct
40 Correct 15 ms 1332 KB Output is correct
41 Correct 15 ms 552 KB Output is correct
42 Correct 15 ms 732 KB Output is correct
43 Correct 20 ms 536 KB Output is correct
44 Correct 15 ms 604 KB Output is correct
45 Correct 21 ms 1112 KB Output is correct
46 Correct 17 ms 1028 KB Output is correct
47 Correct 17 ms 1792 KB Output is correct
48 Correct 16 ms 664 KB Output is correct
49 Correct 17 ms 1732 KB Output is correct
50 Correct 20 ms 712 KB Output is correct
51 Correct 19 ms 768 KB Output is correct
52 Correct 15 ms 548 KB Output is correct
53 Correct 15 ms 772 KB Output is correct
54 Correct 14 ms 1912 KB Output is correct
55 Correct 17 ms 608 KB Output is correct
56 Correct 16 ms 664 KB Output is correct
57 Correct 14 ms 724 KB Output is correct
58 Correct 15 ms 544 KB Output is correct
59 Correct 18 ms 876 KB Output is correct
60 Correct 16 ms 632 KB Output is correct
61 Correct 17 ms 1840 KB Output is correct
62 Correct 17 ms 548 KB Output is correct
63 Correct 17 ms 660 KB Output is correct
64 Correct 16 ms 772 KB Output is correct
65 Correct 17 ms 776 KB Output is correct
66 Correct 14 ms 1544 KB Output is correct
67 Correct 16 ms 860 KB Output is correct
68 Correct 14 ms 744 KB Output is correct
69 Correct 17 ms 1928 KB Output is correct
70 Correct 15 ms 780 KB Output is correct
71 Correct 14 ms 560 KB Output is correct
72 Correct 15 ms 696 KB Output is correct
73 Correct 17 ms 620 KB Output is correct
74 Correct 19 ms 1884 KB Output is correct
75 Correct 14 ms 720 KB Output is correct
76 Correct 16 ms 1936 KB Output is correct
77 Correct 13 ms 636 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 600 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 1 ms 504 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 0 ms 344 KB Output is correct
102 Correct 0 ms 344 KB Output is correct
103 Correct 1 ms 344 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 432 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 1 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 1 ms 344 KB Output is correct
120 Correct 1 ms 344 KB Output is correct
121 Correct 1 ms 344 KB Output is correct
122 Correct 0 ms 344 KB Output is correct
123 Correct 1 ms 344 KB Output is correct