oj.uz

Submission #112707

# Submission time Handle Problem Language Result Execution time Memory
112707 2019-05-21T15:42:19 Z imaxblue Combo (IOI18_combo) C++17
100 / 100
 46 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define vi vector<int>
#define vpii vector<pii>
#define vp3i vector<p3i>
#define vpll vector<pll>
#define vp3l vector<p3l>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846

string s;
int press(string p);/*{
  fox(l, s.size()){
    if (p.find(s.substr(0, l+1))==string::npos) return l;
  }
  return s.size();
}*/
char st;
string poss = "ABXY", r, q;
string guess_sequence(int N){
  int a1 = (press("AX")>0);
  int a2 = (press("AY")>0);
  if (a1 && a2){
    st = 'A';
  } else if (a1){
    st = 'X';
  } else if (a2){
    st = 'Y';
  } else {
    st = 'B';
  }
  fox(l, 4){
    if (poss[l] == st){
        poss.erase(poss.begin()+l);
        break;
    }
  }
  r += st;
  while(r.size() < N-1){
    q = r + poss[0];
    fox(l2, 3){
      q += r + poss[1]+poss[l2];
    }
    int t = press(q);
    //cout << r << ' ' << t << endl;
    if (t == r.size()){
      r += poss[2];
    } else if (t == r.size() + 1){
      r += poss[0];
    } else if (t == r.size() + 2){
      r += poss[1];
    }
  }
  if (r.size() < N){
    int t = press(r + poss[0]) - r.size();
    int t2 = press(r + poss[1]) - r.size();
    if (t) r += poss[0];
    else if (t2) r+= poss[1];
    else r += poss[2];
  }
  return r;
}/*
int32_t main(){
  s = "ABXXY";
  cout << guess_sequence(5);
  return 0;
}*/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:63:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |   while(r.size() < N-1){
      |         ~~~~~~~~~^~~~~
combo.cpp:70:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     if (t == r.size()){
      |         ~~^~~~~~~~~~~
combo.cpp:72:18: 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 (t == r.size() + 1){
      |                ~~^~~~~~~~~~~~~~~
combo.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     } else if (t == r.size() + 2){
      |                ~~^~~~~~~~~~~~~~~
combo.cpp:78:16: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |   if (r.size() < N){
      |       ~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 2 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 1 ms 200 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 2 ms 200 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 1 ms 200 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 41 ms 392 KB Output is correct
18 Correct 44 ms 384 KB Output is correct
19 Correct 32 ms 508 KB Output is correct
20 Correct 20 ms 476 KB Output is correct
21 Correct 37 ms 400 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 2 ms 288 KB Output is correct
25 Correct 2 ms 200 KB Output is correct
26 Correct 3 ms 296 KB Output is correct
27 Correct 3 ms 292 KB Output is correct
28 Correct 3 ms 292 KB Output is correct
29 Correct 3 ms 308 KB Output is correct
30 Correct 3 ms 200 KB Output is correct
31 Correct 4 ms 332 KB Output is correct
32 Correct 36 ms 384 KB Output is correct
33 Correct 32 ms 536 KB Output is correct
34 Correct 30 ms 380 KB Output is correct
35 Correct 38 ms 460 KB Output is correct
36 Correct 39 ms 376 KB Output is correct
37 Correct 39 ms 588 KB Output is correct
38 Correct 34 ms 376 KB Output is correct
39 Correct 40 ms 448 KB Output is correct
40 Correct 39 ms 380 KB Output is correct
41 Correct 39 ms 492 KB Output is correct
42 Correct 36 ms 396 KB Output is correct
43 Correct 41 ms 392 KB Output is correct
44 Correct 18 ms 432 KB Output is correct
45 Correct 43 ms 376 KB Output is correct
46 Correct 39 ms 468 KB Output is correct
47 Correct 24 ms 456 KB Output is correct
48 Correct 33 ms 384 KB Output is correct
49 Correct 41 ms 600 KB Output is correct
50 Correct 41 ms 380 KB Output is correct
51 Correct 45 ms 420 KB Output is correct
52 Correct 30 ms 484 KB Output is correct
53 Correct 35 ms 580 KB Output is correct
54 Correct 46 ms 380 KB Output is correct
55 Correct 22 ms 376 KB Output is correct
56 Correct 43 ms 528 KB Output is correct
57 Correct 33 ms 416 KB Output is correct
58 Correct 34 ms 376 KB Output is correct
59 Correct 24 ms 380 KB Output is correct
60 Correct 46 ms 480 KB Output is correct
61 Correct 36 ms 380 KB Output is correct
62 Correct 25 ms 380 KB Output is correct
63 Correct 38 ms 384 KB Output is correct
64 Correct 44 ms 456 KB Output is correct
65 Correct 35 ms 380 KB Output is correct
66 Correct 46 ms 380 KB Output is correct
67 Correct 32 ms 380 KB Output is correct
68 Correct 39 ms 448 KB Output is correct
69 Correct 39 ms 380 KB Output is correct
70 Correct 24 ms 388 KB Output is correct
71 Correct 23 ms 376 KB Output is correct
72 Correct 36 ms 484 KB Output is correct
73 Correct 30 ms 380 KB Output is correct
74 Correct 39 ms 376 KB Output is correct
75 Correct 38 ms 436 KB Output is correct
76 Correct 44 ms 572 KB Output is correct
77 Correct 29 ms 464 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 2 ms 284 KB Output is correct
85 Correct 2 ms 200 KB Output is correct
86 Correct 2 ms 288 KB Output is correct
87 Correct 2 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 1 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 1 ms 200 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 1 ms 200 KB Output is correct
95 Correct 2 ms 296 KB Output is correct
96 Correct 2 ms 200 KB Output is correct
97 Correct 2 ms 200 KB Output is correct
98 Correct 2 ms 200 KB Output is correct
99 Correct 2 ms 296 KB Output is correct
100 Correct 2 ms 200 KB Output is correct
101 Correct 2 ms 288 KB Output is correct
102 Correct 2 ms 200 KB Output is correct
103 Correct 2 ms 200 KB Output is correct
104 Correct 2 ms 200 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 2 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 2 ms 200 KB Output is correct
110 Correct 1 ms 200 KB Output is correct
111 Correct 2 ms 256 KB Output is correct
112 Correct 1 ms 200 KB Output is correct
113 Correct 1 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Correct 2 ms 200 KB Output is correct
116 Correct 1 ms 200 KB Output is correct
117 Correct 1 ms 200 KB Output is correct
118 Correct 2 ms 200 KB Output is correct
119 Correct 2 ms 292 KB Output is correct
120 Correct 2 ms 200 KB Output is correct
121 Correct 2 ms 200 KB Output is correct
122 Correct 2 ms 200 KB Output is correct
123 Correct 2 ms 200 KB Output is correct