Submission #173035

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
173035	2020-01-03T07:30:22 Z	LinusTorvaldsFan	Bigger segments (IZhO19_segments)	C++14	73 / 100	1026 ms	262148 KB

segments

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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

pair<int,int> get(Node *root, ll l, ll r, ll lx, ll rx){
	if(l>rx || lx>r) {
		return {0,0};
	}
	if(l<=lx && rx<=r){
		return root->val;
	}
	ll mx=(lx+rx)/2;
	pair<int,int> ans={0,0};
	if(root->right!=nullptr){
		ans=max(ans,get(root->right,l,r, mx+1, rx));
	}
	if(root->left!=nullptr){
		ans=max(ans,get(root->left,l,r, lx, mx));
	}
	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;
	update(tree,ans_sum[0]+pr[1],ans[0],0, 0, 1e15);
	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],0,1e15);
		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,0,1e15);
		}
		//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	380 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	1 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 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	380 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	1 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 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	508 KB	Output is correct
17	Correct	3 ms	632 KB	Output is correct
18	Correct	4 ms	760 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	760 KB	Output is correct
21	Correct	4 ms	876 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	760 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	504 KB	Output is correct
30	Correct	3 ms	504 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	380 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	1 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 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	508 KB	Output is correct
17	Correct	3 ms	632 KB	Output is correct
18	Correct	4 ms	760 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	760 KB	Output is correct
21	Correct	4 ms	876 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	760 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	504 KB	Output is correct
30	Correct	3 ms	504 KB	Output is correct
31	Correct	8 ms	1912 KB	Output is correct
32	Correct	9 ms	2424 KB	Output is correct
33	Correct	10 ms	2808 KB	Output is correct
34	Correct	10 ms	2680 KB	Output is correct
35	Correct	12 ms	3320 KB	Output is correct
36	Correct	11 ms	3368 KB	Output is correct
37	Correct	9 ms	2808 KB	Output is correct
38	Correct	8 ms	2296 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	11 ms	3064 KB	Output is correct
41	Correct	6 ms	760 KB	Output is correct
42	Correct	7 ms	1144 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	8 ms	1528 KB	Output is correct
45	Correct	8 ms	1528 KB	Output is correct

Subtask #4
36.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	380 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	1 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 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	508 KB	Output is correct
17	Correct	3 ms	632 KB	Output is correct
18	Correct	4 ms	760 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	760 KB	Output is correct
21	Correct	4 ms	876 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	760 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	504 KB	Output is correct
30	Correct	3 ms	504 KB	Output is correct
31	Correct	8 ms	1912 KB	Output is correct
32	Correct	9 ms	2424 KB	Output is correct
33	Correct	10 ms	2808 KB	Output is correct
34	Correct	10 ms	2680 KB	Output is correct
35	Correct	12 ms	3320 KB	Output is correct
36	Correct	11 ms	3368 KB	Output is correct
37	Correct	9 ms	2808 KB	Output is correct
38	Correct	8 ms	2296 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	11 ms	3064 KB	Output is correct
41	Correct	6 ms	760 KB	Output is correct
42	Correct	7 ms	1144 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	8 ms	1528 KB	Output is correct
45	Correct	8 ms	1528 KB	Output is correct
46	Correct	171 ms	37368 KB	Output is correct
47	Correct	206 ms	42360 KB	Output is correct
48	Correct	278 ms	84164 KB	Output is correct
49	Correct	315 ms	90276 KB	Output is correct
50	Correct	342 ms	99964 KB	Output is correct
51	Correct	296 ms	98296 KB	Output is correct
52	Correct	151 ms	49272 KB	Output is correct
53	Correct	91 ms	29632 KB	Output is correct
54	Correct	155 ms	14456 KB	Output is correct
55	Correct	316 ms	95104 KB	Output is correct
56	Correct	218 ms	44280 KB	Output is correct
57	Correct	198 ms	36824 KB	Output is correct
58	Correct	211 ms	40448 KB	Output is correct
59	Correct	259 ms	57072 KB	Output is correct
60	Correct	238 ms	56740 KB	Output is correct

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	380 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	1 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 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	508 KB	Output is correct
17	Correct	3 ms	632 KB	Output is correct
18	Correct	4 ms	760 KB	Output is correct
19	Correct	4 ms	764 KB	Output is correct
20	Correct	4 ms	760 KB	Output is correct
21	Correct	4 ms	876 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	760 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	504 KB	Output is correct
30	Correct	3 ms	504 KB	Output is correct
31	Correct	8 ms	1912 KB	Output is correct
32	Correct	9 ms	2424 KB	Output is correct
33	Correct	10 ms	2808 KB	Output is correct
34	Correct	10 ms	2680 KB	Output is correct
35	Correct	12 ms	3320 KB	Output is correct
36	Correct	11 ms	3368 KB	Output is correct
37	Correct	9 ms	2808 KB	Output is correct
38	Correct	8 ms	2296 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	11 ms	3064 KB	Output is correct
41	Correct	6 ms	760 KB	Output is correct
42	Correct	7 ms	1144 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	8 ms	1528 KB	Output is correct
45	Correct	8 ms	1528 KB	Output is correct
46	Correct	171 ms	37368 KB	Output is correct
47	Correct	206 ms	42360 KB	Output is correct
48	Correct	278 ms	84164 KB	Output is correct
49	Correct	315 ms	90276 KB	Output is correct
50	Correct	342 ms	99964 KB	Output is correct
51	Correct	296 ms	98296 KB	Output is correct
52	Correct	151 ms	49272 KB	Output is correct
53	Correct	91 ms	29632 KB	Output is correct
54	Correct	155 ms	14456 KB	Output is correct
55	Correct	316 ms	95104 KB	Output is correct
56	Correct	218 ms	44280 KB	Output is correct
57	Correct	198 ms	36824 KB	Output is correct
58	Correct	211 ms	40448 KB	Output is correct
59	Correct	259 ms	57072 KB	Output is correct
60	Correct	238 ms	56740 KB	Output is correct
61	Correct	820 ms	172972 KB	Output is correct
62	Correct	888 ms	166624 KB	Output is correct
63	Correct	1026 ms	211016 KB	Output is correct
64	Runtime error	869 ms	262148 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
65	Halted	0 ms	0 KB	-

Submission #173035

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 10.0 / 10.0

Subtask #4 36.0 / 36.0

Subtask #5 0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
10.0 / 10.0

Subtask #4
36.0 / 36.0

Subtask #5
0 / 27.0