oj.uz

Submission #766619

# Submission time Handle Problem Language Result Execution time Memory
766619 2023-06-26T02:04:39 Z marvinthang Combo (IOI18_combo) C++17
100 / 100
 24 ms 756 KB 
/*************************************
*    author: marvinthang             *
*    created: 26.06.2023 08:55:53    *
*************************************/

#include "combo.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

string guess_sequence(int N) {
	string S;
	if (press("AB")) S += press("A") ? 'A' : 'B';
	else S += press("X") ? 'X' : 'Y';
	string R;
	for (char c: {'A', 'B', 'X', 'Y'}) if (c != S[0]) R += c;
	FOR(i, 2, N) {
		string a = S + R[0];
		for (char c: R) a += S + R[1] + c;
		int t = press(a);
		if (t == i) S += R[0];
		else if (t == i + 1) S += R[1];
		else S += R[2];
	}
	if (N > 1) {
		REP(i, 2) if (press(S + R[i]) == N) return S + R[i];
		return S + R[2];
	}
	return S;
}

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

namespace {

constexpr int MAX_N = 2000;
constexpr int MAX_NUM_MOVES = 8000;

int N;
std::string S;

int num_moves;

void wrong_answer(const char *MSG) {
	printf("Wrong Answer: %s\n", MSG);
	exit(0);
}

}  // namespace

int press(std::string p) {
	if (++num_moves > MAX_NUM_MOVES) {
		wrong_answer("too many moves");
	}
	int len = p.length();
	if (len > 4 * N) {
		wrong_answer("invalid press");
	}
	for (int i = 0; i < len; ++i) {
		if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
			wrong_answer("invalid press");
		}
	}
	int coins = 0;
	for (int i = 0, j = 0; i < len; ++i) {
		if (j < N && S[j] == p[i]) {
			++j;
		} else if (S[0] == p[i]) {
			j = 1;
		} else {
			j = 0;
		}
		coins = std::max(coins, j);
	}
	return coins;
}

int main() {
	file("combo");
	char buffer[MAX_N + 1];
	if (scanf("%s", buffer) != 1) {
		fprintf(stderr, "Error while reading input\n");
		exit(1);
	}
	S = buffer;
	N = S.length();

	num_moves = 0;
	std::string answer = guess_sequence(N);
	if (answer != S) {
		cout << answer << '\n';
		wrong_answer("wrong guess: ");
		exit(0);
	}
	printf("Accepted: %d\n", num_moves);
	return 0;
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 208 KB Output is correct
6 Correct 1 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 1 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 1 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 1 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 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 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct

Subtask #2
95.0 / 95.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 1 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 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 20 ms 384 KB Output is correct
18 Correct 24 ms 388 KB Output is correct
19 Correct 22 ms 388 KB Output is correct
20 Correct 20 ms 528 KB Output is correct
21 Correct 20 ms 384 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 2 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 300 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 22 ms 396 KB Output is correct
33 Correct 19 ms 384 KB Output is correct
34 Correct 23 ms 388 KB Output is correct
35 Correct 17 ms 388 KB Output is correct
36 Correct 21 ms 584 KB Output is correct
37 Correct 17 ms 392 KB Output is correct
38 Correct 21 ms 392 KB Output is correct
39 Correct 21 ms 516 KB Output is correct
40 Correct 17 ms 388 KB Output is correct
41 Correct 22 ms 492 KB Output is correct
42 Correct 22 ms 388 KB Output is correct
43 Correct 23 ms 388 KB Output is correct
44 Correct 11 ms 388 KB Output is correct
45 Correct 19 ms 584 KB Output is correct
46 Correct 22 ms 756 KB Output is correct
47 Correct 22 ms 388 KB Output is correct
48 Correct 22 ms 392 KB Output is correct
49 Correct 16 ms 384 KB Output is correct
50 Correct 19 ms 392 KB Output is correct
51 Correct 19 ms 484 KB Output is correct
52 Correct 20 ms 384 KB Output is correct
53 Correct 17 ms 388 KB Output is correct
54 Correct 19 ms 464 KB Output is correct
55 Correct 21 ms 392 KB Output is correct
56 Correct 22 ms 560 KB Output is correct
57 Correct 14 ms 388 KB Output is correct
58 Correct 18 ms 444 KB Output is correct
59 Correct 18 ms 456 KB Output is correct
60 Correct 22 ms 388 KB Output is correct
61 Correct 22 ms 388 KB Output is correct
62 Correct 22 ms 388 KB Output is correct
63 Correct 22 ms 384 KB Output is correct
64 Correct 16 ms 484 KB Output is correct
65 Correct 15 ms 392 KB Output is correct
66 Correct 22 ms 428 KB Output is correct
67 Correct 22 ms 388 KB Output is correct
68 Correct 22 ms 384 KB Output is correct
69 Correct 23 ms 492 KB Output is correct
70 Correct 21 ms 388 KB Output is correct
71 Correct 24 ms 464 KB Output is correct
72 Correct 17 ms 388 KB Output is correct
73 Correct 17 ms 388 KB Output is correct
74 Correct 23 ms 500 KB Output is correct
75 Correct 16 ms 388 KB Output is correct
76 Correct 21 ms 388 KB Output is correct
77 Correct 17 ms 388 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 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 296 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 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 208 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 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 1 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 1 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 1 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 284 KB Output is correct
123 Correct 1 ms 208 KB Output is correct