oj.uz

답안 #201050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201050 2020-02-09T08:19:56 Z a1_N Bigger segments (IZhO19_segments) C++17
37 / 100
 196 ms 74232 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define int long long

using namespace std;

const int N = (int)5e5 + 5;
const long long M = (long long)5e14;
    
int n,timer = 1,a[N],L[N * 10],R[N * 10];

pair<int,int> t[N * 4];

long long pref[N];

pair<int,long long> dp[N];

pair<int,int> ZeroPair = {0,0};

/*
struct tree{
	tree *left,*right;
	pair<int,int> mx;
	tree(): left(NULL), right(NULL), mx(ZeroPair) {}
}; 

tree *root = new tree();

pair<int,int> get_mx(tree *t){
	return (t != NULL) ? (t->mx) : ZeroPair;
}

void upd(tree *t,long long tl,long long tr,long long pos,pair<int,int> val){
	if(tl == tr){
		t->mx = val;
		return;
	}
	long long tm = (tl + tr) / 2;
	if(pos <= tm){
		if(t->left == NULL) t->left = new tree();
		upd(t->left,tl,tm,pos,val);		
	}
	else{
		if(t->right == NULL) t->right = new tree();
		upd(t->right,tm + 1,tr,pos,val);	
	}
	t->mx = max(get_mx(t->left),get_mx(t->right));
}

pair<int,int> get(tree *t,long long tl,long long tr,long long l,long long r){
	if(l <= tl && tr <= r) return t->mx;
	if(l > tr || r < tl) return ZeroPair;
	long long tm = (tl + tr) / 2;
	pair<int,int> mx1 = (t->left != NULL) ? get(t->left,tl,tm,l,r) : ZeroPair;
	pair<int,int> mx2 = (t->right != NULL) ? get(t->right,tm + 1,tr,l,r) : ZeroPair;
	return max(mx1,mx2);
}
*/

void upd(int v,long long tl,long long tr,long long pos,pair<int,int> val){
	if(tl == tr){
		t[v] = val;
		return;
	}
	long long tm = (tl + tr) >> 1;
	if(pos <= tm){
		if(!L[v]) L[v] = ++timer;
		upd(L[v],tl,tm,pos,val);
	}
	else{
		if(!R[v]) R[v] = ++timer;
		upd(R[v],tm + 1,tr,pos,val);
	}
	t[v] = max(t[L[v]],t[R[v]]);
}

pair<int,int> get(int v,long long tl,long long tr,long long l,long long r){
	if(l <= tl && tr <= r) return t[v];
	if(tl > r || tr < l) return ZeroPair;
	long long tm = (tl + tr) >> 1;
	return max(get(L[v],tl,tm,l,r),get(R[v],tm + 1,tr,l,r));
}

main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	dp[1] = {1,a[1]};
	upd(1,1,M,pref[1] + dp[1].S,make_pair(dp[1].F,1));
	for(int i = 2; i <= n; i++){
		dp[i] = {dp[i - 1].F,dp[i - 1].S + a[i]};
		pair<int,int> cur = get(1,1,M,1,pref[i]);
		if(cur.F > 0) dp[i] = {cur.F + 1,pref[i] - pref[cur.S]};
		/* pref[i] - pref[j] >= dp[j].S 
			pref[i] >= pref[j] + dp[j].S

			1) we update value in position pref[j] + dp[j].S
			2) when we want to find answer satisfying condition for this position we use segment tree
		*/
		upd(1,1,M,pref[i] + dp[i].S,make_pair(dp[i].F,i));	
	}
	cout << dp[n].F;
	return 0;
}

Compilation message

segments.cpp:86:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 888 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 888 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 504 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 888 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 888 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 9 ms 2040 KB Output is correct
32 Correct 10 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 11 ms 3320 KB Output is correct
36 Correct 14 ms 3308 KB Output is correct
37 Correct 10 ms 2812 KB Output is correct
38 Correct 9 ms 2296 KB Output is correct
39 Correct 8 ms 888 KB Output is correct
40 Correct 11 ms 3192 KB Output is correct
41 Correct 8 ms 888 KB Output is correct
42 Correct 8 ms 1272 KB Output is correct
43 Correct 9 ms 760 KB Output is correct
44 Correct 9 ms 1656 KB Output is correct
45 Correct 9 ms 1656 KB Output is correct

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 888 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 888 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 9 ms 2040 KB Output is correct
32 Correct 10 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 11 ms 3320 KB Output is correct
36 Correct 14 ms 3308 KB Output is correct
37 Correct 10 ms 2812 KB Output is correct
38 Correct 9 ms 2296 KB Output is correct
39 Correct 8 ms 888 KB Output is correct
40 Correct 11 ms 3192 KB Output is correct
41 Correct 8 ms 888 KB Output is correct
42 Correct 8 ms 1272 KB Output is correct
43 Correct 9 ms 760 KB Output is correct
44 Correct 9 ms 1656 KB Output is correct
45 Correct 9 ms 1656 KB Output is correct
46 Correct 138 ms 37880 KB Output is correct
47 Correct 154 ms 42868 KB Output is correct
48 Incorrect 196 ms 74232 KB Output isn't correct
49 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 632 KB Output is correct
17 Correct 6 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 888 KB Output is correct
20 Correct 6 ms 892 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 888 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 9 ms 2040 KB Output is correct
32 Correct 10 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 11 ms 3320 KB Output is correct
36 Correct 14 ms 3308 KB Output is correct
37 Correct 10 ms 2812 KB Output is correct
38 Correct 9 ms 2296 KB Output is correct
39 Correct 8 ms 888 KB Output is correct
40 Correct 11 ms 3192 KB Output is correct
41 Correct 8 ms 888 KB Output is correct
42 Correct 8 ms 1272 KB Output is correct
43 Correct 9 ms 760 KB Output is correct
44 Correct 9 ms 1656 KB Output is correct
45 Correct 9 ms 1656 KB Output is correct
46 Correct 138 ms 37880 KB Output is correct
47 Correct 154 ms 42868 KB Output is correct
48 Incorrect 196 ms 74232 KB Output isn't correct
49 Halted 0 ms 0 KB -