oj.uz

Submission #231359

# Submission time Handle Problem Language Result Execution time Memory
231359 2020-05-13T12:34:19 Z maskoff Bigger segments (IZhO19_segments) C++14
37 / 100
 205 ms 149628 KB 
#include <bits/stdc++.h>
#include <ext/rope>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
 
#define file ""
 
#define all(x) x.begin(), x.end()
 
#define sc second
#define fr first
 
#define pb push_back
#define mp make_pair

#define pss pair<line*, line*>
 
using namespace std;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
                                    
const ll inf = 1e18;
const int MOD = 1e9 + 7;
                                          
const int dx[] = {+1, -1, 0, 0};
const int dy[] = {0, 0, +1, -1};

int const N = 1e6 + 5;

vector<pll> t(4 * N); 
int L[N], R[N];
int cnt = 1;

void update (ll u, ll l, ll r, ll pos, pll val) {
	if(l > r) return;
 	if (l == r) {
 	 	t[u] = val;
 	 	return;
 	}
 	ll m = l + r >> 1;
 	if (pos <= m) {
 	 	if (!L[u]) L[u] = ++cnt;
 	 	update (L[u], l, m, pos, val);
 	}
 	else {
 	 	if (!R[u]) R[u] = ++cnt;
 	 	update (R[u], m + 1, r, pos, val);
 	}
 	t[u] = max(t[L[u]], t[R[u]]);
}

pll get (ll u, ll ul, ll ur, ll l, ll r) {
 	if (!u || l > r || ul > ur || l > ur || ul > r)
 		return {0, 0};
 	if (l <= ul && ur <= r)
 		return t[u];
 	ll um = ul + ur >> 1;
 	return max(get(L[u], ul, um, l, r), get(R[u], um + 1, ur, l, r));
}

int main() {       
	ios_base :: sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<ll> a(n + 1), pref(n + 1);
  for (int i = 1; i <= n; i++)
  	cin >> a[i];
  for (int i = 1; i <= n; i++)
  	pref[i] = pref[i - 1] + a[i];
  vector<ll> dp(n + 1), sum(n + 1);

  for (int i = 1; i <= n; i++) {
  	pii k = get(1, 1, inf, 1, pref[i]);
  	dp[i] = k.fr + 1;
  	sum[i] = pref[i] - pref[k.sc];
  	update (1, 1, inf, sum[i] + pref[i], {dp[i], i});
  }
  cout << dp[n];
	return 0;
}

Compilation message

segments.cpp: In function 'void update(ll, ll, ll, ll, pll)':
segments.cpp:44:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   ll m = l + r >> 1;
          ~~^~~
segments.cpp: In function 'pll get(ll, ll, ll, ll, ll)':
segments.cpp:61:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   ll um = ul + ur >> 1;
           ~~~^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62968 KB Output is correct
