oj.uz

Submission #961172

# Submission time Handle Problem Language Result Execution time Memory
961172 2024-04-11T15:38:35 Z marinaluca Combo (IOI18_combo) C++17
100 / 100
 16 ms 1976 KB 
#include <bits/stdc++.h>
/**#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
**/
using namespace std;
/**#define int long long
#define ll long long
#define all(x) begin(x), end(x)
#define XX first
#define YY second**/
/**
#define cin fin
#define cout fout

ifstream cin ("");
ofstream cout ("");
**/
deque <char> buton = {'A', 'B', 'X', 'Y'};
int press (string s);
int N;
string ans;
int cnt = 0;
//int press (string c){s
    //cnt ++;
    //int maxi = 0;
    //for (int i = 0; i < c.size(); ++ i){
        //int ct = 0;
        //for (int j = i; j < c.size() && (j - i) < ans.size(); ++ j){
           // if (c[j] == c[j - i]{
                //ct ++;
               // maxi = max (maxi, ct);
           // }
            //else
               // break;
      //  }
    //}
    //return maxi;
//}

string guess_sequence (int N){
    string v;
    if (press("AB") > 0){
        if (press("A") > 0){
            v = "A";
            buton.erase(buton.begin());
        }
        else{
            v = "B";
            buton.erase(buton.begin() + 1);
        }
    }
    else{
        if (press("X") > 0){
            v = "X";
            buton.erase(buton.begin() + 2);
        }
        else{
            v = "Y";
            buton.erase(buton.begin() + 3);
        }
    }
    if (N == 1){
        return v;
    }
    for (int i = 2; i <= N - 1; ++ i){
        int sum = press (v + buton[1] + v + buton[2]  + buton[0] + v + buton[2] + buton[1] + v + buton[2] + buton[2]);
        v += buton[sum - v.size()];
    }
    if (press (v+ buton[0] + v + buton[1]) > v.size()){
        if (press (v + buton[0]) > v.size()){
            v += buton[0];
        }
        else{
            v += buton[1];
        }
    }
    else{
        v += buton[2];
    }
    return v;
} 
/**signed main(void){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    return 0 ^ 0;
}**/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:70:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     if (press (v+ buton[0] + v + buton[1]) > v.size()){
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
combo.cpp:71:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         if (press (v + buton[0]) > v.size()){
      |             ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 1 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 0 ms 344 KB Output is correct
18 Correct 1 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 0 ms 344 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 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 1 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 0 ms 344 KB Output is correct
33 Correct 1 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

Subtask #2
95.0 / 95.0

# 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 1 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 1 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 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 11 ms 1388 KB Output is correct
18 Correct 11 ms 1604 KB Output is correct
19 Correct 11 ms 1352 KB Output is correct
20 Correct 12 ms 1000 KB Output is correct
21 Correct 12 ms 1716 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 428 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 448 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 1 ms 440 KB Output is correct
28 Correct 1 ms 444 KB Output is correct
29 Correct 1 ms 440 KB Output is correct
30 Correct 1 ms 696 KB Output is correct
31 Correct 1 ms 700 KB Output is correct
32 Correct 10 ms 1160 KB Output is correct
33 Correct 11 ms 1200 KB Output is correct
34 Correct 12 ms 1400 KB Output is correct
35 Correct 12 ms 1768 KB Output is correct
36 Correct 12 ms 1332 KB Output is correct
37 Correct 16 ms 1508 KB Output is correct
38 Correct 11 ms 1216 KB Output is correct
39 Correct 14 ms 1728 KB Output is correct
40 Correct 12 ms 1592 KB Output is correct
41 Correct 12 ms 1608 KB Output is correct
42 Correct 11 ms 1976 KB Output is correct
43 Correct 15 ms 1648 KB Output is correct
44 Correct 12 ms 1744 KB Output is correct
45 Correct 11 ms 1320 KB Output is correct
46 Correct 12 ms 1636 KB Output is correct
47 Correct 12 ms 1696 KB Output is correct
48 Correct 10 ms 736 KB Output is correct
49 Correct 13 ms 1044 KB Output is correct
50 Correct 13 ms 1532 KB Output is correct
51 Correct 13 ms 1304 KB Output is correct
52 Correct 12 ms 1728 KB Output is correct
53 Correct 13 ms 1592 KB Output is correct
54 Correct 14 ms 1336 KB Output is correct
55 Correct 15 ms 1440 KB Output is correct
56 Correct 14 ms 1232 KB Output is correct
57 Correct 13 ms 1284 KB Output is correct
58 Correct 13 ms 1208 KB Output is correct
59 Correct 11 ms 1544 KB Output is correct
60 Correct 14 ms 1392 KB Output is correct
61 Correct 12 ms 1424 KB Output is correct
62 Correct 12 ms 1628 KB Output is correct
63 Correct 12 ms 1228 KB Output is correct
64 Correct 13 ms 1100 KB Output is correct
65 Correct 13 ms 1532 KB Output is correct
66 Correct 13 ms 1224 KB Output is correct
67 Correct 13 ms 1292 KB Output is correct
68 Correct 14 ms 1348 KB Output is correct
69 Correct 14 ms 1528 KB Output is correct
70 Correct 13 ms 1424 KB Output is correct
71 Correct 12 ms 1160 KB Output is correct
72 Correct 13 ms 1460 KB Output is correct
73 Correct 11 ms 1184 KB Output is correct
74 Correct 14 ms 1336 KB Output is correct
75 Correct 10 ms 1160 KB Output is correct
76 Correct 12 ms 1540 KB Output is correct
77 Correct 11 ms 1720 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 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 0 ms 436 KB Output is correct
84 Correct 0 ms 432 KB Output is correct
85 Correct 1 ms 432 KB Output is correct
86 Correct 0 ms 440 KB Output is correct
87 Correct 0 ms 436 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 432 KB Output is correct
94 Correct 1 ms 436 KB Output is correct
95 Correct 1 ms 436 KB Output is correct
96 Correct 1 ms 436 KB Output is correct
97 Correct 1 ms 440 KB Output is correct
98 Correct 0 ms 436 KB Output is correct
99 Correct 1 ms 432 KB Output is correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 1 ms 432 KB Output is correct
102 Correct 1 ms 432 KB Output is correct
103 Correct 1 ms 436 KB Output is correct
104 Correct 0 ms 436 KB Output is correct
105 Correct 1 ms 432 KB Output is correct
106 Correct 1 ms 440 KB Output is correct
107 Correct 0 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 1 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 0 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 0 ms 440 KB Output is correct
118 Correct 1 ms 432 KB Output is correct
119 Correct 1 ms 432 KB Output is correct
120 Correct 1 ms 440 KB Output is correct
121 Correct 1 ms 440 KB Output is correct
122 Correct 1 ms 436 KB Output is correct
123 Correct 1 ms 440 KB Output is correct