oj.uz

Submission #947119

# Submission time Handle Problem Language Result Execution time Memory
947119 2024-03-15T14:08:33 Z steveonalex Combo (IOI18_combo) C++14
100 / 100
 17 ms 2088 KB 
#include <bits/stdc++.h>
#include "combo.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
// namespace Interactor{
//     int n;
//     string a;
//     int query_cnt;
//     int press(string p){
//         query_cnt++;
//         int ans = 0;
//         for(int i= 0; i<p.size(); ++i){
//             int cnt = 0;
//             for(int j = 0; i + j < p.size() && j < a.size(); ++j){
//                 if (p[i+j] == a[j])cnt++;
//                 else break;
//                 maximize(ans, cnt);
//             }
//         }
//         cout << "? " << p << "\n";
//         cout << "-> " << ans << "\n";
//         return ans;
//     }
 
    char pool[] = {'A', 'B', 'X', 'Y'};
    string guess_sequence(int n){
        int l = 0, r = 3;
        while(l < r){
            int mid = (l + r) >> 1;
            string p;
            for(int i = 0; i<=mid; ++i) p.push_back(pool[i]);
            if (press(p) >= 1) r = mid;
            else l = mid + 1;
        }
        string ans = string(1, pool[l]);
        vector<int> hot;
        for(int i= 0; i<4; ++i) if (i != l) hot.push_back(i);
        for(int i = 2; i<n; ++i){
            string a = ans + string(1, pool[hot[0]]);
            string b = ans + string(1, pool[hot[1]]);
            string p = a;
            for(int j: hot) p += b + string(1, pool[j]);
 
            int verdict = press(p);
            if (verdict == i-1){
                ans += string(1, pool[hot[2]]);
            }
            else if (verdict == i) {
                ans += string(1, pool[hot[0]]);
            }
            else ans += string(1, pool[hot[1]]);
        }
        if (ans.size() < n){
            for(int i:hot){
                if (i != hot.back()) {
                    if (press(ans + string(1, pool[i])) == n){
                        ans.push_back(pool[i]);
                        break;
                    }
                }
                else ans.push_back(pool[i]);
            }
        }
        return ans;
    }
 
//     bool solve(int _n, string _a){
//         query_cnt = 0;
//         n = _n; a = _a;
//         string b = guess_sequence(n);
//         cout << "! " << b << "\n";
//         return a == b;
//     }
// }
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     int n; cin >> n;
//     string a; cin >> a;
 
//     bool verdict = Interactor::solve(n, a);
//     if (verdict) cout << "AC\n";
//     else cout << "WA\n";
 
//     return 0;
// }

Compilation message

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

Subtask #1
5.0 / 5.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 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 592 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 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 0 ms 600 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 1 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 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 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 0 ms 344 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 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 540 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 1 ms 344 KB Output is correct
14 Correct 0 ms 504 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 11 ms 1724 KB Output is correct
18 Correct 12 ms 1464 KB Output is correct
19 Correct 12 ms 1280 KB Output is correct
20 Correct 11 ms 1480 KB Output is correct
21 Correct 12 ms 1304 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 440 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 444 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 700 KB Output is correct
29 Correct 1 ms 700 KB Output is correct
30 Correct 2 ms 704 KB Output is correct
31 Correct 1 ms 948 KB Output is correct
32 Correct 11 ms 1528 KB Output is correct
33 Correct 11 ms 2016 KB Output is correct
34 Correct 14 ms 1800 KB Output is correct
35 Correct 11 ms 1492 KB Output is correct
36 Correct 11 ms 1452 KB Output is correct
37 Correct 12 ms 1908 KB Output is correct
38 Correct 11 ms 1340 KB Output is correct
39 Correct 13 ms 1644 KB Output is correct
40 Correct 12 ms 1828 KB Output is correct
41 Correct 11 ms 1572 KB Output is correct
42 Correct 13 ms 1516 KB Output is correct
43 Correct 12 ms 1820 KB Output is correct
44 Correct 12 ms 1416 KB Output is correct
45 Correct 15 ms 1460 KB Output is correct
46 Correct 12 ms 1436 KB Output is correct
47 Correct 13 ms 1588 KB Output is correct
48 Correct 17 ms 2088 KB Output is correct
49 Correct 14 ms 1488 KB Output is correct
50 Correct 11 ms 1296 KB Output is correct
51 Correct 10 ms 1276 KB Output is correct
52 Correct 12 ms 1668 KB Output is correct
53 Correct 11 ms 1784 KB Output is correct
54 Correct 13 ms 1516 KB Output is correct
55 Correct 11 ms 1276 KB Output is correct
56 Correct 10 ms 1508 KB Output is correct
57 Correct 11 ms 1228 KB Output is correct
58 Correct 12 ms 1632 KB Output is correct
59 Correct 14 ms 1816 KB Output is correct
60 Correct 11 ms 1332 KB Output is correct
61 Correct 12 ms 1464 KB Output is correct
62 Correct 11 ms 1268 KB Output is correct
63 Correct 11 ms 1468 KB Output is correct
64 Correct 13 ms 1888 KB Output is correct
65 Correct 14 ms 1448 KB Output is correct
66 Correct 13 ms 1808 KB Output is correct
67 Correct 12 ms 1400 KB Output is correct
68 Correct 13 ms 1788 KB Output is correct
69 Correct 11 ms 1488 KB Output is correct
70 Correct 11 ms 1412 KB Output is correct
71 Correct 12 ms 1796 KB Output is correct
72 Correct 13 ms 1752 KB Output is correct
73 Correct 12 ms 1728 KB Output is correct
74 Correct 11 ms 1460 KB Output is correct
75 Correct 12 ms 1420 KB Output is correct
76 Correct 12 ms 1516 KB Output is correct
77 Correct 11 ms 1320 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 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 1 ms 440 KB Output is correct
84 Correct 1 ms 448 KB Output is correct
85 Correct 0 ms 436 KB Output is correct
86 Correct 0 ms 436 KB Output is correct
87 Correct 1 ms 444 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 440 KB Output is correct
94 Correct 0 ms 436 KB Output is correct
95 Correct 1 ms 436 KB Output is correct
96 Correct 0 ms 436 KB Output is correct
97 Correct 1 ms 436 KB Output is correct
98 Correct 1 ms 444 KB Output is correct
99 Correct 1 ms 444 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 1 ms 444 KB Output is correct
102 Correct 0 ms 444 KB Output is correct
103 Correct 0 ms 440 KB Output is correct
104 Correct 1 ms 436 KB Output is correct
105 Correct 1 ms 440 KB Output is correct
106 Correct 0 ms 440 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 1 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 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 0 ms 692 KB Output is correct
120 Correct 1 ms 444 KB Output is correct
121 Correct 0 ms 444 KB Output is correct
122 Correct 0 ms 440 KB Output is correct
123 Correct 1 ms 436 KB Output is correct