# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
811017 |
2023-08-06T20:21:43 Z |
TB_ |
Combo (IOI18_combo) |
C++17 |
|
34 ms |
600 KB |
#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
int press(std::string p);
string alphabet = "ABXY";
string guess_sequence(int n) {
string p = "";
if(press("AB")){
if(press("A")) p = "A";
else p = "B";
}else{
if(press("X")) p = "X";
else p = "Y";
}
if(n == 1) return p;
string charsUsing = "";
fo(j, 4){
if(alphabet[j] == p[0]) continue;
charsUsing.pb(alphabet[j]);
}
for(int i = 1; i < n-1; i++){
int count = 0;
string temp;
fo(j, 4){
if(alphabet[j] == p[0]) continue;
if(count == 2) break;
count++;
if(count == 1){
temp = p;
temp += charsUsing[0];
continue;
}
fo(k, 4){
if(alphabet[k] == p[0]) continue;
fo(i2, p.size()) temp+=p[i2];
temp += charsUsing[1];
temp += alphabet[k];
}
}
int res = press(temp);
if(res == i)p+=charsUsing[2];
else if(res == i+1)p+=charsUsing[0];
else p+=charsUsing[1];
}
if(press(p+"A"+p+"B") == n){
if(press(p+"A") == n) p += "A";
else p += "B";
}else{
if(press(p+"X") == n) p += "X";
else p += "Y";
}
return p;
}
// 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() {
// 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) {
// wrong_answer("wrong guess");
// exit(0);
// }
// printf("Accepted: %d\n", num_moves);
// return 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 |
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 |
1 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 |
0 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 |
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 |
32 ms |
352 KB |
Output is correct |
18 |
Correct |
32 ms |
476 KB |
Output is correct |
19 |
Correct |
33 ms |
376 KB |
Output is correct |
20 |
Correct |
32 ms |
428 KB |
Output is correct |
21 |
Correct |
26 ms |
352 KB |
Output is correct |
22 |
Correct |
1 ms |
208 KB |
Output is correct |
23 |
Correct |
0 ms |
296 KB |
Output is correct |
24 |
Correct |
1 ms |
208 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 |
208 KB |
Output is correct |
28 |
Correct |
1 ms |
208 KB |
Output is correct |
29 |
Correct |
1 ms |
304 KB |
Output is correct |
30 |
Correct |
2 ms |
336 KB |
Output is correct |
31 |
Correct |
2 ms |
208 KB |
Output is correct |
32 |
Correct |
29 ms |
348 KB |
Output is correct |
33 |
Correct |
30 ms |
356 KB |
Output is correct |
34 |
Correct |
31 ms |
600 KB |
Output is correct |
35 |
Correct |
32 ms |
356 KB |
Output is correct |
36 |
Correct |
24 ms |
472 KB |
Output is correct |
37 |
Correct |
32 ms |
352 KB |
Output is correct |
38 |
Correct |
19 ms |
352 KB |
Output is correct |
39 |
Correct |
33 ms |
352 KB |
Output is correct |
40 |
Correct |
30 ms |
352 KB |
Output is correct |
41 |
Correct |
29 ms |
484 KB |
Output is correct |
42 |
Correct |
28 ms |
348 KB |
Output is correct |
43 |
Correct |
31 ms |
352 KB |
Output is correct |
44 |
Correct |
31 ms |
348 KB |
Output is correct |
45 |
Correct |
25 ms |
352 KB |
Output is correct |
46 |
Correct |
27 ms |
416 KB |
Output is correct |
47 |
Correct |
26 ms |
348 KB |
Output is correct |
48 |
Correct |
26 ms |
408 KB |
Output is correct |
49 |
Correct |
30 ms |
356 KB |
Output is correct |
50 |
Correct |
25 ms |
356 KB |
Output is correct |
51 |
Correct |
24 ms |
516 KB |
Output is correct |
52 |
Correct |
32 ms |
356 KB |
Output is correct |
53 |
Correct |
20 ms |
528 KB |
Output is correct |
54 |
Correct |
34 ms |
352 KB |
Output is correct |
55 |
Correct |
31 ms |
348 KB |
Output is correct |
56 |
Correct |
32 ms |
476 KB |
Output is correct |
57 |
Correct |
31 ms |
348 KB |
Output is correct |
58 |
Correct |
26 ms |
440 KB |
Output is correct |
59 |
Correct |
24 ms |
352 KB |
Output is correct |
60 |
Correct |
30 ms |
352 KB |
Output is correct |
61 |
Correct |
26 ms |
348 KB |
Output is correct |
62 |
Correct |
30 ms |
360 KB |
Output is correct |
63 |
Correct |
31 ms |
364 KB |
Output is correct |
64 |
Correct |
30 ms |
352 KB |
Output is correct |
65 |
Correct |
31 ms |
352 KB |
Output is correct |
66 |
Correct |
29 ms |
408 KB |
Output is correct |
67 |
Correct |
32 ms |
352 KB |
Output is correct |
68 |
Correct |
31 ms |
352 KB |
Output is correct |
69 |
Correct |
25 ms |
352 KB |
Output is correct |
70 |
Correct |
30 ms |
352 KB |
Output is correct |
71 |
Correct |
24 ms |
352 KB |
Output is correct |
72 |
Correct |
26 ms |
356 KB |
Output is correct |
73 |
Correct |
26 ms |
352 KB |
Output is correct |
74 |
Correct |
32 ms |
348 KB |
Output is correct |
75 |
Correct |
32 ms |
352 KB |
Output is correct |
76 |
Correct |
22 ms |
548 KB |
Output is correct |
77 |
Correct |
30 ms |
560 KB |
Output is correct |
78 |
Correct |
0 ms |
208 KB |
Output is correct |
79 |
Correct |
0 ms |
208 KB |
Output is correct |
80 |
Correct |
0 ms |
208 KB |
Output is correct |
81 |
Correct |
1 ms |
208 KB |
Output is correct |
82 |
Correct |
0 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 |
0 ms |
400 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 |
0 ms |
208 KB |
Output is correct |
92 |
Correct |
1 ms |
208 KB |
Output is correct |
93 |
Correct |
0 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 |
0 ms |
208 KB |
Output is correct |
108 |
Correct |
0 ms |
208 KB |
Output is correct |
109 |
Correct |
0 ms |
208 KB |
Output is correct |
110 |
Correct |
0 ms |
208 KB |
Output is correct |
111 |
Correct |
1 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 |
0 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 |
280 KB |
Output is correct |
123 |
Correct |
1 ms |
296 KB |
Output is correct |