oj.uz

Submission #907513

# Submission time Handle Problem Language Result Execution time Memory
907513 2024-01-15T18:27:48 Z Mkswll Combo (IOI18_combo) C++17
100 / 100
 13 ms 1724 KB 
#include <bits/stdc++.h>
using namespace std;
#include "combo.h"
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, int> pli;
typedef pair <int, ll> pil;
typedef pair <ll, ll> pll;
typedef pair <ld, ld> pdd;
#define debug(x) cout << '[' << #x << ": " << x << "] "
#define cio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define cases int _; cin >> _; while(_--)
#define pb push_back
#define eb emplace_back
#define space << " " <<
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Unique(v) v.erase(unique(all(v)), v.end())
#define mset(x) memset(x, 0, sizeof(x))
#define sflush fflush(stdout)
#define cflush cout.flush()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define lyes cout << "Yes\n"
#define lno cout << "No\n"
#define nl cout << "\n";
#define binary(len, num) bitset <len> (num)
#define vt vector
#define ar array
#define Mat vt <vt <int> >
#define uid uniform_int_distribution 

template <typename T> istream& operator >> (istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template <typename T> ostream& operator << (ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int read(){
    int w = 1, c, ret;
    while((c = getchar()) > '9' || c < '0'){
        w = (c == '-' ? -1 : 1);
    }
    ret = c - '0';
    while((c = getchar()) >= '0' && c <= '9'){
        ret = ret * 10 + c - '0';
    }
    return ret * w;
}

int rd(){
	int in;
	cin >> in;
	return in;
}
 
void write(int x){
    if(x < 0){
        putchar('-');
        x = -x;
    }
    if(x > 9){
        write(x / 10);
    }
    putchar(x % 10 + '0');
}

const int MAXN = 2e5 + 5, MAXM = 2e5 + 5, INF = 1e9 + 5, MOD = 1e9 + 7;
const ll LMOD = (ll) 1e18 + 9;
const ll LINF = 1e18 + 5;
const ld ep = 1e-8, Pi = acos(-1.0);

string s;
string ss = "ABXY";

// int cnt = 0;
// 
// int press(string p){
	// int ret = 0;
	// int n = (int) s.size();
	// int m = (int) p.size();
	// for(int i = 0; i < m; ++i){
		// for(int j = 0; j < n && i + j < m; ++j){
			// if(p[i + j] == s[j]){
				// ret = max(ret, j + 1);
			// }
			// else break;
		// }
	// }
	// ++cnt;
	// return ret;
// }

string guess_sequence(int n){
	
	string cur = "";
	{
		int res = press("AB");
		if(res){
			if(press("A")) cur = "A";
			else cur = "B";
		}
		else{
			if(press("X")) cur = "X";
			else cur = "Y";
		}
	}
	if(n == 1) return cur;
	string t = "";
	for(auto i : ss) if(i != cur[0]) t += i;
	for(int i = 2; i <= n - 1; ++i){
		string temp = cur + t[0] + t[0] + cur + t[0] + t[1] + cur + t[0] + t[2] + cur + t[1];
		int res = press(temp);
		if(res == i + 1) cur += t[0];
		else if(res == i) cur += t[1];
		else cur += t[2];
	}
	if(press(cur + t[0]) == n) cur += t[0];
	else if(press(cur + t[1]) == n) cur += t[1];
	else cur += t[2];
	return cur;
}

void clear(){
    
}

// int main(){
// 	
	// cin >> s;
	// cout << guess_sequence(s.size()) << " " << cnt << "\n";
	// return 0;
// }

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 540 KB Output is correct
2 Correct 1 ms 388 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 10 ms 1316 KB Output is correct
18 Correct 12 ms 1348 KB Output is correct
19 Correct 11 ms 1152 KB Output is correct
20 Correct 12 ms 1436 KB Output is correct
21 Correct 11 ms 1508 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 696 KB Output is correct
26 Correct 1 ms 696 KB Output is correct
27 Correct 1 ms 696 KB Output is correct
28 Correct 1 ms 448 KB Output is correct
29 Correct 1 ms 696 KB Output is correct
30 Correct 2 ms 696 KB Output is correct
31 Correct 1 ms 696 KB Output is correct
32 Correct 10 ms 1036 KB Output is correct
33 Correct 10 ms 1028 KB Output is correct
34 Correct 11 ms 1220 KB Output is correct
35 Correct 11 ms 968 KB Output is correct
36 Correct 11 ms 1328 KB Output is correct
37 Correct 11 ms 1444 KB Output is correct
38 Correct 11 ms 736 KB Output is correct
39 Correct 10 ms 780 KB Output is correct
40 Correct 11 ms 1096 KB Output is correct
41 Correct 10 ms 1452 KB Output is correct
42 Correct 11 ms 1708 KB Output is correct
43 Correct 11 ms 1300 KB Output is correct
44 Correct 11 ms 1460 KB Output is correct
45 Correct 10 ms 1472 KB Output is correct
46 Correct 10 ms 1272 KB Output is correct
47 Correct 12 ms 984 KB Output is correct
48 Correct 10 ms 1668 KB Output is correct
49 Correct 10 ms 1696 KB Output is correct
50 Correct 10 ms 1604 KB Output is correct
51 Correct 11 ms 1700 KB Output is correct
52 Correct 10 ms 1544 KB Output is correct
53 Correct 11 ms 1364 KB Output is correct
54 Correct 10 ms 1424 KB Output is correct
55 Correct 11 ms 1472 KB Output is correct
56 Correct 11 ms 1444 KB Output is correct
57 Correct 10 ms 1444 KB Output is correct
58 Correct 11 ms 1448 KB Output is correct
59 Correct 10 ms 1532 KB Output is correct
60 Correct 13 ms 1724 KB Output is correct
61 Correct 10 ms 1476 KB Output is correct
62 Correct 11 ms 1580 KB Output is correct
63 Correct 10 ms 1280 KB Output is correct
64 Correct 10 ms 1056 KB Output is correct
65 Correct 10 ms 1064 KB Output is correct
66 Correct 12 ms 1532 KB Output is correct
67 Correct 10 ms 1244 KB Output is correct
68 Correct 12 ms 1596 KB Output is correct
69 Correct 10 ms 1540 KB Output is correct
70 Correct 10 ms 1480 KB Output is correct
71 Correct 10 ms 748 KB Output is correct
72 Correct 10 ms 1048 KB Output is correct
73 Correct 11 ms 1240 KB Output is correct
74 Correct 10 ms 1276 KB Output is correct
75 Correct 11 ms 1256 KB Output is correct
76 Correct 10 ms 1232 KB Output is correct
77 Correct 10 ms 1308 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 1 ms 436 KB Output is correct
85 Correct 0 ms 440 KB Output is correct
86 Correct 1 ms 440 KB Output is correct
87 Correct 1 ms 444 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 1 ms 436 KB Output is correct
95 Correct 1 ms 444 KB Output is correct
96 Correct 1 ms 440 KB Output is correct
97 Correct 1 ms 436 KB Output is correct
98 Correct 1 ms 440 KB Output is correct
99 Correct 1 ms 444 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 1 ms 444 KB Output is correct
102 Correct 1 ms 444 KB Output is correct
103 Correct 0 ms 440 KB Output is correct
104 Correct 1 ms 444 KB Output is correct
105 Correct 0 ms 440 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 1 ms 340 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 1 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 1 ms 440 KB Output is correct
119 Correct 0 ms 440 KB Output is correct
120 Correct 1 ms 444 KB Output is correct
121 Correct 1 ms 440 KB Output is correct
122 Correct 1 ms 436 KB Output is correct
123 Correct 1 ms 440 KB Output is correct