oj.uz

Submission #172976

# Submission time Handle Problem Language Result Execution time Memory
172976 2020-01-02T21:48:04 Z LinusTorvaldsFan Bigger segments (IZhO19_segments) C++14
37 / 100
 292 ms 124324 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Node{
	pair<int,int>val;
	ll l, r;
	Node*left;
	Node*right;
	Node(ll _l, ll _r) {
		val={0,0};
		l=_l;
		r=_r;
		left=nullptr;
		right=nullptr;
	}
};

pair<int,int>get_val(Node *root){
	if(root==nullptr)return make_pair(0,0);
	return root->val;
}

void update(Node *root, ll p, int x, int y) {
	if(root->l==p && root->r==p){
		root->val=max(make_pair(x,y),root->val);
		return;
	}
	
	ll m=(root->l+root->r)/2;
	if(root->l<=p&&p<=m){
		if(root->left==nullptr){
			root->left=new Node(root->l,m);
		}
		update(root->left,p,x,y);
	}
	if(m+1<=p&&p<=root->r){
		if(root->right==nullptr){
			root->right=new Node(m+1,root->r);
		}
		update(root->right,p,x,y);
	}
	root->val=max(get_val(root->left),get_val(root->right));
}

pair<int,int> get(Node *root, ll l, ll r){
	if(l>root->r || root->l>r) {
		return {0,0};
	}
	if(l<=root->l && root->r<=r){
		return root->val;
	}
	pair<int,int> ans={0,0};
	if(root->right!=nullptr){
		ans=max(ans,get(root->right,l,r));
	}
	if(root->left!=nullptr){
		ans=max(ans,get(root->left,l,r));
	}
	return ans;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++)cin>>a[i];
	
	vector<ll>pr(n+1);
	for(int i=0;i<n;i++)pr[i+1]=pr[i]+a[i];
	vector<int>ans(n);
	vector<ll> ans_sum(n);
	ll sum=0;
	for(int i=0;i<n;i++){
		sum+=a[i];
		ans_sum[i]=sum;
		ans[i]=1;
	}
	Node *tree=new Node(0,1e13);
	update(tree,ans_sum[0]+pr[1],ans[0],0);
	for(int i=1;i<n;i++){
		if(n<=100){
		for(int j=i-1;j>=0;j--){
			if(pr[i+1]>=ans_sum[j]+pr[j+1]){
				if(ans[i]<ans[j]+1){
					ans[i]=ans[j]+1;
					ans_sum[i]=pr[i+1]-pr[j+1];
				}
			}
		}
		//cout<<ans[i]<<" ";
		//cout<<ans_sum[i]<<" ";
		//cout<<endl;
		}
		else{
		auto t=get(tree,0,pr[i+1]);
		if(pr[i+1]>=ans_sum[t.second]+pr[t.second+1]){
			if(ans[i]<t.first+1){
				ans[i]=t.first+1;
				ans_sum[i]=pr[i+1]-pr[t.second+1];
			}	
		}
		update(tree,ans_sum[i]+pr[i+1],ans[i],i);
		}
		//cout<<ans[i]<<" ";
		//cout<<ans_sum[i]<<" ";
		//cout<<endl;
	}
	cout<<ans[n-1];
	return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 888 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 4 ms 1016 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 508 KB Output is correct
25 Correct 4 ms 1020 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 632 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 888 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 4 ms 1016 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 508 KB Output is correct
25 Correct 4 ms 1020 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 632 KB Output is correct
31 Correct 8 ms 2680 KB Output is correct
32 Correct 9 ms 3320 KB Output is correct
33 Correct 11 ms 4088 KB Output is correct
34 Correct 10 ms 3832 KB Output is correct
35 Correct 13 ms 4648 KB Output is correct
36 Correct 11 ms 4728 KB Output is correct
37 Correct 10 ms 3960 KB Output is correct
38 Correct 8 ms 3320 KB Output is correct
39 Correct 6 ms 1016 KB Output is correct
40 Correct 12 ms 4472 KB Output is correct
41 Correct 5 ms 1016 KB Output is correct
42 Correct 7 ms 1656 KB Output is correct
43 Correct 5 ms 888 KB Output is correct
44 Correct 8 ms 2168 KB Output is correct
45 Correct 8 ms 2168 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 888 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 4 ms 1016 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 508 KB Output is correct
25 Correct 4 ms 1020 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 632 KB Output is correct
31 Correct 8 ms 2680 KB Output is correct
32 Correct 9 ms 3320 KB Output is correct
33 Correct 11 ms 4088 KB Output is correct
34 Correct 10 ms 3832 KB Output is correct
35 Correct 13 ms 4648 KB Output is correct
36 Correct 11 ms 4728 KB Output is correct
37 Correct 10 ms 3960 KB Output is correct
38 Correct 8 ms 3320 KB Output is correct
39 Correct 6 ms 1016 KB Output is correct
40 Correct 12 ms 4472 KB Output is correct
41 Correct 5 ms 1016 KB Output is correct
42 Correct 7 ms 1656 KB Output is correct
43 Correct 5 ms 888 KB Output is correct
44 Correct 8 ms 2168 KB Output is correct
45 Correct 8 ms 2168 KB Output is correct
46 Correct 150 ms 53980 KB Output is correct
47 Correct 193 ms 62124 KB Output is correct
48 Correct 292 ms 124324 KB Output is correct
49 Incorrect 188 ms 77048 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 888 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 4 ms 1016 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 764 KB Output is correct
24 Correct 3 ms 508 KB Output is correct
25 Correct 4 ms 1020 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 3 ms 632 KB Output is correct
31 Correct 8 ms 2680 KB Output is correct
32 Correct 9 ms 3320 KB Output is correct
33 Correct 11 ms 4088 KB Output is correct
34 Correct 10 ms 3832 KB Output is correct
35 Correct 13 ms 4648 KB Output is correct
36 Correct 11 ms 4728 KB Output is correct
37 Correct 10 ms 3960 KB Output is correct
38 Correct 8 ms 3320 KB Output is correct
39 Correct 6 ms 1016 KB Output is correct
40 Correct 12 ms 4472 KB Output is correct
41 Correct 5 ms 1016 KB Output is correct
42 Correct 7 ms 1656 KB Output is correct
43 Correct 5 ms 888 KB Output is correct
44 Correct 8 ms 2168 KB Output is correct
45 Correct 8 ms 2168 KB Output is correct
46 Correct 150 ms 53980 KB Output is correct
47 Correct 193 ms 62124 KB Output is correct
48 Correct 292 ms 124324 KB Output is correct
49 Incorrect 188 ms 77048 KB Output isn't correct
50 Halted 0 ms 0 KB -