oj.uz

Submission #833717

# Submission time Handle Problem Language Result Execution time Memory
833717 2023-08-22T08:13:46 Z CSQ31 Chorus (JOI23_chorus) C++17
100 / 100
 1773 ms 39908 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 1e6+5;
int a[MAXN],seg[MAXN],n,k;
ll dp[MAXN],p[MAXN];
struct line{
	ll m = 0,c = 0;
	int cnt = 0;
	line(){}
	line(ll _m,ll _c,int _cnt):m(_m),c(_c),cnt(_cnt){}
	ll eval(ll x){return m*x+c;}
};
deque<line>hull;
void add(line t){
	while(sz(hull)>1){
		line a = hull[sz(hull)-2];
		line b = hull[sz(hull)-1];
		//inter(t,a) >=  inter(t,b)
		if((t.c - a.c) * (b.m - t.m) >= (a.m - t.m) * (t.c - b.c))hull.pop_back();
		else break;
	}	
	hull.push_back(t);
}
ll query(ll x){
	while(sz(hull)>1 && hull[1].eval(x) >= hull[0].eval(x)){
		//hull[1].cnt = max(hull[1].cnt,hull[0].cnt);
		hull.pop_front();
	}
	return hull[0].eval(x);
}
int find(ll x){
	hull.clear();
	int l = -1;
	for(int i=1;i<=n;i++){
		while(l+1<i && a[l+1] <= i){
			l++;
			add(line(l,-p[l]-dp[l],seg[l]));
		}
		if(l+1==i && a[i] <= i){
			dp[i] = i*1LL*i - p[i] - query(i) + x;
			seg[i] = seg[hull[0].m]+1;
		}else{
			dp[i] = l*1LL*i - p[l] - query(i) + x;
			seg[i] = seg[hull[0].m]+1;
		}
	}
	/*
	cout<<x<<'\n';
	for(int i=1;i<=n;i++)cout<<dp[i]<<" ";
	cout<<'\n';
	for(int i=1;i<=n;i++)cout<<seg[i]<<" ";
	cout<<'\n';
	* */
	return seg[n];
	
}
int main()
{
	owo
	string s;
	cin>>n>>k>>s;
	int cur = 0,nxt = 0;
	for(int i=0;i<2*n;i++){
		if(s[i] == 'A')cur++;
		else a[++nxt] = cur;
	}
	//for(int i=1;i<=n;i++)cout<<a[i]<<" ";
	//cout<<'\n';
	
	for(int i=1;i<=n;i++)p[i] = p[i-1]+a[i];
	ll l = 0,r = n*1LL*n;
	while(r>l){
		ll m = (l+r+1)/2;
		if(find(m)<k)r = m-1;
		else l = m;
	}
	find(r);
	cout<<dp[n] - k*1LL*r;
}

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 6 ms 468 KB Output is correct
30 Correct 6 ms 468 KB Output is correct
31 Correct 5 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 6 ms 468 KB Output is correct
37 Correct 5 ms 468 KB Output is correct
38 Correct 3 ms 468 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 4 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 6 ms 468 KB Output is correct
30 Correct 6 ms 468 KB Output is correct
31 Correct 5 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 6 ms 468 KB Output is correct
37 Correct 5 ms 468 KB Output is correct
38 Correct 3 ms 468 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 4 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 72 ms 2388 KB Output is correct
44 Correct 126 ms 3936 KB Output is correct
45 Correct 150 ms 4044 KB Output is correct
46 Correct 67 ms 3808 KB Output is correct
47 Correct 73 ms 4312 KB Output is correct
48 Correct 83 ms 4312 KB Output is correct
49 Correct 90 ms 4312 KB Output is correct
50 Correct 140 ms 3936 KB Output is correct
51 Correct 145 ms 3936 KB Output is correct
52 Correct 84 ms 4312 KB Output is correct
53 Correct 85 ms 4312 KB Output is correct
54 Correct 139 ms 4064 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 6 ms 468 KB Output is correct
30 Correct 6 ms 468 KB Output is correct
31 Correct 5 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 6 ms 468 KB Output is correct
37 Correct 5 ms 468 KB Output is correct
38 Correct 3 ms 468 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 4 ms 468 KB Output is correct
42 Correct 4 ms 468 KB Output is correct
43 Correct 72 ms 2388 KB Output is correct
44 Correct 126 ms 3936 KB Output is correct
45 Correct 150 ms 4044 KB Output is correct
46 Correct 67 ms 3808 KB Output is correct
47 Correct 73 ms 4312 KB Output is correct
48 Correct 83 ms 4312 KB Output is correct
49 Correct 90 ms 4312 KB Output is correct
50 Correct 140 ms 3936 KB Output is correct
51 Correct 145 ms 3936 KB Output is correct
52 Correct 84 ms 4312 KB Output is correct
53 Correct 85 ms 4312 KB Output is correct
54 Correct 139 ms 4064 KB Output is correct
55 Correct 973 ms 23920 KB Output is correct
56 Correct 1272 ms 37728 KB Output is correct
57 Correct 1577 ms 36844 KB Output is correct
58 Correct 766 ms 34796 KB Output is correct
59 Correct 986 ms 39908 KB Output is correct
60 Correct 1035 ms 39760 KB Output is correct
61 Correct 1037 ms 39836 KB Output is correct
62 Correct 1711 ms 36912 KB Output is correct
63 Correct 1773 ms 36908 KB Output is correct
64 Correct 1038 ms 39792 KB Output is correct
65 Correct 1035 ms 39800 KB Output is correct
66 Correct 1724 ms 37216 KB Output is correct
67 Correct 1016 ms 39756 KB Output is correct