oj.uz

Submission #726936

# Submission time Handle Problem Language Result Execution time Memory
726936 2023-04-19T15:39:01 Z Nelt Combo (IOI18_combo) C++17
100 / 100
 34 ms 520 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "combo.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

str guess_sequence(int n)
{
    
    str p;
    str dx = "AXYB";
    if (press("AB"))
    {
        if (press("A"))
          dx = "XYB", p += 'A';
        else
          dx = "AXY", p += 'B';
    }
    else
    {
      if (press("X"))
        dx = "AYB", p += 'X';
      else
        dx = "AXB", p += 'Y';
    }
    if (n == 1)
        return p;
    str q;
    ll ans;
    for (ll i = 1; i < n - 1; i++)
    {
        q = "";
        for (ll i = 0; i < 3; i++)
            q += p, q += dx[0], q += dx[i];
        q += p;
        q += dx[1];
        ans = press(q);
        if (ans == i)
            p.pb(dx[2]);
        elif (ans == i + 1)
            p.pb(dx[1]);
        else
            p.pb(dx[0]);
    }
    if (n > 1)
    for (ll i = 0; i < 2; i++)
    {
        p.pb(dx[i]);
        if (press(p) == n)
            break;
        p.pop_back();
    }
    if (p.size() == n - 1)
        p.pb(dx.back());
    return p;
}

Compilation message

combo.cpp: In function 'str guess_sequence(int)':
combo.cpp:92:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   92 |     if (p.size() == n - 1)
      |         ~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 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 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 236 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 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 0 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 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 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory 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 1 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 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 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 1 ms 208 KB Output is correct
17 Correct 25 ms 348 KB Output is correct
18 Correct 32 ms 396 KB Output is correct
19 Correct 26 ms 484 KB Output is correct
20 Correct 20 ms 476 KB Output is correct
21 Correct 28 ms 352 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 356 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 2 ms 208 KB Output is correct
32 Correct 30 ms 444 KB Output is correct
33 Correct 19 ms 424 KB Output is correct
34 Correct 28 ms 448 KB Output is correct
35 Correct 26 ms 452 KB Output is correct
36 Correct 27 ms 448 KB Output is correct
37 Correct 24 ms 348 KB Output is correct
38 Correct 28 ms 448 KB Output is correct
39 Correct 23 ms 448 KB Output is correct
40 Correct 19 ms 460 KB Output is correct
41 Correct 28 ms 360 KB Output is correct
42 Correct 13 ms 352 KB Output is correct
43 Correct 21 ms 352 KB Output is correct
44 Correct 25 ms 508 KB Output is correct
45 Correct 15 ms 352 KB Output is correct
46 Correct 25 ms 348 KB Output is correct
47 Correct 32 ms 452 KB Output is correct
48 Correct 18 ms 352 KB Output is correct
49 Correct 15 ms 352 KB Output is correct
50 Correct 25 ms 456 KB Output is correct
51 Correct 32 ms 392 KB Output is correct
52 Correct 27 ms 468 KB Output is correct
53 Correct 20 ms 364 KB Output is correct
54 Correct 19 ms 360 KB Output is correct
55 Correct 28 ms 360 KB Output is correct
56 Correct 31 ms 352 KB Output is correct
57 Correct 25 ms 348 KB Output is correct
58 Correct 19 ms 416 KB Output is correct
59 Correct 24 ms 396 KB Output is correct
60 Correct 21 ms 348 KB Output is correct
61 Correct 29 ms 416 KB Output is correct
62 Correct 32 ms 428 KB Output is correct
63 Correct 26 ms 356 KB Output is correct
64 Correct 23 ms 436 KB Output is correct
65 Correct 19 ms 396 KB Output is correct
66 Correct 25 ms 508 KB Output is correct
67 Correct 24 ms 488 KB Output is correct
68 Correct 20 ms 352 KB Output is correct
69 Correct 23 ms 460 KB Output is correct
70 Correct 17 ms 356 KB Output is correct
71 Correct 16 ms 356 KB Output is correct
72 Correct 34 ms 424 KB Output is correct
73 Correct 25 ms 392 KB Output is correct
74 Correct 26 ms 472 KB Output is correct
75 Correct 28 ms 492 KB Output is correct
76 Correct 31 ms 520 KB Output is correct
77 Correct 24 ms 508 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 216 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 2 ms 328 KB Output is correct
99 Correct 1 ms 300 KB Output is correct
100 Correct 2 ms 208 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 0 ms 208 KB Output is correct
110 Correct 1 ms 208 KB Output is correct
111 Correct 0 ms 208 KB Output is correct
112 Correct 1 ms 208 KB Output is correct
113 Correct 0 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 304 KB Output is correct
123 Correct 1 ms 208 KB Output is correct