oj.uz

Submission #200529

# Submission time Handle Problem Language Result Execution time Memory
200529 2020-02-07T06:18:43 Z a1_N Bigger segments (IZhO19_segments) C++14
37 / 100
 1500 ms 133160 KB 
#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;

const int N = 5e5 + 5;
const long long M = (long long)1e15;

int n,a[N];

long long pref[N];

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

int slow(){
	for(int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i];
	dp[1] = {1,a[1]};
	for(int i = 2; i <= n; i++){
		dp[i] = {dp[i - 1].F,dp[i - 1].S + a[i]};
		for(int j = i - 1; j >= 1; j--){
			if(pref[i] - pref[j] >= dp[j].S && dp[i].F <= dp[j].F + 1){
				dp[i] = {dp[j].F + 1,pref[i] - pref[j]};
				break;
			}
		}
	}
	return dp[n].F;
}

map< long long,pair<long long,long long> > t;

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

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

int fast(){
	for(int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i],dp[i] = {0,0};
	dp[1] = {1,a[1]};
	upd(pref[1] + dp[1].S,{dp[1].F,1});
	// update in position pref[i] + dp[i].second -> {dp[i].first,postition}
	for(int i = 2; i <= n; i++){
		dp[i] = {dp[i - 1].F,dp[i - 1].S + a[i]};
		pair<long long,long long> cur = get(1,pref[i]);
		//cerr << cur.F << " " << cur.S << endl;
		if(cur.F > 0) dp[i] = {cur.F + 1,pref[i] - pref[cur.S]};
		upd(pref[i] + dp[i].S,{dp[i].F,i});	
	}
	return dp[n].F;
}

int 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];
	/*
	cout << "Exact Solution,SLOW " << slow() << endl;
	cout << "Not Exact,FAST " << fast();	
	*/
	cout << fast();
	return 0;
}

Compilation message

segments.cpp: In function 'void upd(long long int, std::pair<long long int, long long int>, long long int, long long int, long long int)':
segments.cpp:39:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  long long tm = tl + tr >> 1;
                 ~~~^~~~
segments.cpp: In function 'std::pair<long long int, long long int> get(long long int, long long int, long long int, long long int, long long int)':
segments.cpp:48:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  long long tm = tl + tr >> 1;
                 ~~~^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 408 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 376 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 408 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 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 12 ms 1448 KB Output is correct
