oj.uz

Submission #444399

# Submission time Handle Problem Language Result Execution time Memory
444399 2021-07-14T00:43:39 Z xiaowuc1 Combo (IOI18_combo) C++17
100 / 100
 36 ms 612 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#include "combo.h"

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

/*
const string GOAL = "ABX";
int press(string s) {
  cerr << "PRESS: " << s << endl;
  string want = GOAL;
  while(sz(want)) {
    for(int i = 0; i + sz(want) <= sz(s); i++) if(s.substr(i, sz(want)) == want) return sz(want);
    want = want.substr(0, sz(want)-1);
  }
  return 0;
}
*/

string guess_sequence(int n) {
  string alpha = "ABXY";
  int v1 = press("AB");
  int v2 = press("AX");
  string prefix = "";
  if(v1 > 0 && v2 > 0) {
    prefix = "A";
    alpha.erase(alpha.begin() + 0);
  }
  else if(v1 > 0 && v2 == 0) {
    prefix = "B";
    alpha.erase(alpha.begin() + 1);
  }
  else if(v1 == 0 && v2 > 0) {
    prefix = "X";
    alpha.erase(alpha.begin() + 2);
  }
  else if(v1 == 0 && v2 == 0) {
    prefix = "Y";
    alpha.erase(alpha.begin() + 3);
  }
  else assert(false);
  cerr << "alpha is " << alpha << endl;
  while(sz(prefix) < n-1) {
    string cand = prefix;
    cand += alpha[0];
    cand += alpha[0];
    cand += prefix;
    cand += alpha[0];
    cand += alpha[1];
    cand += prefix;
    cand += alpha[0];
    cand += alpha[2];
    cand += prefix;
    cand += alpha[1];
    int pp = press(cand);
    if(pp == sz(prefix)+2) prefix += alpha[0];
    else if(pp == sz(prefix)+1) prefix += alpha[1];
    else if(pp == sz(prefix)+0) prefix += alpha[2];
    else assert(false);
  }
  if(sz(prefix) == n) return prefix;
  string lhs = prefix; lhs += alpha[0]; lhs += prefix; lhs += alpha[1];
  string rhs = prefix; rhs += alpha[0]; rhs += prefix; rhs += alpha[2];
  v1 = press(lhs);
  v2 = press(rhs);
  if(v1 == n && v2 == n) return prefix + alpha[0];
  if(v1 == n) return prefix + alpha[1];
  if(v2 == n) return prefix + alpha[2];
  assert(false);
}

/*
void solve() {
  string ret = guess_sequence(sz(GOAL));
  cerr << ret << endl;
  cerr << (ret == GOAL) << endl;
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 0 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 0 ms 200 KB Output is correct
17 Correct 30 ms 444 KB Output is correct
18 Correct 29 ms 436 KB Output is correct
19 Correct 34 ms 348 KB Output is correct
20 Correct 30 ms 572 KB Output is correct
21 Correct 26 ms 464 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 2 ms 200 KB Output is correct
26 Correct 2 ms 200 KB Output is correct
27 Correct 2 ms 308 KB Output is correct
28 Correct 2 ms 328 KB Output is correct
29 Correct 2 ms 288 KB Output is correct
30 Correct 2 ms 328 KB Output is correct
31 Correct 3 ms 308 KB Output is correct
32 Correct 24 ms 440 KB Output is correct
33 Correct 29 ms 452 KB Output is correct
34 Correct 28 ms 440 KB Output is correct
35 Correct 29 ms 612 KB Output is correct
36 Correct 32 ms 344 KB Output is correct
37 Correct 31 ms 444 KB Output is correct
38 Correct 31 ms 356 KB Output is correct
39 Correct 35 ms 400 KB Output is correct
40 Correct 29 ms 344 KB Output is correct
41 Correct 25 ms 380 KB Output is correct
42 Correct 23 ms 576 KB Output is correct
43 Correct 34 ms 404 KB Output is correct
44 Correct 29 ms 392 KB Output is correct
45 Correct 28 ms 464 KB Output is correct
46 Correct 28 ms 344 KB Output is correct
47 Correct 32 ms 388 KB Output is correct
48 Correct 26 ms 440 KB Output is correct
49 Correct 25 ms 452 KB Output is correct
50 Correct 31 ms 388 KB Output is correct
51 Correct 34 ms 416 KB Output is correct
52 Correct 29 ms 400 KB Output is correct
53 Correct 30 ms 368 KB Output is correct
54 Correct 30 ms 464 KB Output is correct
55 Correct 25 ms 428 KB Output is correct
56 Correct 31 ms 396 KB Output is correct
57 Correct 30 ms 564 KB Output is correct
58 Correct 25 ms 464 KB Output is correct
59 Correct 36 ms 568 KB Output is correct
60 Correct 28 ms 344 KB Output is correct
61 Correct 34 ms 356 KB Output is correct
62 Correct 33 ms 388 KB Output is correct
63 Correct 31 ms 380 KB Output is correct
64 Correct 31 ms 396 KB Output is correct
65 Correct 26 ms 384 KB Output is correct
66 Correct 31 ms 420 KB Output is correct
67 Correct 21 ms 544 KB Output is correct
68 Correct 30 ms 360 KB Output is correct
69 Correct 30 ms 348 KB Output is correct
70 Correct 31 ms 348 KB Output is correct
71 Correct 33 ms 372 KB Output is correct
72 Correct 31 ms 516 KB Output is correct
73 Correct 15 ms 344 KB Output is correct
74 Correct 32 ms 468 KB Output is correct
75 Correct 29 ms 348 KB Output is correct
76 Correct 32 ms 448 KB Output is correct
77 Correct 16 ms 464 KB Output is correct
78 Correct 0 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 1 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 0 ms 200 KB Output is correct
89 Correct 1 ms 292 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 2 ms 296 KB Output is correct
95 Correct 1 ms 200 KB Output is correct
96 Correct 1 ms 200 KB Output is correct
97 Correct 1 ms 200 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 1 ms 200 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 1 ms 296 KB Output is correct
102 Correct 1 ms 300 KB Output is correct
103 Correct 1 ms 200 KB Output is correct
104 Correct 1 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 1 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 200 KB Output is correct
110 Correct 0 ms 200 KB Output is correct
111 Correct 1 ms 200 KB Output is correct
112 Correct 1 ms 200 KB Output is correct
113 Correct 0 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Correct 1 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 1 ms 200 KB Output is correct
119 Correct 1 ms 296 KB Output is correct
120 Correct 1 ms 200 KB Output is correct
121 Correct 1 ms 200 KB Output is correct
122 Correct 1 ms 200 KB Output is correct
123 Correct 1 ms 200 KB Output is correct