# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
316673 |
2020-10-27T08:18:02 Z |
anakib1 |
Combo (IOI18_combo) |
C++17 |
|
43 ms |
572 KB |
#include "combo.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>
#include "combo.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"
template<typename A, typename B, typename C>
struct triple {
A X;
B Y;
C Z;
triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
if (a.X != b.X)
return a.X < b.X;
if (a.Y != b.Y)
return a.Y < b.Y;
return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
ofs << "( " << p.F << " , " << p.S << " )";
return ofs;
}
template<typename T>
void print(T a) {
for (auto i : a)
cout << i << ' ';
cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
return *max_element(all(a));
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
std::string guess_sequence(int n) {
vector<char> id{ 'A', 'B','X','Y'};
int f = 3;
rngi(i, 3)if (press(string(1, id[i])) == 1) { f = i; break; }
string p = string(1, id[f]);
if (n == 1) return p;
rngi(i, n - 2) {
string ask = p + string(1, id[(f + 1) % 4]) +
p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 1) % 4]) +
p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 2) % 4]) +
p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 3) % 4]);
int v = press(ask);
if (v == sz(p)) p += string(1, id[(f + 3) % 4]);
else if (v == sz(p) + 1) p += string(1, id[(f + 1) % 4]);
else p += string(1, id[(f + 2) % 4]);
}
if (press(p + string(1, id[(f + 1) % 4])) == n) p += id[(f + 1) % 4];
else if (press(p + string(1, id[(f + 2) % 4])) == n) p += id[(f + 2) % 4];
else p += id[(f + 3) % 4];
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
0 ms |
200 KB |
Output is correct |
4 |
Correct |
1 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 |
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 |
0 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 |
0 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 |
1 ms |
200 KB |
Output is correct |
21 |
Correct |
0 ms |
200 KB |
Output is correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Correct |
1 ms |
200 KB |
Output is correct |
24 |
Correct |
0 ms |
200 KB |
Output is correct |
25 |
Correct |
1 ms |
200 KB |
Output is correct |
26 |
Correct |
1 ms |
200 KB |
Output is correct |
27 |
Correct |
0 ms |
200 KB |
Output is correct |
28 |
Correct |
0 ms |
200 KB |
Output is correct |
29 |
Correct |
1 ms |
200 KB |
Output is correct |
30 |
Correct |
1 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 |
1 ms |
200 KB |
Output is correct |
34 |
Correct |
1 ms |
200 KB |
Output is correct |
35 |
Correct |
0 ms |
200 KB |
Output is correct |
36 |
Correct |
1 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
1 ms |
276 KB |
Output is correct |
4 |
Correct |
0 ms |
200 KB |
Output is correct |
5 |
Correct |
0 ms |
200 KB |
Output is correct |
6 |
Correct |
1 ms |
200 KB |
Output is correct |
7 |
Correct |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
0 ms |
200 KB |
Output is correct |
9 |
Correct |
1 ms |
248 KB |
Output is correct |
10 |
Correct |
0 ms |
200 KB |
Output is correct |
11 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
12 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
13 |
Correct |
0 ms |
200 KB |
Output is correct |
14 |
Correct |
0 ms |
200 KB |
Output is correct |
15 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
16 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
17 |
Correct |
30 ms |
408 KB |
Output is correct |
18 |
Partially correct |
32 ms |
572 KB |
Output is partially correct |
19 |
Correct |
34 ms |
384 KB |
Output is correct |
20 |
Partially correct |
32 ms |
452 KB |
Output is partially correct |
21 |
Partially correct |
31 ms |
428 KB |
Output is partially correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
24 |
Correct |
1 ms |
256 KB |
Output is correct |
25 |
Correct |
2 ms |
292 KB |
Output is correct |
26 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
27 |
Correct |
2 ms |
200 KB |
Output is correct |
28 |
Correct |
1 ms |
328 KB |
Output is correct |
29 |
Correct |
2 ms |
200 KB |
Output is correct |
30 |
Correct |
2 ms |
200 KB |
Output is correct |
31 |
Partially correct |
3 ms |
200 KB |
Output is partially correct |
32 |
Partially correct |
31 ms |
456 KB |
Output is partially correct |
33 |
Correct |
35 ms |
468 KB |
Output is correct |
34 |
Correct |
43 ms |
344 KB |
Output is correct |
35 |
Partially correct |
33 ms |
348 KB |
Output is partially correct |
36 |
Partially correct |
40 ms |
424 KB |
Output is partially correct |
37 |
Correct |
33 ms |
428 KB |
Output is correct |
38 |
Partially correct |
37 ms |
404 KB |
Output is partially correct |
39 |
Correct |
28 ms |
372 KB |
Output is correct |
40 |
Correct |
30 ms |
480 KB |
Output is correct |
41 |
Correct |
21 ms |
396 KB |
Output is correct |
42 |
Correct |
38 ms |
556 KB |
Output is correct |
43 |
Correct |
32 ms |
448 KB |
Output is correct |
44 |
Partially correct |
21 ms |
352 KB |
Output is partially correct |
45 |
Correct |
29 ms |
348 KB |
Output is correct |
46 |
Correct |
35 ms |
452 KB |
Output is correct |
47 |
Correct |
38 ms |
340 KB |
Output is correct |
48 |
Partially correct |
32 ms |
432 KB |
Output is partially correct |
49 |
Partially correct |
22 ms |
440 KB |
Output is partially correct |
50 |
Correct |
39 ms |
396 KB |
Output is correct |
51 |
Correct |
37 ms |
448 KB |
Output is correct |
52 |
Correct |
37 ms |
436 KB |
Output is correct |
53 |
Partially correct |
30 ms |
456 KB |
Output is partially correct |
54 |
Correct |
31 ms |
424 KB |
Output is correct |
55 |
Correct |
37 ms |
344 KB |
Output is correct |
56 |
Partially correct |
19 ms |
344 KB |
Output is partially correct |
57 |
Correct |
30 ms |
440 KB |
Output is correct |
58 |
Correct |
30 ms |
444 KB |
Output is correct |
59 |
Correct |
28 ms |
388 KB |
Output is correct |
60 |
Partially correct |
27 ms |
456 KB |
Output is partially correct |
61 |
Partially correct |
23 ms |
476 KB |
Output is partially correct |
62 |
Correct |
23 ms |
408 KB |
Output is correct |
63 |
Correct |
38 ms |
452 KB |
Output is correct |
64 |
Correct |
34 ms |
444 KB |
Output is correct |
65 |
Partially correct |
38 ms |
452 KB |
Output is partially correct |
66 |
Correct |
33 ms |
440 KB |
Output is correct |
67 |
Correct |
33 ms |
476 KB |
Output is correct |
68 |
Correct |
38 ms |
444 KB |
Output is correct |
69 |
Correct |
27 ms |
488 KB |
Output is correct |
70 |
Correct |
36 ms |
468 KB |
Output is correct |
71 |
Correct |
26 ms |
564 KB |
Output is correct |
72 |
Partially correct |
39 ms |
464 KB |
Output is partially correct |
73 |
Partially correct |
27 ms |
344 KB |
Output is partially correct |
74 |
Correct |
30 ms |
488 KB |
Output is correct |
75 |
Correct |
35 ms |
448 KB |
Output is correct |
76 |
Correct |
32 ms |
452 KB |
Output is correct |
77 |
Correct |
29 ms |
392 KB |
Output is correct |
78 |
Correct |
1 ms |
200 KB |
Output is correct |
79 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
80 |
Correct |
1 ms |
200 KB |
Output is correct |
81 |
Correct |
1 ms |
200 KB |
Output is correct |
82 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
83 |
Correct |
1 ms |
200 KB |
Output is correct |
84 |
Correct |
1 ms |
200 KB |
Output is correct |
85 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
86 |
Correct |
1 ms |
200 KB |
Output is correct |
87 |
Partially correct |
1 ms |
328 KB |
Output is partially correct |
88 |
Correct |
1 ms |
200 KB |
Output is correct |
89 |
Correct |
1 ms |
200 KB |
Output is correct |
90 |
Partially correct |
1 ms |
200 KB |
Output is partially 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 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
95 |
Partially correct |
1 ms |
296 KB |
Output is partially correct |
96 |
Correct |
1 ms |
200 KB |
Output is correct |
97 |
Correct |
1 ms |
200 KB |
Output is correct |
98 |
Correct |
1 ms |
292 KB |
Output is correct |
99 |
Partially correct |
1 ms |
300 KB |
Output is partially correct |
100 |
Correct |
1 ms |
288 KB |
Output is correct |
101 |
Correct |
1 ms |
200 KB |
Output is correct |
102 |
Partially correct |
1 ms |
200 KB |
Output is partially 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 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
107 |
Partially correct |
1 ms |
200 KB |
Output is partially 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 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
112 |
Correct |
1 ms |
200 KB |
Output is correct |
113 |
Correct |
1 ms |
200 KB |
Output is correct |
114 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
115 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
116 |
Correct |
1 ms |
200 KB |
Output is correct |
117 |
Correct |
1 ms |
200 KB |
Output is correct |
118 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
119 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
120 |
Correct |
1 ms |
200 KB |
Output is correct |
121 |
Correct |
1 ms |
200 KB |
Output is correct |
122 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
123 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |