oj.uz

Submission #173672

# Submission time Handle Problem Language Result Execution time Memory
173672 2020-01-04T23:19:42 Z ZwariowanyMarcin Two Antennas (JOI19_antennas) C++14
100 / 100
 846 ms 37872 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define ss(x) (int) x.size()
#define pb push_back
#define ll long long
#define cat(x) cerr << #x << " = " << x << endl
#define FOR(i, n) for(int i = 0; i < n; ++i)

using namespace std;	

const int nax = 2e5 + 111;
const int pod = (1 << 18);
const long long INF = 1e17;

int n;
int h[nax];
int a[nax];
int b[nax];
int q;
ll ans[nax];
int l[nax];
int r[nax];

struct gao {
	int type, x;
};
// 0 - akt 
// 1 - query[x]

vector <gao> v[nax];

struct seg {
	struct nod {
		ll best, val, mini;
		nod () {}
		nod (ll b, ll v, ll m) : best(b), val(v), mini(m) {}
	};
	nod t[2 * pod];
	
	void init() {
		for(int i = 1; i < 2 * pod; ++i) 
			t[i] = nod(-INF, -INF, INF);
	}
	
	void make(int u) {
		t[u].best = max(t[2 * u].best, t[2 * u + 1].best);
		t[u].mini = min(t[2 * u].mini, t[2 * u + 1].mini);
	}
	
	void push(int u) {
		if(t[u].val == -INF) return;
		t[2 * u].val = max(t[2 * u].val, t[u].val);
		t[2 * u + 1].val = max(t[2 * u + 1].val, t[u].val);
		t[2 * u].best = max(t[2 * u].best, t[u].val - t[2 * u].mini);
		t[2 * u + 1].best = max(t[2 * u + 1].best, t[u].val - t[2 * u + 1].mini);
		t[u].val = -INF;
	}
	
	void akt(int x, int u = 1, int l = 0, int r = pod - 1) {
		if(l == r) {
			if(t[u].mini == INF) 
				t[u].mini = h[l];
			else 
				t[u].mini = INF;
			return;
		}
		push(u);
		int m = (l + r) / 2;
		if(x <= m) akt(x, 2 * u, l, m);
		else akt(x, 2 * u + 1, m + 1, r);
		make(u);
	}
	
	void zmaxuj(int x, int y, ll z, int u = 1, int l = 0, int r = pod - 1) {
		if(x <= l && r <= y) {
			t[u].best = max(t[u].best, z - t[u].mini);
			t[u].val = max(t[u].val, z);
			return;
		}
		push(u);
		int m = (l + r) / 2;
		if(x <= m) zmaxuj(x, y, z, 2 * u, l, m);
		if(m < y) zmaxuj(x, y, z, 2 * u + 1, m + 1, r);
		make(u);
	}
	
	ll query(int x, int y, int u = 1, int l = 0, int r = pod - 1) {
		if(x <= l && r <= y) return t[u].best;
		push(u);
		int m = (l + r) / 2;
		ll best = -INF;
		if(x <= m) best = query(x, y, 2 * u, l, m);
		if(m < y) best = max(best, query(x, y, 2 * u + 1, m + 1, r));
		return best;
	}
} ja;