17 Correct 15 ms 2200 KB Output is correct
18 Correct 17 ms 2472 KB Output is correct
19 Correct 14 ms 2168 KB Output is correct
20 Correct 14 ms 2168 KB Output is correct
21 Correct 17 ms 2552 KB Output is correct
22 Correct 14 ms 2168 KB Output is correct
23 Correct 12 ms 1664 KB Output is correct
24 Correct 9 ms 632 KB Output is correct
25 Correct 16 ms 2424 KB Output is correct
26 Correct 9 ms 680 KB Output is correct
27 Correct 8 ms 504 KB Output is correct
28 Correct 8 ms 504 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 10 ms 888 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 408 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 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 12 ms 1448 KB Output is correct
17 Correct 15 ms 2200 KB Output is correct
18 Correct 17 ms 2472 KB Output is correct
19 Correct 14 ms 2168 KB Output is correct
20 Correct 14 ms 2168 KB Output is correct
21 Correct 17 ms 2552 KB Output is correct
22 Correct 14 ms 2168 KB Output is correct
23 Correct 12 ms 1664 KB Output is correct
24 Correct 9 ms 632 KB Output is correct
25 Correct 16 ms 2424 KB Output is correct
26 Correct 9 ms 680 KB Output is correct
27 Correct 8 ms 504 KB Output is correct
28 Correct 8 ms 504 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 10 ms 888 KB Output is correct
31 Correct 59 ms 7524 KB Output is correct
32 Correct 67 ms 9592 KB Output is correct
33 Correct 79 ms 11512 KB Output is correct
34 Correct 84 ms 9872 KB Output is correct
35 Correct 79 ms 11512 KB Output is correct
36 Correct 101 ms 13960 KB Output is correct
37 Correct 79 ms 11768 KB Output is correct
38 Correct 61 ms 9464 KB Output is correct
39 Correct 27 ms 1656 KB Output is correct
40 Correct 97 ms 12280 KB Output is correct
41 Correct 28 ms 1528 KB Output is correct
42 Correct 40 ms 3320 KB Output is correct
43 Correct 26 ms 1400 KB Output is correct
44 Correct 47 ms 4728 KB Output is correct
45 Correct 51 ms 4988 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 408 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 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 12 ms 1448 KB Output is correct
17 Correct 15 ms 2200 KB Output is correct
18 Correct 17 ms 2472 KB Output is correct
19 Correct 14 ms 2168 KB Output is correct
20 Correct 14 ms 2168 KB Output is correct
21 Correct 17 ms 2552 KB Output is correct
22 Correct 14 ms 2168 KB Output is correct
23 Correct 12 ms 1664 KB Output is correct
24 Correct 9 ms 632 KB Output is correct
25 Correct 16 ms 2424 KB Output is correct
26 Correct 9 ms 680 KB Output is correct
27 Correct 8 ms 504 KB Output is correct
28 Correct 8 ms 504 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 10 ms 888 KB Output is correct
31 Correct 59 ms 7524 KB Output is correct
32 Correct 67 ms 9592 KB Output is correct
33 Correct 79 ms 11512 KB Output is correct
34 Correct 84 ms 9872 KB Output is correct
35 Correct 79 ms 11512 KB Output is correct
36 Correct 101 ms 13960 KB Output is correct
37 Correct 79 ms 11768 KB Output is correct
38 Correct 61 ms 9464 KB Output is correct
39 Correct 27 ms 1656 KB Output is correct
40 Correct 97 ms 12280 KB Output is correct
41 Correct 28 ms 1528 KB Output is correct
42 Correct 40 ms 3320 KB Output is correct
43 Correct 26 ms 1400 KB Output is correct
44 Correct 47 ms 4728 KB Output is correct
45 Correct 51 ms 4988 KB Output is correct
46 Execution timed out 1582 ms 133160 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 408 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 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 12 ms 1448 KB Output is correct
17 Correct 15 ms 2200 KB Output is correct
18 Correct 17 ms 2472 KB Output is correct
19 Correct 14 ms 2168 KB Output is correct
20 Correct 14 ms 2168 KB Output is correct
21 Correct 17 ms 2552 KB Output is correct
22 Correct 14 ms 2168 KB Output is correct
23 Correct 12 ms 1664 KB Output is correct
24 Correct 9 ms 632 KB Output is correct
25 Correct 16 ms 2424 KB Output is correct
26 Correct 9 ms 680 KB Output is correct
27 Correct 8 ms 504 KB Output is correct
28 Correct 8 ms 504 KB Output is correct
29 Correct 10 ms 888 KB Output is correct
30 Correct 10 ms 888 KB Output is correct
31 Correct 59 ms 7524 KB Output is correct
32 Correct 67 ms 9592 KB Output is correct
33 Correct 79 ms 11512 KB Output is correct
34 Correct 84 ms 9872 KB Output is correct
35 Correct 79 ms 11512 KB Output is correct
36 Correct 101 ms 13960 KB Output is correct
37 Correct 79 ms 11768 KB Output is correct
38 Correct 61 ms 9464 KB Output is correct
39 Correct 27 ms 1656 KB Output is correct
40 Correct 97 ms 12280 KB Output is correct
41 Correct 28 ms 1528 KB Output is correct
42 Correct 40 ms 3320 KB Output is correct
43 Correct 26 ms 1400 KB Output is correct
44 Correct 47 ms 4728 KB Output is correct
45 Correct 51 ms 4988 KB Output is correct
46 Execution timed out 1582 ms 133160 KB Time limit exceeded
47 Halted 0 ms 0 KB -