oj.uz

Submission #208632

# Submission time Handle Problem Language Result Execution time Memory
208632 2020-03-12T00:05:20 Z eriksuenderhauf Triple Jump (JOI19_jumps) C++11
100 / 100
 1427 ms 85752 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 5e5 + 5;
const double eps = 1e-9;
int a[MAXN], lz[MAXN*3];
int nx[MAXN], ans[MAXN];
vii x[MAXN], y[MAXN];
pii seg[MAXN*3];

void build(int l, int r, int k) {
	if (l == r) {
		seg[k] = mp(-INF,-INF);
		return;
	}
	int m = (l+r) / 2;
	build(l,m,k*2);
	build(m+1,r,k*2+1);
	seg[k].fi = max(seg[k*2].fi, seg[k*2+1].fi);
	seg[k].se = max(seg[k*2].se, seg[k*2+1].se);
}

void prop(int l, int r, int k) {
	if (l != r) {
		lz[k*2] = max(lz[k*2], lz[k]);
		lz[k*2+1] = max(lz[k*2+1], lz[k]);
	}
	seg[k].se = max(seg[k].se, seg[k].fi + lz[k]);
	lz[k] = 0;
}

void upd(int l, int r, int k, int a, int b) {
	prop(l,r,k);
	if (r < a || a < l) return;
	if (l == r) {
		seg[k].fi = max(seg[k].fi, b);
		return;
	}
	int m = (l+r) / 2;
	upd(l,m,k*2,a,b);
	upd(m+1,r,k*2+1,a,b);
	seg[k].fi = max(seg[k*2].fi, seg[k*2+1].fi);
	seg[k].se = max(seg[k*2].se, seg[k*2+1].se);
}

int qry(int l, int r, int k, int a, int b) {
	prop(l,r,k);
	if (b < l || r < a) return 0;
	if (a <= l && r <= b) return seg[k].se;
	int m = (l+r) / 2;
	return max(qry(l,m,k*2,a,b),qry(m+1,r,k*2+1,a,b));
}