2 Correct 35 ms 62968 KB Output is correct
3 Correct 37 ms 62968 KB Output is correct
4 Correct 36 ms 62976 KB Output is correct
5 Correct 35 ms 62976 KB Output is correct
6 Correct 35 ms 62976 KB Output is correct
7 Correct 35 ms 62976 KB Output is correct
8 Correct 36 ms 62976 KB Output is correct
9 Correct 38 ms 63104 KB Output is correct
10 Correct 36 ms 62976 KB Output is correct
11 Correct 35 ms 62968 KB Output is correct
12 Correct 34 ms 63024 KB Output is correct
13 Correct 35 ms 62968 KB Output is correct
14 Correct 36 ms 62968 KB Output is correct
15 Correct 41 ms 62976 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62968 KB Output is correct
2 Correct 35 ms 62968 KB Output is correct
3 Correct 37 ms 62968 KB Output is correct
4 Correct 36 ms 62976 KB Output is correct
5 Correct 35 ms 62976 KB Output is correct
6 Correct 35 ms 62976 KB Output is correct
7 Correct 35 ms 62976 KB Output is correct
8 Correct 36 ms 62976 KB Output is correct
9 Correct 38 ms 63104 KB Output is correct
10 Correct 36 ms 62976 KB Output is correct
11 Correct 35 ms 62968 KB Output is correct
12 Correct 34 ms 63024 KB Output is correct
13 Correct 35 ms 62968 KB Output is correct
14 Correct 36 ms 62968 KB Output is correct
15 Correct 41 ms 62976 KB Output is correct
16 Correct 41 ms 63096 KB Output is correct
17 Correct 36 ms 63104 KB Output is correct
18 Correct 36 ms 63104 KB Output is correct
19 Correct 36 ms 63104 KB Output is correct
20 Correct 36 ms 63104 KB Output is correct
21 Correct 36 ms 63096 KB Output is correct
22 Correct 37 ms 63096 KB Output is correct
23 Correct 37 ms 63100 KB Output is correct
24 Correct 37 ms 62968 KB Output is correct
25 Correct 35 ms 63104 KB Output is correct
26 Correct 35 ms 62968 KB Output is correct
27 Correct 35 ms 62968 KB Output is correct
28 Correct 37 ms 62968 KB Output is correct
29 Correct 36 ms 63096 KB Output is correct
30 Correct 35 ms 62976 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62968 KB Output is correct
2 Correct 35 ms 62968 KB Output is correct
3 Correct 37 ms 62968 KB Output is correct
4 Correct 36 ms 62976 KB Output is correct
5 Correct 35 ms 62976 KB Output is correct
6 Correct 35 ms 62976 KB Output is correct
7 Correct 35 ms 62976 KB Output is correct
8 Correct 36 ms 62976 KB Output is correct
9 Correct 38 ms 63104 KB Output is correct
10 Correct 36 ms 62976 KB Output is correct
11 Correct 35 ms 62968 KB Output is correct
12 Correct 34 ms 63024 KB Output is correct
13 Correct 35 ms 62968 KB Output is correct
14 Correct 36 ms 62968 KB Output is correct
15 Correct 41 ms 62976 KB Output is correct
16 Correct 41 ms 63096 KB Output is correct
17 Correct 36 ms 63104 KB Output is correct
18 Correct 36 ms 63104 KB Output is correct
19 Correct 36 ms 63104 KB Output is correct
20 Correct 36 ms 63104 KB Output is correct
21 Correct 36 ms 63096 KB Output is correct
22 Correct 37 ms 63096 KB Output is correct
23 Correct 37 ms 63100 KB Output is correct
24 Correct 37 ms 62968 KB Output is correct
25 Correct 35 ms 63104 KB Output is correct
26 Correct 35 ms 62968 KB Output is correct
27 Correct 35 ms 62968 KB Output is correct
28 Correct 37 ms 62968 KB Output is correct
29 Correct 36 ms 63096 KB Output is correct
30 Correct 35 ms 62976 KB Output is correct
31 Correct 39 ms 63480 KB Output is correct
32 Correct 37 ms 63616 KB Output is correct
33 Correct 38 ms 63736 KB Output is correct
34 Correct 40 ms 63616 KB Output is correct
35 Correct 42 ms 63736 KB Output is correct
36 Correct 40 ms 63864 KB Output is correct
37 Correct 39 ms 63744 KB Output is correct
38 Correct 39 ms 63480 KB Output is correct
39 Correct 38 ms 63104 KB Output is correct
40 Correct 40 ms 63736 KB Output is correct
41 Correct 38 ms 63128 KB Output is correct
42 Correct 38 ms 63232 KB Output is correct
43 Correct 37 ms 63116 KB Output is correct
44 Correct 38 ms 63320 KB Output is correct
45 Correct 39 ms 63352 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62968 KB Output is correct
2 Correct 35 ms 62968 KB Output is correct
3 Correct 37 ms 62968 KB Output is correct
4 Correct 36 ms 62976 KB Output is correct
5 Correct 35 ms 62976 KB Output is correct
6 Correct 35 ms 62976 KB Output is correct
7 Correct 35 ms 62976 KB Output is correct
8 Correct 36 ms 62976 KB Output is correct
9 Correct 38 ms 63104 KB Output is correct
10 Correct 36 ms 62976 KB Output is correct
11 Correct 35 ms 62968 KB Output is correct
12 Correct 34 ms 63024 KB Output is correct
13 Correct 35 ms 62968 KB Output is correct
14 Correct 36 ms 62968 KB Output is correct
15 Correct 41 ms 62976 KB Output is correct
16 Correct 41 ms 63096 KB Output is correct
17 Correct 36 ms 63104 KB Output is correct
18 Correct 36 ms 63104 KB Output is correct
19 Correct 36 ms 63104 KB Output is correct
20 Correct 36 ms 63104 KB Output is correct
21 Correct 36 ms 63096 KB Output is correct
22 Correct 37 ms 63096 KB Output is correct
23 Correct 37 ms 63100 KB Output is correct
24 Correct 37 ms 62968 KB Output is correct
25 Correct 35 ms 63104 KB Output is correct
26 Correct 35 ms 62968 KB Output is correct
27 Correct 35 ms 62968 KB Output is correct
28 Correct 37 ms 62968 KB Output is correct
29 Correct 36 ms 63096 KB Output is correct
30 Correct 35 ms 62976 KB Output is correct
31 Correct 39 ms 63480 KB Output is correct
32 Correct 37 ms 63616 KB Output is correct
33 Correct 38 ms 63736 KB Output is correct
34 Correct 40 ms 63616 KB Output is correct
35 Correct 42 ms 63736 KB Output is correct
36 Correct 40 ms 63864 KB Output is correct
37 Correct 39 ms 63744 KB Output is correct
38 Correct 39 ms 63480 KB Output is correct
39 Correct 38 ms 63104 KB Output is correct
40 Correct 40 ms 63736 KB Output is correct
41 Correct 38 ms 63128 KB Output is correct
42 Correct 38 ms 63232 KB Output is correct
43 Correct 37 ms 63116 KB Output is correct
44 Correct 38 ms 63320 KB Output is correct
45 Correct 39 ms 63352 KB Output is correct
46 Runtime error 205 ms 149628 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62968 KB Output is correct
2 Correct 35 ms 62968 KB Output is correct
3 Correct 37 ms 62968 KB Output is correct
4 Correct 36 ms 62976 KB Output is correct
5 Correct 35 ms 62976 KB Output is correct
6 Correct 35 ms 62976 KB Output is correct
7 Correct 35 ms 62976 KB Output is correct
8 Correct 36 ms 62976 KB Output is correct
9 Correct 38 ms 63104 KB Output is correct
10 Correct 36 ms 62976 KB Output is correct
11 Correct 35 ms 62968 KB Output is correct
12 Correct 34 ms 63024 KB Output is correct
13 Correct 35 ms 62968 KB Output is correct
14 Correct 36 ms 62968 KB Output is correct
15 Correct 41 ms 62976 KB Output is correct
16 Correct 41 ms 63096 KB Output is correct
17 Correct 36 ms 63104 KB Output is correct
18 Correct 36 ms 63104 KB Output is correct
19 Correct 36 ms 63104 KB Output is correct
20 Correct 36 ms 63104 KB Output is correct
21 Correct 36 ms 63096 KB Output is correct
22 Correct 37 ms 63096 KB Output is correct
23 Correct 37 ms 63100 KB Output is correct
24 Correct 37 ms 62968 KB Output is correct
25 Correct 35 ms 63104 KB Output is correct
26 Correct 35 ms 62968 KB Output is correct
27 Correct 35 ms 62968 KB Output is correct
28 Correct 37 ms 62968 KB Output is correct
29 Correct 36 ms 63096 KB Output is correct
30 Correct 35 ms 62976 KB Output is correct
31 Correct 39 ms 63480 KB Output is correct
32 Correct 37 ms 63616 KB Output is correct
33 Correct 38 ms 63736 KB Output is correct
34 Correct 40 ms 63616 KB Output is correct
35 Correct 42 ms 63736 KB Output is correct
36 Correct 40 ms 63864 KB Output is correct
37 Correct 39 ms 63744 KB Output is correct
38 Correct 39 ms 63480 KB Output is correct
39 Correct 38 ms 63104 KB Output is correct
40 Correct 40 ms 63736 KB Output is correct
41 Correct 38 ms 63128 KB Output is correct
42 Correct 38 ms 63232 KB Output is correct
43 Correct 37 ms 63116 KB Output is correct
44 Correct 38 ms 63320 KB Output is correct
45 Correct 39 ms 63352 KB Output is correct
46 Runtime error 205 ms 149628 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Halted 0 ms 0 KB -