oj.uz

Submission #957004

# Submission time Handle Problem Language Result Execution time Memory
957004 2024-04-02T19:19:58 Z mostafa133 Combo (IOI18_combo) C++14
100 / 100
 17 ms 1800 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "combo.h"
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) x.begin(), x.end()
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const ll mod = 998244353;
std::string guess_sequence(int N)
{
    string x = "ABXY";
    vector<string> y(4);
    char z;
    string ans;
    ll b = press("AB");
    if (b)
    {
        if (press("A"))
        {
            ans.push_back('A');
            // y = "BXBXXXY";
            y[0] = "B", y[1] = "XB", y[2] = "XX", y[3] = "XY";
            z = 'Y';
        }
        else
        {
            ans.push_back('B');
            ;y[0] = "A", y[1] = "XA", y[2] = "XX", y[3] = "XY";
            z = 'Y';
        }
    }
    else
    {
        if (press("X"))
        {
            ans.push_back('X');
            // y = "ABABYBB";
            y[0] = "A", y[1] = "BA", y[2] = "BB", y[3] = "BY";
            z = 'Y';
        }
        else
        {
            ans.push_back('Y');
            // y = "ABABXBB";
            y[0] = "A", y[1] = "BA", y[2] = "BB", y[3] = "BX";
            z = 'X';
        }
    }
    // cout << ans << ' ';
    for (int i = 1; i < N - 1; i++)
    {
        ll m = ans.size();
        b = press(ans + y[0] + ans + y[1] + ans + y[2] + ans + y[3]);
        // std::cout << b;
        if (b == m + 1)
        {
            ans.push_back(y[0][0]);
        }
        else if (b == m + 2)
        {
            ans.push_back(y[1][0]);
        }
        else
        {
            ans.push_back(z);
        }
    }
    if(N==1)
    {
        return ans;
    }
    if (press(ans + 'A' + ans + 'B') != ans.size())
    {
        if (press(ans + 'A') != ans.size())
        {
            ans.push_back('A');
        }
        else
        {
            ans.push_back('B');
        }
    }
    else
    {
        if (press(ans + 'X') != ans.size())
        {
            ans.push_back('X');
        }
        else
        {
            ans.push_back('Y');
        }
    }
    // cout << ans<<' ';
    return ans;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:76:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     if (press(ans + 'A' + ans + 'B') != ans.size())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
combo.cpp:78:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         if (press(ans + 'A') != ans.size())
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
combo.cpp:89:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         if (press(ans + 'X') != ans.size())
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 1 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 1 ms 344 KB Output is correct
13 Correct 1 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 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 500 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 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 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 1 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 1 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 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 1 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 12 ms 1392 KB Output is correct
18 Correct 12 ms 1160 KB Output is correct
19 Correct 12 ms 1424 KB Output is correct
20 Correct 13 ms 1720 KB Output is correct
21 Correct 14 ms 1552 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 440 KB Output is correct
24 Correct 1 ms 432 KB Output is correct
25 Correct 0 ms 444 KB Output is correct
26 Correct 1 ms 700 KB Output is correct
27 Correct 1 ms 696 KB Output is correct
28 Correct 1 ms 444 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 444 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 13 ms 1480 KB Output is correct
33 Correct 12 ms 1600 KB Output is correct
34 Correct 12 ms 1384 KB Output is correct
35 Correct 13 ms 1464 KB Output is correct
36 Correct 13 ms 1800 KB Output is correct
37 Correct 14 ms 1616 KB Output is correct
38 Correct 17 ms 1636 KB Output is correct
39 Correct 16 ms 1616 KB Output is correct
40 Correct 15 ms 1404 KB Output is correct
41 Correct 17 ms 1272 KB Output is correct
42 Correct 17 ms 1684 KB Output is correct
43 Correct 16 ms 1476 KB Output is correct
44 Correct 15 ms 1756 KB Output is correct
45 Correct 14 ms 1460 KB Output is correct
46 Correct 14 ms 1700 KB Output is correct
47 Correct 14 ms 1164 KB Output is correct
48 Correct 15 ms 1220 KB Output is correct
49 Correct 14 ms 1172 KB Output is correct
50 Correct 15 ms 1368 KB Output is correct
51 Correct 14 ms 1236 KB Output is correct
52 Correct 14 ms 1148 KB Output is correct
53 Correct 12 ms 1740 KB Output is correct
54 Correct 13 ms 1440 KB Output is correct
55 Correct 11 ms 1124 KB Output is correct
56 Correct 12 ms 1224 KB Output is correct
57 Correct 13 ms 1400 KB Output is correct
58 Correct 13 ms 1624 KB Output is correct
59 Correct 13 ms 1376 KB Output is correct
60 Correct 12 ms 1420 KB Output is correct
61 Correct 13 ms 1612 KB Output is correct
62 Correct 11 ms 1156 KB Output is correct
63 Correct 13 ms 1460 KB Output is correct
64 Correct 14 ms 1656 KB Output is correct
65 Correct 14 ms 1276 KB Output is correct
66 Correct 12 ms 976 KB Output is correct
67 Correct 12 ms 1244 KB Output is correct
68 Correct 11 ms 1468 KB Output is correct
69 Correct 12 ms 1376 KB Output is correct
70 Correct 12 ms 1192 KB Output is correct
71 Correct 11 ms 960 KB Output is correct
72 Correct 11 ms 1304 KB Output is correct
73 Correct 13 ms 1356 KB Output is correct
74 Correct 10 ms 1732 KB Output is correct
75 Correct 13 ms 1500 KB Output is correct
76 Correct 17 ms 1360 KB Output is correct
77 Correct 11 ms 1196 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 0 ms 344 KB Output is correct
83 Correct 1 ms 440 KB Output is correct
84 Correct 1 ms 436 KB Output is correct
85 Correct 0 ms 432 KB Output is correct
86 Correct 1 ms 644 KB Output is correct
87 Correct 0 ms 432 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 596 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 1 ms 436 KB Output is correct
94 Correct 0 ms 436 KB Output is correct
95 Correct 1 ms 440 KB Output is correct
96 Correct 0 ms 436 KB Output is correct
97 Correct 1 ms 440 KB Output is correct
98 Correct 1 ms 692 KB Output is correct
99 Correct 1 ms 432 KB Output is correct
100 Correct 0 ms 436 KB Output is correct
101 Correct 1 ms 432 KB Output is correct
102 Correct 1 ms 432 KB Output is correct
103 Correct 0 ms 436 KB Output is correct
104 Correct 1 ms 436 KB Output is correct
105 Correct 1 ms 600 KB Output is correct
106 Correct 0 ms 436 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 1 ms 344 KB Output is correct
110 Correct 0 ms 500 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 1 ms 344 KB Output is correct
113 Correct 1 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 432 KB Output is correct
118 Correct 0 ms 436 KB Output is correct
119 Correct 1 ms 436 KB Output is correct
120 Correct 1 ms 436 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 0 ms 440 KB Output is correct
123 Correct 1 ms 432 KB Output is correct