oj.uz

Submission #754160

# Submission time Handle Problem Language Result Execution time Memory
754160 2023-06-07T04:06:21 Z vjudge1 JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 14 ms 5536 KB 
//srand(time(0)) - always changing
//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fopen(s) freopen(s".in","r",stdin);freopen(s".out","w",stdout)
#define all(x) (x).begin(), (x).end()
#define len(x) (int)x.size()
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define elif else if
#define F first
#define S second
#define int long long

typedef unsigned long long ull;
typedef long long ll;

using namespace std;
using namespace __gnu_pbds;

const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
const int P = 911;
const ll INF = 1e18;

int gcd(int a, int b) {
	while (b) {
		a %= b;
		swap (a, b);
	}
	return a;
}

ll __sqrt(ll x) {
	ll result = 0;
	for (ll k = 1ll << 30; k != 0; k >>= 1) {
		if ((result + k) * (result + k) <= x) {
			result += k;
		}
	}
	return result;
}

int pj[N], po[N], pi[N];

void solve() {
	int n, k, ans = INF;
	string s;
	cin >> n >> k >> s;
	s = "*" + s;
	for (int i = 1; i <= n; i++) {
		pj[i] = pj[i - 1] + (s[i] == 'J');
		po[i] = po[i - 1] + (s[i] == 'O');
		pi[i] = pi[i - 1] + (s[i] == 'I');
	}
	for (int i = 1; i <= n; i++) {
		if (s[i] != 'J') continue;
		if (pj[n] - pj[i - 1] < k) break;
		int l = i, r = n;
		while (l <= r) {
			int m = l + r >> 1;
			if (pj[m] - pj[i - 1] < k) l = m + 1;
			else r = m - 1;
		}
		int A = l;
		l = A + 1;
		r = n;
		if (po[n] - po[A] < k) break;
		while (l <= r) {
			int m = l + r >> 1;
			if (po[m] - po[A] < k) l = m + 1;
			else r = m - 1;
		}
		int B = l;
		l = B + 1;
		r = n;
		if (pi[n] - pi[B] < k) break;
		while (l <= r) {
			int m = l + r >> 1;
			if (pi[m] - pi[B] < k) l = m + 1;
			else r = m - 1;
		}
		ans = min(ans, l - i + 1 - (k * 3));
//		cout << ' ' << i << ' ' << l << '\n';
	}
	if (ans == INF) ans = -1;
	cout << ans;
}

const bool Cases = 0;

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int TT = 1;
	if (Cases) cin >> TT;
	while (TT--) {
		solve();
	}
}

Compilation message

ho_t2.cpp: In function 'void solve()':
ho_t2.cpp:68:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |    int m = l + r >> 1;
      |            ~~^~~
ho_t2.cpp:77:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |    int m = l + r >> 1;
      |            ~~^~~
ho_t2.cpp:86:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |    int m = l + r >> 1;
      |            ~~^~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
36 Correct 11 ms 5160 KB Output is correct
37 Correct 11 ms 5532 KB Output is correct
38 Correct 10 ms 5532 KB Output is correct
39 Correct 12 ms 5404 KB Output is correct
40 Correct 6 ms 5532 KB Output is correct
41 Correct 11 ms 5536 KB Output is correct
42 Correct 14 ms 5528 KB Output is correct
43 Correct 2 ms 3668 KB Output is correct
44 Correct 3 ms 4396 KB Output is correct
45 Correct 4 ms 5508 KB Output is correct
46 Correct 4 ms 5532 KB Output is correct
47 Correct 4 ms 5532 KB Output is correct
48 Correct 4 ms 5532 KB Output is correct
49 Correct 2 ms 3676 KB Output is correct
50 Correct 4 ms 5532 KB Output is correct
51 Correct 4 ms 5508 KB Output is correct
52 Correct 4 ms 5280 KB Output is correct
53 Correct 4 ms 5528 KB Output is correct
54 Correct 10 ms 5516 KB Output is correct
55 Correct 6 ms 5532 KB Output is correct
56 Correct 3 ms 5532 KB Output is correct