int main() {
	int n, q; ni(n); nai(a, n);
	for (int i = 0; i < n; i++) {
		nx[i] = i-1;
		while (nx[i] != -1 && a[nx[i]] < a[i])
			nx[i] = nx[nx[i]];
		if (nx[i] != -1 && 2 * i - nx[i] < n)
			x[2*i-nx[i]].pb(mp(nx[i], a[nx[i]]+a[i]));
	}
	for (int i = n-1; i >= 0; i--) {
		nx[i] = i+1;
		while (nx[i] != n && a[nx[i]] < a[i])
			nx[i] = nx[nx[i]];
		if (nx[i] != n && 2 * nx[i] - i < n)
			x[2*nx[i]-i].pb(mp(i, a[nx[i]]+a[i]));
		if (i+2 < n)
			x[i+2].pb(mp(i, a[i] + a[i+1]));
	}
	ni(q);
	for (int i = 0; i < q; i++) {
		int ll, rr; scanf("%d %d", &ll, &rr);
		ll--, rr--;
		y[rr].pb(mp(ll, i));
	}
	build(0, n-1, 1);
	for (int i = 0; i < n; i++) {
		for (pii tmp: x[i])
			upd(0, n-1, 1, tmp.fi, tmp.se);
		lz[1] = max(lz[1], a[i]);
		for (pii tmp: y[i])
			ans[tmp.se] = qry(0, n-1, 1, tmp.fi, n-1);
	}
	for (int i = 0; i < q; i++)
		pri(ans[i]);
    return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
jumps.cpp:86:12: note: in expansion of macro 'ni'
  int n, q; ni(n); nai(a, n);
            ^~
jumps.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
jumps.cpp:11:49: note: in expansion of macro 'ni'
 #define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
                                                 ^~
jumps.cpp:86:19: note: in expansion of macro 'nai'
  int n, q; ni(n); nai(a, n);
                   ^~~
jumps.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
jumps.cpp:103:2: note: in expansion of macro 'ni'
  ni(q);
  ^~
jumps.cpp:105:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int ll, rr; scanf("%d %d", &ll, &rr);
               ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23804 KB Output is correct
2 Correct 20 ms 23804 KB Output is correct
3 Correct 19 ms 23800 KB Output is correct
4 Correct 19 ms 23800 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 19 ms 23800 KB Output is correct
7 Correct 20 ms 23928 KB Output is correct
8 Correct 19 ms 23800 KB Output is correct
9 Correct 20 ms 23800 KB Output is correct
10 Correct 19 ms 23800 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23804 KB Output is correct
2 Correct 20 ms 23804 KB Output is correct
3 Correct 19 ms 23800 KB Output is correct
4 Correct 19 ms 23800 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 19 ms 23800 KB Output is correct
7 Correct 20 ms 23928 KB Output is correct
8 Correct 19 ms 23800 KB Output is correct
9 Correct 20 ms 23800 KB Output is correct
10 Correct 19 ms 23800 KB Output is correct
11 Correct 314 ms 38444 KB Output is correct
12 Correct 315 ms 38264 KB Output is correct
13 Correct 320 ms 38392 KB Output is correct
14 Correct 329 ms 38392 KB Output is correct
15 Correct 317 ms 38440 KB Output is correct
16 Correct 326 ms 37752 KB Output is correct
17 Correct 330 ms 37752 KB Output is correct
18 Correct 329 ms 37752 KB Output is correct
19 Correct 328 ms 38376 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 41848 KB Output is correct
2 Correct 223 ms 38648 KB Output is correct
3 Correct 218 ms 38624 KB Output is correct
4 Correct 290 ms 41848 KB Output is correct
5 Correct 304 ms 41848 KB Output is correct
6 Correct 316 ms 41848 KB Output is correct
7 Correct 290 ms 41812 KB Output is correct
8 Correct 284 ms 41720 KB Output is correct
9 Correct 296 ms 41848 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23804 KB Output is correct
2 Correct 20 ms 23804 KB Output is correct
3 Correct 19 ms 23800 KB Output is correct
4 Correct 19 ms 23800 KB Output is correct
5 Correct 19 ms 23800 KB Output is correct
6 Correct 19 ms 23800 KB Output is correct
7 Correct 20 ms 23928 KB Output is correct
8 Correct 19 ms 23800 KB Output is correct
9 Correct 20 ms 23800 KB Output is correct
10 Correct 19 ms 23800 KB Output is correct
11 Correct 314 ms 38444 KB Output is correct
12 Correct 315 ms 38264 KB Output is correct
13 Correct 320 ms 38392 KB Output is correct
14 Correct 329 ms 38392 KB Output is correct
15 Correct 317 ms 38440 KB Output is correct
16 Correct 326 ms 37752 KB Output is correct
17 Correct 330 ms 37752 KB Output is correct
18 Correct 329 ms 37752 KB Output is correct
19 Correct 328 ms 38376 KB Output is correct
20 Correct 294 ms 41848 KB Output is correct
21 Correct 223 ms 38648 KB Output is correct
22 Correct 218 ms 38624 KB Output is correct
23 Correct 290 ms 41848 KB Output is correct
24 Correct 304 ms 41848 KB Output is correct
25 Correct 316 ms 41848 KB Output is correct
26 Correct 290 ms 41812 KB Output is correct
27 Correct 284 ms 41720 KB Output is correct
28 Correct 296 ms 41848 KB Output is correct
29 Correct 1419 ms 79992 KB Output is correct
30 Correct 1188 ms 73464 KB Output is correct
31 Correct 1177 ms 73308 KB Output is correct
32 Correct 1420 ms 80152 KB Output is correct
33 Correct 1397 ms 80120 KB Output is correct
34 Correct 1427 ms 79480 KB Output is correct
35 Correct 1399 ms 79608 KB Output is correct
36 Correct 1399 ms 79480 KB Output is correct
37 Correct 1416 ms 80120 KB Output is correct
38 Correct 1101 ms 85752 KB Output is correct
39 Correct 1128 ms 85752 KB Output is correct
40 Correct 1138 ms 83960 KB Output is correct
41 Correct 1153 ms 83704 KB Output is correct
42 Correct 1119 ms 83960 KB Output is correct
43 Correct 1149 ms 84664 KB Output is correct
44 Correct 1134 ms 85112 KB Output is correct
45 Correct 1130 ms 84916 KB Output is correct
46 Correct 1141 ms 83496 KB Output is correct
47 Correct 1109 ms 83192 KB Output is correct
48 Correct 1104 ms 83320 KB Output is correct
49 Correct 1113 ms 84600 KB Output is correct
50 Correct 1273 ms 82960 KB Output is correct
51 Correct 1279 ms 83276 KB Output is correct
52 Correct 1282 ms 82456 KB Output is correct
53 Correct 1272 ms 82396 KB Output is correct
54 Correct 1248 ms 82360 KB Output is correct
55 Correct 1283 ms 83080 KB Output is correct