답안 #172970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172970	2020-01-02T21:39:26 Z	LinusTorvaldsFan	Bigger segments (IZhO19_segments)	C++14	73 / 100	1058 ms	262148 KB

segments

#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) {
	//cout<<root->l<<" "<<root->r<<endl;
	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);
	}
	else{
		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() {
	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,1e15);
	update(tree,ans_sum[0]+pr[1],ans[0],0);
	for(int i=1;i<n;i++){
	/*
		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;
		*/
		auto t=get(tree,0,pr[i+1]);
		//cout<<pr[i+1]<<endl;
		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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	252 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	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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	252 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	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	632 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	1016 KB	Output is correct
19	Correct	4 ms	888 KB	Output is correct
20	Correct	4 ms	1020 KB	Output is correct
21	Correct	4 ms	1016 KB	Output is correct
22	Correct	3 ms	888 KB	Output is correct
23	Correct	3 ms	760 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	1016 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	636 KB	Output is correct
30	Correct	3 ms	632 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	252 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	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	632 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	1016 KB	Output is correct
19	Correct	4 ms	888 KB	Output is correct
20	Correct	4 ms	1020 KB	Output is correct
21	Correct	4 ms	1016 KB	Output is correct
22	Correct	3 ms	888 KB	Output is correct
23	Correct	3 ms	760 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	1016 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	636 KB	Output is correct
30	Correct	3 ms	632 KB	Output is correct
31	Correct	9 ms	2680 KB	Output is correct
32	Correct	11 ms	3320 KB	Output is correct
33	Correct	12 ms	3960 KB	Output is correct
34	Correct	12 ms	3832 KB	Output is correct
35	Correct	15 ms	4728 KB	Output is correct
36	Correct	14 ms	4728 KB	Output is correct
37	Correct	11 ms	3960 KB	Output is correct
38	Correct	10 ms	3192 KB	Output is correct
39	Correct	6 ms	888 KB	Output is correct
40	Correct	14 ms	4472 KB	Output is correct
41	Correct	6 ms	888 KB	Output is correct
42	Correct	8 ms	1528 KB	Output is correct
43	Correct	6 ms	888 KB	Output is correct
44	Correct	9 ms	2168 KB	Output is correct
45	Correct	9 ms	2168 KB	Output is correct

Subtask #4
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	252 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	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	632 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	1016 KB	Output is correct
19	Correct	4 ms	888 KB	Output is correct
20	Correct	4 ms	1020 KB	Output is correct
21	Correct	4 ms	1016 KB	Output is correct
22	Correct	3 ms	888 KB	Output is correct
23	Correct	3 ms	760 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	1016 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	636 KB	Output is correct
30	Correct	3 ms	632 KB	Output is correct
31	Correct	9 ms	2680 KB	Output is correct
32	Correct	11 ms	3320 KB	Output is correct
33	Correct	12 ms	3960 KB	Output is correct
34	Correct	12 ms	3832 KB	Output is correct
35	Correct	15 ms	4728 KB	Output is correct
36	Correct	14 ms	4728 KB	Output is correct
37	Correct	11 ms	3960 KB	Output is correct
38	Correct	10 ms	3192 KB	Output is correct
39	Correct	6 ms	888 KB	Output is correct
40	Correct	14 ms	4472 KB	Output is correct
41	Correct	6 ms	888 KB	Output is correct
42	Correct	8 ms	1528 KB	Output is correct
43	Correct	6 ms	888 KB	Output is correct
44	Correct	9 ms	2168 KB	Output is correct
45	Correct	9 ms	2168 KB	Output is correct
46	Correct	192 ms	54276 KB	Output is correct
47	Correct	237 ms	61944 KB	Output is correct
48	Correct	352 ms	124408 KB	Output is correct
49	Correct	385 ms	133752 KB	Output is correct
50	Correct	432 ms	147960 KB	Output is correct
51	Correct	397 ms	145572 KB	Output is correct
52	Correct	210 ms	72952 KB	Output is correct
53	Correct	119 ms	43900 KB	Output is correct
54	Correct	154 ms	20144 KB	Output is correct
55	Correct	408 ms	140900 KB	Output is correct
56	Correct	249 ms	64760 KB	Output is correct
57	Correct	221 ms	53724 KB	Output is correct
58	Correct	242 ms	59104 KB	Output is correct
59	Correct	291 ms	83832 KB	Output is correct
60	Correct	284 ms	83448 KB	Output is correct

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	252 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	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	632 KB	Output is correct
17	Correct	4 ms	876 KB	Output is correct
18	Correct	4 ms	1016 KB	Output is correct
19	Correct	4 ms	888 KB	Output is correct
20	Correct	4 ms	1020 KB	Output is correct
21	Correct	4 ms	1016 KB	Output is correct
22	Correct	3 ms	888 KB	Output is correct
23	Correct	3 ms	760 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	4 ms	1016 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	636 KB	Output is correct
30	Correct	3 ms	632 KB	Output is correct
31	Correct	9 ms	2680 KB	Output is correct
32	Correct	11 ms	3320 KB	Output is correct
33	Correct	12 ms	3960 KB	Output is correct
34	Correct	12 ms	3832 KB	Output is correct
35	Correct	15 ms	4728 KB	Output is correct
36	Correct	14 ms	4728 KB	Output is correct
37	Correct	11 ms	3960 KB	Output is correct
38	Correct	10 ms	3192 KB	Output is correct
39	Correct	6 ms	888 KB	Output is correct
40	Correct	14 ms	4472 KB	Output is correct
41	Correct	6 ms	888 KB	Output is correct
42	Correct	8 ms	1528 KB	Output is correct
43	Correct	6 ms	888 KB	Output is correct
44	Correct	9 ms	2168 KB	Output is correct
45	Correct	9 ms	2168 KB	Output is correct
46	Correct	192 ms	54276 KB	Output is correct
47	Correct	237 ms	61944 KB	Output is correct
48	Correct	352 ms	124408 KB	Output is correct
49	Correct	385 ms	133752 KB	Output is correct
50	Correct	432 ms	147960 KB	Output is correct
51	Correct	397 ms	145572 KB	Output is correct
52	Correct	210 ms	72952 KB	Output is correct
53	Correct	119 ms	43900 KB	Output is correct
54	Correct	154 ms	20144 KB	Output is correct
55	Correct	408 ms	140900 KB	Output is correct
56	Correct	249 ms	64760 KB	Output is correct
57	Correct	221 ms	53724 KB	Output is correct
58	Correct	242 ms	59104 KB	Output is correct
59	Correct	291 ms	83832 KB	Output is correct
60	Correct	284 ms	83448 KB	Output is correct
61	Correct	930 ms	252444 KB	Output is correct
62	Correct	994 ms	242944 KB	Output is correct
63	Runtime error	1058 ms	262148 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
64	Halted	0 ms	0 KB	-

답안 #172970

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