void solve() {
	ja.init();
	for(int i = 1; i <= n; ++i)
		v[i].clear();
	for(int i = 1; i <= n; ++i) {
		int A = i + a[i];
		int B = i + b[i] + 1;
		if(A <= n)
			v[A].pb({0, i});
		if(B <= n)
			v[B].pb({0, i});
	}
	
	for(int i = 1; i <= q; ++i)
		v[r[i]].pb({1, i});
	
	for(int i = 1; i <= n; ++i) {
		
		int wsk = 0;
		while(wsk < ss(v[i]) && v[i][wsk].type == 0) {
			ja.akt(v[i][wsk].x);
		//	printf("akt %d %d\n", v[i][wsk].x, i);
			wsk++;
		}
		
		int L = max(1, i - b[i]);
		int R = i - a[i];
	//	printf("zmax %d %d\n", L, R);
		if(L <= R)
			ja.zmaxuj(L, R, h[i]);
		
		while(wsk < ss(v[i])) {
		//	printf("%d %d\n", i, v[i][wsk].x);
			ans[v[i][wsk].x] = max(ans[v[i][wsk].x], ja.query(l[v[i][wsk].x], i - 1));
			wsk++;
		}
	}
}
			
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) 
		scanf("%d %d %d", h + i, a + i, b + i);
	scanf("%d", &q);
	for(int i = 1; i <= q; ++i) 
		scanf("%d %d", l + i, r + i);
	for(int i = 1; i <= q; ++i)
		ans[i] = -1;
	solve();
	for(int i = 1; i <= n; ++i)
		h[i] *= -1;
	solve();
	for(int i = 1; i <= q; ++i) {
		ans[i] = max(ans[i], -1ll);
		printf("%lld\n", ans[i]);
	}
	
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:140:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
antennas.cpp:142:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", h + i, a + i, b + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:143:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
antennas.cpp:145:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", l + i, r + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17400 KB Output is correct
2 Correct 18 ms 17400 KB Output is correct
3 Correct 19 ms 17400 KB Output is correct
4 Correct 18 ms 17400 KB Output is correct
5 Correct 18 ms 17400 KB Output is correct
6 Correct 18 ms 17400 KB Output is correct
7 Correct 18 ms 17400 KB Output is correct
8 Correct 18 ms 17300 KB Output is correct
9 Correct 18 ms 17400 KB Output is correct
10 Correct 18 ms 17400 KB Output is correct
11 Correct 18 ms 17400 KB Output is correct
12 Correct 18 ms 17400 KB Output is correct
13 Correct 18 ms 17400 KB Output is correct
14 Correct 19 ms 17400 KB Output is correct
15 Correct 18 ms 17400 KB Output is correct
16 Correct 19 ms 17400 KB Output is correct
17 Correct 18 ms 17400 KB Output is correct
18 Correct 19 ms 17400 KB Output is correct
19 Correct 18 ms 17400 KB Output is correct
20 Correct 18 ms 17400 KB Output is correct
21 Correct 19 ms 17400 KB Output is correct
22 Correct 19 ms 17400 KB Output is correct
23 Correct 18 ms 17400 KB Output is correct
24 Correct 19 ms 17400 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17400 KB Output is correct
2 Correct 18 ms 17400 KB Output is correct
3 Correct 19 ms 17400 KB Output is correct
4 Correct 18 ms 17400 KB Output is correct
5 Correct 18 ms 17400 KB Output is correct
6 Correct 18 ms 17400 KB Output is correct
7 Correct 18 ms 17400 KB Output is correct
8 Correct 18 ms 17300 KB Output is correct
9 Correct 18 ms 17400 KB Output is correct
10 Correct 18 ms 17400 KB Output is correct
11 Correct 18 ms 17400 KB Output is correct
12 Correct 18 ms 17400 KB Output is correct
13 Correct 18 ms 17400 KB Output is correct
14 Correct 19 ms 17400 KB Output is correct
15 Correct 18 ms 17400 KB Output is correct
16 Correct 19 ms 17400 KB Output is correct
17 Correct 18 ms 17400 KB Output is correct
18 Correct 19 ms 17400 KB Output is correct
19 Correct 18 ms 17400 KB Output is correct
20 Correct 18 ms 17400 KB Output is correct
21 Correct 19 ms 17400 KB Output is correct
22 Correct 19 ms 17400 KB Output is correct
23 Correct 18 ms 17400 KB Output is correct
24 Correct 19 ms 17400 KB Output is correct
25 Correct 150 ms 23880 KB Output is correct
26 Correct 35 ms 18168 KB Output is correct
27 Correct 216 ms 26488 KB Output is correct
28 Correct 218 ms 26588 KB Output is correct
29 Correct 150 ms 24028 KB Output is correct
30 Correct 150 ms 23544 KB Output is correct
31 Correct 177 ms 25592 KB Output is correct
32 Correct 220 ms 26616 KB Output is correct
33 Correct 196 ms 26232 KB Output is correct
34 Correct 122 ms 21840 KB Output is correct
35 Correct 224 ms 26424 KB Output is correct
36 Correct 254 ms 26488 KB Output is correct
37 Correct 126 ms 22136 KB Output is correct
38 Correct 211 ms 25592 KB Output is correct
39 Correct 44 ms 18552 KB Output is correct
40 Correct 213 ms 25592 KB Output is correct
41 Correct 155 ms 23288 KB Output is correct
42 Correct 208 ms 25556 KB Output is correct
43 Correct 79 ms 20088 KB Output is correct
44 Correct 209 ms 25592 KB Output is correct
45 Correct 50 ms 18808 KB Output is correct
46 Correct 209 ms 25592 KB Output is correct
47 Correct 67 ms 19628 KB Output is correct
48 Correct 209 ms 25848 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 26364 KB Output is correct
2 Correct 437 ms 27512 KB Output is correct
3 Correct 295 ms 24312 KB Output is correct
4 Correct 438 ms 27384 KB Output is correct
5 Correct 184 ms 21980 KB Output is correct
6 Correct 422 ms 27384 KB Output is correct
7 Correct 425 ms 26072 KB Output is correct
8 Correct 437 ms 27384 KB Output is correct
9 Correct 70 ms 18936 KB Output is correct
10 Correct 428 ms 27424 KB Output is correct
11 Correct 252 ms 23672 KB Output is correct
12 Correct 438 ms 27356 KB Output is correct
13 Correct 280 ms 25940 KB Output is correct
14 Correct 262 ms 25912 KB Output is correct
15 Correct 230 ms 26100 KB Output is correct
16 Correct 260 ms 26616 KB Output is correct
17 Correct 289 ms 26336 KB Output is correct
18 Correct 264 ms 26568 KB Output is correct
19 Correct 260 ms 25964 KB Output is correct
20 Correct 249 ms 26088 KB Output is correct
21 Correct 250 ms 25712 KB Output is correct
22 Correct 260 ms 25944 KB Output is correct
23 Correct 254 ms 25968 KB Output is correct
24 Correct 242 ms 26052 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 17400 KB Output is correct
2 Correct 18 ms 17400 KB Output is correct
3 Correct 19 ms 17400 KB Output is correct
4 Correct 18 ms 17400 KB Output is correct
5 Correct 18 ms 17400 KB Output is correct
6 Correct 18 ms 17400 KB Output is correct
7 Correct 18 ms 17400 KB Output is correct
8 Correct 18 ms 17300 KB Output is correct
9 Correct 18 ms 17400 KB Output is correct
10 Correct 18 ms 17400 KB Output is correct
11 Correct 18 ms 17400 KB Output is correct
12 Correct 18 ms 17400 KB Output is correct
13 Correct 18 ms 17400 KB Output is correct
14 Correct 19 ms 17400 KB Output is correct
15 Correct 18 ms 17400 KB Output is correct
16 Correct 19 ms 17400 KB Output is correct
17 Correct 18 ms 17400 KB Output is correct
18 Correct 19 ms 17400 KB Output is correct
19 Correct 18 ms 17400 KB Output is correct
20 Correct 18 ms 17400 KB Output is correct
21 Correct 19 ms 17400 KB Output is correct
22 Correct 19 ms 17400 KB Output is correct
23 Correct 18 ms 17400 KB Output is correct
24 Correct 19 ms 17400 KB Output is correct
25 Correct 150 ms 23880 KB Output is correct
26 Correct 35 ms 18168 KB Output is correct
27 Correct 216 ms 26488 KB Output is correct
28 Correct 218 ms 26588 KB Output is correct
29 Correct 150 ms 24028 KB Output is correct
30 Correct 150 ms 23544 KB Output is correct
31 Correct 177 ms 25592 KB Output is correct
32 Correct 220 ms 26616 KB Output is correct
33 Correct 196 ms 26232 KB Output is correct
34 Correct 122 ms 21840 KB Output is correct
35 Correct 224 ms 26424 KB Output is correct
36 Correct 254 ms 26488 KB Output is correct
37 Correct 126 ms 22136 KB Output is correct
38 Correct 211 ms 25592 KB Output is correct
39 Correct 44 ms 18552 KB Output is correct
40 Correct 213 ms 25592 KB Output is correct
41 Correct 155 ms 23288 KB Output is correct
42 Correct 208 ms 25556 KB Output is correct
43 Correct 79 ms 20088 KB Output is correct
44 Correct 209 ms 25592 KB Output is correct
45 Correct 50 ms 18808 KB Output is correct
46 Correct 209 ms 25592 KB Output is correct
47 Correct 67 ms 19628 KB Output is correct
48 Correct 209 ms 25848 KB Output is correct
49 Correct 386 ms 26364 KB Output is correct
50 Correct 437 ms 27512 KB Output is correct
51 Correct 295 ms 24312 KB Output is correct
52 Correct 438 ms 27384 KB Output is correct
53 Correct 184 ms 21980 KB Output is correct
54 Correct 422 ms 27384 KB Output is correct
55 Correct 425 ms 26072 KB Output is correct
56 Correct 437 ms 27384 KB Output is correct
57 Correct 70 ms 18936 KB Output is correct
58 Correct 428 ms 27424 KB Output is correct
59 Correct 252 ms 23672 KB Output is correct
60 Correct 438 ms 27356 KB Output is correct
61 Correct 280 ms 25940 KB Output is correct
62 Correct 262 ms 25912 KB Output is correct
63 Correct 230 ms 26100 KB Output is correct
64 Correct 260 ms 26616 KB Output is correct
65 Correct 289 ms 26336 KB Output is correct
66 Correct 264 ms 26568 KB Output is correct
67 Correct 260 ms 25964 KB Output is correct
68 Correct 249 ms 26088 KB Output is correct
69 Correct 250 ms 25712 KB Output is correct
70 Correct 260 ms 25944 KB Output is correct
71 Correct 254 ms 25968 KB Output is correct
72 Correct 242 ms 26052 KB Output is correct
73 Correct 654 ms 34112 KB Output is correct
74 Correct 470 ms 28152 KB Output is correct
75 Correct 671 ms 34864 KB Output is correct
76 Correct 822 ms 37756 KB Output is correct
77 Correct 437 ms 29304 KB Output is correct
78 Correct 677 ms 34352 KB Output is correct
79 Correct 726 ms 36412 KB Output is correct
80 Correct 817 ms 37872 KB Output is correct
81 Correct 333 ms 28560 KB Output is correct
82 Correct 630 ms 32500 KB Output is correct
83 Correct 630 ms 33912 KB Output is correct
84 Correct 846 ms 37736 KB Output is correct
85 Correct 503 ms 32108 KB Output is correct
86 Correct 633 ms 36128 KB Output is correct
87 Correct 291 ms 27568 KB Output is correct
88 Correct 647 ms 36596 KB Output is correct
89 Correct 573 ms 33960 KB Output is correct
90 Correct 649 ms 36548 KB Output is correct
91 Correct 382 ms 29736 KB Output is correct
92 Correct 608 ms 36136 KB Output is correct
93 Correct 323 ms 27500 KB Output is correct
94 Correct 626 ms 35952 KB Output is correct
95 Correct 361 ms 28864 KB Output is correct
96 Correct 606 ms 36412 KB Output is correct