oj.uz

Submission #1098584

# Submission time Handle Problem Language Result Execution time Memory
1098584 2024-10-09T15:54:31 Z Nurislam JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 47 ms 14952 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> 
//#include <ext/pb_ds/tree_policy.hpp>  
using namespace std;
//using namespace __gnu_pbds;z
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
//#define ordst tree<pair<int,int>,  null_type,  less<pair<int,int>>,  rb_tree_tag ,  tree_order_statistics_node_update >
//#define double long double 
template <class F, class _S>
bool chmin(F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v; flag |= true;
	}
	return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v; flag |= true;
	}
	return flag;
}

const int N = (1<<18) +1, inf = 1e18+200;
//int mod = 998244353;
//int mod = 1000000007;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)
void solve(){
	map<char,int> mp;
	mp['J'] = 0;
	mp['O'] = 1;
	mp['I'] = 2;
	vector<int> a;a.pb(-1);
	
	auto conv = [&](string s)->void{
		for(auto &i:s)a.pb(mp[i]);
	};
	
	int n, k;
	cin >> n >> k;
	string s;cin >> s;conv(s);
	vector<vector<int>> pref(n+1, vector<int> (3, 0));
	for(int i = 1; i <= n; i++){
		for(int j = 0; j < 3; j++)
			pref[i][j] = pref[i-1][j];
		pref[i][a[i]]++;
	}
	auto get = [&](int l, int r, int t) -> int{
		return pref[r][t] - pref[l-1][t];
	};
	
	vector<int> v;
	for(int i = 1; i <= n; i++)if(a[i] == 1)v.pb(i);
	
	int ans = -1;
	for(int i = 0; i < v.size(); i++){
		if(i+k-1 == v.size())break;
		
		int l = v[i], r = v[i+k-1];
		int tol = l;
		for(int i = 20; i >= 0; i--){
			int nwl = max(1ll, tol-(1<<i));
			if(get(nwl, l, 0) >= k)continue;
			tol = nwl;
		}
		tol--;
		int tor = r;
		for(int i = 20; i >= 0; i--){
			int nwr = min(n, tor+(1<<i));
			if(get(r, nwr, 2) >= k)continue;
			tor = nwr;
		}
		tor++;
		if(get(1, l, 0) < k || get(r, n, 2) < k)continue;
		if(ans == -1)ans = tor-tol+1 - k*3;
		chmin(ans, tor-tol+1 - k*3);
	}
	
	
	cout << ans << '\n';
}

 
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--){
		solve();
	}
}

Compilation message

ho_t2.cpp: In function 'void solve()':
ho_t2.cpp:65:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for(int i = 0; i < v.size(); i++){
      |                 ~~^~~~~~~~~~
ho_t2.cpp:66:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   if(i+k-1 == v.size())break;
      |      ~~~~~~^~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 660 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 35 ms 13472 KB Output is correct
37 Correct 47 ms 14904 KB Output is correct
38 Correct 41 ms 14740 KB Output is correct
39 Correct 38 ms 14740 KB Output is correct
40 Correct 25 ms 14740 KB Output is correct
41 Correct 32 ms 14740 KB Output is correct
42 Correct 37 ms 14740 KB Output is correct
43 Correct 14 ms 9168 KB Output is correct
44 Correct 22 ms 11196 KB Output is correct
45 Correct 22 ms 14740 KB Output is correct
46 Correct 22 ms 14736 KB Output is correct
47 Correct 22 ms 14740 KB Output is correct
48 Correct 22 ms 14952 KB Output is correct
49 Correct 15 ms 9684 KB Output is correct
50 Correct 23 ms 14868 KB Output is correct
51 Correct 22 ms 14740 KB Output is correct
52 Correct 14 ms 13724 KB Output is correct
53 Correct 15 ms 14740 KB Output is correct
54 Correct 34 ms 14708 KB Output is correct
55 Correct 24 ms 14740 KB Output is correct
56 Correct 13 ms 14736 KB Output is correct