Submission #799471

# Submission time Handle Problem Language Result Execution time Memory
799471 2023-07-31T14:55:29 Z Boomyday Combo (IOI18_combo) C++17
100 / 100
23 ms 492 KB
//
// Created by adavy on 2/11/2023.
//
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include "combo.h"



// ABXY
std::string guess_sequence(int N) {
    std::string cur = "";

    // get the first letter
    char FL = ' ';
    bool isAB = (press("AB") > 0);
    if (isAB){
        bool isA = (press("A") > 0);
        if (isA) FL = 'A'; else FL = 'B';
    }
    else {
        bool isX = (press("X") > 0);
        if (isX) FL = 'X'; else FL = 'Y';
    }

    vector<char> lets = {'A','B','X','Y'};
    vector<char> ml;
    trav(i, lets) {
        if (i!=FL) ml.pb(i);
    }

    cur.pb(FL);

    F0R(i, N-2){
        int cns = press(cur+ml[0]+cur+ml[1]+ml[0]+cur+ml[1]+ml[1]+cur+ml[1]+ml[2]);
        if (cns==cur.size()+2) cur.pb(ml[1]);
        else if  (cns==cur.size()+1) cur.pb(ml[0]);
        else cur.pb(ml[2]);
    }

    if (N>1){
    if (press(cur + ml[0])==N) cur += ml[0];
    else if (press(cur + ml[1])==N) cur += ml[1];
    else cur += ml[2];}
    return cur;

}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:97:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         if (cns==cur.size()+2) cur.pb(ml[1]);
      |             ~~~^~~~~~~~~~~~~~
combo.cpp:98:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         else if  (cns==cur.size()+1) cur.pb(ml[0]);
      |                   ~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 KB Output is correct
15 Correct 0 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 0 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 0 ms 208 KB Output is correct
23 Correct 0 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 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 0 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 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 1 ms 208 KB Output is correct
10 Correct 0 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 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 21 ms 476 KB Output is correct
18 Correct 19 ms 384 KB Output is correct
19 Correct 19 ms 348 KB Output is correct
20 Correct 22 ms 356 KB Output is correct
21 Correct 21 ms 352 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 2 ms 300 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 208 KB Output is correct
32 Correct 14 ms 360 KB Output is correct
33 Correct 15 ms 352 KB Output is correct
34 Correct 16 ms 436 KB Output is correct
35 Correct 21 ms 352 KB Output is correct
36 Correct 21 ms 352 KB Output is correct
37 Correct 18 ms 364 KB Output is correct
38 Correct 18 ms 452 KB Output is correct
39 Correct 23 ms 452 KB Output is correct
40 Correct 22 ms 352 KB Output is correct
41 Correct 18 ms 348 KB Output is correct
42 Correct 22 ms 352 KB Output is correct
43 Correct 12 ms 348 KB Output is correct
44 Correct 19 ms 460 KB Output is correct
45 Correct 18 ms 356 KB Output is correct
46 Correct 21 ms 352 KB Output is correct
47 Correct 19 ms 352 KB Output is correct
48 Correct 16 ms 348 KB Output is correct
49 Correct 20 ms 348 KB Output is correct
50 Correct 21 ms 364 KB Output is correct
51 Correct 20 ms 352 KB Output is correct
52 Correct 19 ms 352 KB Output is correct
53 Correct 22 ms 348 KB Output is correct
54 Correct 19 ms 444 KB Output is correct
55 Correct 18 ms 352 KB Output is correct
56 Correct 21 ms 348 KB Output is correct
57 Correct 19 ms 348 KB Output is correct
58 Correct 20 ms 348 KB Output is correct
59 Correct 15 ms 448 KB Output is correct
60 Correct 21 ms 356 KB Output is correct
61 Correct 21 ms 356 KB Output is correct
62 Correct 17 ms 348 KB Output is correct
63 Correct 18 ms 352 KB Output is correct
64 Correct 19 ms 492 KB Output is correct
65 Correct 20 ms 352 KB Output is correct
66 Correct 15 ms 352 KB Output is correct
67 Correct 11 ms 356 KB Output is correct
68 Correct 19 ms 420 KB Output is correct
69 Correct 22 ms 492 KB Output is correct
70 Correct 16 ms 356 KB Output is correct
71 Correct 20 ms 348 KB Output is correct
72 Correct 21 ms 452 KB Output is correct
73 Correct 20 ms 356 KB Output is correct
74 Correct 20 ms 352 KB Output is correct
75 Correct 21 ms 348 KB Output is correct
76 Correct 22 ms 348 KB Output is correct
77 Correct 16 ms 356 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 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 0 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 0 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 0 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 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 300 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 0 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 0 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 0 ms 208 KB Output is correct
111 Correct 0 ms 208 KB Output is correct
112 Correct 0 ms 208 KB Output is correct
113 Correct 0 ms 208 KB Output is correct
114 Correct 0 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 0 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 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct