oj.uz

Submission #995635

# Submission time Handle Problem Language Result Execution time Memory
995635 2024-06-09T14:03:08 Z mindiyak Combo (IOI18_combo) C++14
100 / 100
 26 ms 1680 KB 
#include "combo.h"

#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

string guess_sequence(int N) {
  vector<char> possible = {'A','B','X','Y'};
  string ans = "";
  if(press("AB")){
    if(press("A")){
      possible.erase(possible.begin());
      ans = "A";
    }
    else{
      possible.erase(possible.begin()+1);
      ans = "B";
    }
  }else{
    if(press("X")){
      possible.erase(possible.begin()+2);
      ans = "X";
    }
    else{
      possible.erase(possible.begin()+3);
      ans = "Y";
      }
  }

  if(N==1)return ans;

  FOR(i,0,N-2){
    string temp = ans + string(1,possible[0]);
    FOR(j,0,3)temp += ans + string(1,possible[1]) + string(1,possible[j]);
    int a = press(temp);
    if(a == ans.size()+1)ans += string(1,possible[0]);
    else if(a > ans.size()+1)ans += string(1,possible[1]);
    else ans += string(1,possible[2]);
  }

  FOR(j,0,2){
    int a = press(ans + string(1,possible[j]));
    if(a == N) return ans + string(1,possible[j]);
  }

  return ans + string(1,possible[2]);
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:71:10: 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(a == ans.size()+1)ans += string(1,possible[0]);
      |        ~~^~~~~~~~~~~~~~~
combo.cpp:72:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     else if(a > ans.size()+1)ans += string(1,possible[1]);
      |             ~~^~~~~~~~~~~~~~

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 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 1 ms 344 KB Output is correct
7 Correct 1 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 1 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 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 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 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 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 1 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 1 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 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 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 19 ms 520 KB Output is correct
18 Correct 21 ms 520 KB Output is correct
19 Correct 21 ms 772 KB Output is correct
20 Correct 17 ms 644 KB Output is correct
21 Correct 24 ms 1680 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 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 424 KB Output is correct
29 Correct 2 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 18 ms 728 KB Output is correct
33 Correct 23 ms 624 KB Output is correct
34 Correct 20 ms 1680 KB Output is correct
35 Correct 18 ms 688 KB Output is correct
36 Correct 23 ms 592 KB Output is correct
37 Correct 21 ms 768 KB Output is correct
38 Correct 21 ms 728 KB Output is correct
39 Correct 24 ms 592 KB Output is correct
40 Correct 23 ms 744 KB Output is correct
41 Correct 22 ms 760 KB Output is correct
42 Correct 17 ms 640 KB Output is correct
43 Correct 21 ms 1284 KB Output is correct
44 Correct 22 ms 760 KB Output is correct
45 Correct 22 ms 744 KB Output is correct
46 Correct 16 ms 740 KB Output is correct
47 Correct 18 ms 760 KB Output is correct
48 Correct 19 ms 756 KB Output is correct
49 Correct 16 ms 756 KB Output is correct
50 Correct 19 ms 1004 KB Output is correct
51 Correct 19 ms 760 KB Output is correct
52 Correct 17 ms 696 KB Output is correct
53 Correct 18 ms 536 KB Output is correct
54 Correct 18 ms 520 KB Output is correct
55 Correct 18 ms 1428 KB Output is correct
56 Correct 19 ms 520 KB Output is correct
57 Correct 17 ms 1472 KB Output is correct
58 Correct 17 ms 584 KB Output is correct
59 Correct 20 ms 672 KB Output is correct
60 Correct 20 ms 768 KB Output is correct
61 Correct 21 ms 640 KB Output is correct
62 Correct 18 ms 848 KB Output is correct
63 Correct 18 ms 596 KB Output is correct
64 Correct 18 ms 1576 KB Output is correct
65 Correct 17 ms 584 KB Output is correct
66 Correct 18 ms 760 KB Output is correct
67 Correct 24 ms 540 KB Output is correct
68 Correct 21 ms 580 KB Output is correct
69 Correct 22 ms 1000 KB Output is correct
70 Correct 21 ms 624 KB Output is correct
71 Correct 20 ms 1292 KB Output is correct
72 Correct 21 ms 944 KB Output is correct
73 Correct 21 ms 752 KB Output is correct
74 Correct 24 ms 1368 KB Output is correct
75 Correct 22 ms 520 KB Output is correct
76 Correct 25 ms 516 KB Output is correct
77 Correct 26 ms 736 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 596 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 ms 344 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 1 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 0 ms 344 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 436 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 596 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 1 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 1 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 0 ms 344 KB Output is correct
111 Correct 0 ms 596 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 1 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 1 ms 344 KB Output is correct
120 Correct 1 ms 344 KB Output is correct
121 Correct 0 ms 344 KB Output is correct
122 Correct 1 ms 344 KB Output is correct
123 Correct 0 ms 344 KB Output is correct