oj.uz

Submission #376956

# Submission time Handle Problem Language Result Execution time Memory
376956 2021-03-12T11:29:49 Z pit4h Two Antennas (JOI19_antennas) C++14
35 / 100
 3000 ms 108620 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
using namespace std;
using pii = pair<int, int>;

const int MAXN = 2e5+1;
int n, q, h[MAXN], a[MAXN], b[MAXN];
int ans[MAXN];
vector<int> add[MAXN], del[MAXN];
vector<pii> queries[MAXN];

const int base = (1<<18);
pii treeL[2*base+1], push[2*base+1];
set<pii> treeR[2*base+1];
int tree[2*base+1];

int get_min(int x) {
	if(treeR[x].empty()) return 0;
	int res = (*(treeR[x].begin())) . st;
	return res;
}
int get_max(int x) {
	if(treeR[x].empty()) return 0;
	int res = (*(treeR[x].rbegin())) . st;
	return res;
}
int eval(int id) {
	if(treeR[id].empty() || treeL[id].st==0) return -1;
	int res = max(abs(get_max(id) - treeL[id].st), abs(treeL[id].nd - get_min(id)));
	return res;
}
void upd(int x, int val) {
	if(val==0) return;
	if(treeL[x].st==0) treeL[x].st = val;
	treeL[x].st = min(treeL[x].st, val);
	treeL[x].nd = max(treeL[x].nd, val);
	tree[x] = max(tree[x], eval(x));
}
void insR(int x, pii val, int id=1, int rl=0, int rr=base-1) {
	if(rl > x || rr < x) return;
	tree[id] = max(tree[id], eval(id));
	treeR[id].insert(val);
	if(rl==x && rr==x) {
		treeL[id].st = treeL[id].nd = 0;
		return;
	}
	upd(id*2, treeL[id].st), upd(id*2, treeL[id].nd);
	upd(id*2+1, treeL[id].st), upd(id*2+1, treeL[id].nd);
	treeL[id].st = treeL[id].nd = 0;

	insR(x, val, id*2, rl, (rl+rr)/2);
	insR(x, val, id*2+1, (rl+rr)/2+1, rr);
	tree[id] = max(tree[id*2], tree[id*2+1]);
}
void delR(int x, pii val, int id=1, int rl=0, int rr=base-1) {
	if(rl > x || rr < x) return;
	tree[id] = max(tree[id], eval(id));
	treeR[id].erase(val);
	if(rl==x && rr==x) {
		return;
	}
	upd(id*2, treeL[id].st), upd(id*2, treeL[id].nd);
	upd(id*2+1, treeL[id].st), upd(id*2+1, treeL[id].nd);

	delR(x, val, id*2, rl, (rl+rr)/2);
	delR(x, val, id*2+1, (rl+rr)/2+1, rr);
	tree[id] = max(tree[id*2], tree[id*2+1]);
}

void insL(int l, int r, int val, int id=1, int rl=0, int rr=base-1) {
	if(l > rr || r < rl) return;
	if(l<=rl && r>=rr) {
		upd(id, val);
		return;
	}
	upd(id*2, treeL[id].st), upd(id*2, treeL[id].nd);
	upd(id*2+1, treeL[id].st), upd(id*2+1, treeL[id].nd);

	insL(l, r, val, id*2, rl, (rl+rr)/2);
	insL(l, r, val, id*2+1, (rl+rr)/2+1, rr);

	tree[id] = max(tree[id*2], tree[id*2+1]);
}
int qry(int l, int r, int id=1, int rl=0, int rr=base-1) {
	if(l > rr || r < rl) return -1;
	if(l<=rl && r>=rr) {
		return max(tree[id], eval(id));
	}
	upd(id*2, treeL[id].st), upd(id*2, treeL[id].nd);
	upd(id*2+1, treeL[id].st), upd(id*2+1, treeL[id].nd);

	return max(qry(l, r, id*2, rl, (rl+rr)/2), qry(l, r, id*2+1, (rl+rr)/2+1, rr));
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	for(int i=0; i<2*base; ++i) tree[i] = -1;

	cin>>n;
	for(int i=0; i<n; ++i) {
		cin>>h[i]>>a[i]>>b[i];
		if(i-a[i]>=0) {
			add[i-a[i]].push_back(i);
			del[max(0, i-b[i])].push_back(i);
		}
	}
	cin>>q;
	for(int i=0; i<q; ++i) {
		int l, r; 
		cin>>l>>r;
		queries[l-1].push_back(mp(r-1, i));
		ans[i] = -1;
	}

	for(int i=n-1; i>=0; --i) {
		for(int j: add[i]) {
			insR(j, mp(h[j], j));	
		}

		if(i+a[i] < n) {
			insL(i+a[i], min(n-1, i+b[i]), h[i]);
		}
		for(auto& [j, id]: queries[i]) {
			ans[id] = qry(i, j);
		}

		for(int j: del[i]) {
			delR(j, mp(h[j], j));
		}
	}


	for(int i=0; i<q; ++i) {
		cout<<ans[i]<<'\n';
	}
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:124:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  124 |   for(auto& [j, id]: queries[i]) {
      |             ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 41196 KB Output is correct
2 Correct 26 ms 41324 KB Output is correct
3 Correct 26 ms 41324 KB Output is correct
4 Correct 27 ms 41324 KB Output is correct
5 Correct 26 ms 41196 KB Output is correct
6 Correct 27 ms 41324 KB Output is correct
7 Correct 26 ms 41324 KB Output is correct
8 Correct 27 ms 41472 KB Output is correct
9 Correct 26 ms 41196 KB Output is correct
10 Correct 27 ms 41324 KB Output is correct
11 Correct 27 ms 41324 KB Output is correct
12 Correct 27 ms 41324 KB Output is correct
13 Correct 27 ms 41196 KB Output is correct
14 Correct 27 ms 41196 KB Output is correct
15 Correct 27 ms 41452 KB Output is correct
16 Correct 30 ms 41196 KB Output is correct
17 Correct 27 ms 41196 KB Output is correct
18 Correct 27 ms 41324 KB Output is correct
19 Correct 26 ms 41196 KB Output is correct
20 Correct 27 ms 41196 KB Output is correct
21 Correct 27 ms 41196 KB Output is correct
22 Correct 31 ms 41324 KB Output is correct
23 Correct 26 ms 41324 KB Output is correct
24 Correct 27 ms 41196 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 41196 KB Output is correct
2 Correct 26 ms 41324 KB Output is correct
3 Correct 26 ms 41324 KB Output is correct
4 Correct 27 ms 41324 KB Output is correct
5 Correct 26 ms 41196 KB Output is correct
6 Correct 27 ms 41324 KB Output is correct
7 Correct 26 ms 41324 KB Output is correct
8 Correct 27 ms 41472 KB Output is correct
9 Correct 26 ms 41196 KB Output is correct
10 Correct 27 ms 41324 KB Output is correct
11 Correct 27 ms 41324 KB Output is correct
12 Correct 27 ms 41324 KB Output is correct
13 Correct 27 ms 41196 KB Output is correct
14 Correct 27 ms 41196 KB Output is correct
15 Correct 27 ms 41452 KB Output is correct
16 Correct 30 ms 41196 KB Output is correct
17 Correct 27 ms 41196 KB Output is correct
18 Correct 27 ms 41324 KB Output is correct
19 Correct 26 ms 41196 KB Output is correct
20 Correct 27 ms 41196 KB Output is correct
21 Correct 27 ms 41196 KB Output is correct
22 Correct 31 ms 41324 KB Output is correct
23 Correct 26 ms 41324 KB Output is correct
24 Correct 27 ms 41196 KB Output is correct
25 Correct 181 ms 46188 KB Output is correct
26 Correct 50 ms 42348 KB Output is correct
27 Correct 252 ms 48108 KB Output is correct
28 Correct 256 ms 48224 KB Output is correct
29 Correct 180 ms 46444 KB Output is correct
30 Correct 180 ms 46316 KB Output is correct
31 Correct 190 ms 47340 KB Output is correct
32 Correct 260 ms 48236 KB Output is correct
33 Correct 228 ms 47980 KB Output is correct
34 Correct 142 ms 45164 KB Output is correct
35 Correct 247 ms 48504 KB Output is correct
36 Correct 254 ms 48228 KB Output is correct
37 Correct 137 ms 44908 KB Output is correct
38 Correct 213 ms 47596 KB Output is correct
39 Correct 60 ms 42604 KB Output is correct
40 Correct 216 ms 47212 KB Output is correct
41 Correct 167 ms 45932 KB Output is correct
42 Correct 218 ms 47212 KB Output is correct
43 Correct 89 ms 43756 KB Output is correct
44 Correct 216 ms 46956 KB Output is correct
45 Correct 61 ms 42732 KB Output is correct
46 Correct 210 ms 47084 KB Output is correct
47 Correct 79 ms 42988 KB Output is correct
48 Correct 210 ms 47084 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2360 ms 93904 KB Output is correct
2 Correct 2716 ms 99632 KB Output is correct
3 Correct 1755 ms 82408 KB Output is correct
4 Correct 2687 ms 100060 KB Output is correct
5 Correct 1041 ms 68112 KB Output is correct
6 Correct 2718 ms 100012 KB Output is correct
7 Correct 2276 ms 92076 KB Output is correct
8 Correct 2720 ms 99864 KB Output is correct
9 Correct 250 ms 50540 KB Output is correct
10 Correct 2753 ms 99740 KB Output is correct
11 Correct 1525 ms 77656 KB Output is correct
12 Correct 2734 ms 99688 KB Output is correct
13 Correct 1202 ms 101496 KB Output is correct
14 Correct 1084 ms 99584 KB Output is correct
15 Correct 812 ms 91112 KB Output is correct
16 Correct 922 ms 108620 KB Output is correct
17 Correct 1231 ms 105760 KB Output is correct
18 Correct 1004 ms 88936 KB Output is correct
19 Correct 955 ms 75500 KB Output is correct
20 Correct 951 ms 81772 KB Output is correct
21 Correct 1059 ms 91752 KB Output is correct
22 Correct 1072 ms 92136 KB Output is correct
23 Correct 1037 ms 84876 KB Output is correct
24 Correct 851 ms 94016 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 41196 KB Output is correct
2 Correct 26 ms 41324 KB Output is correct
3 Correct 26 ms 41324 KB Output is correct
4 Correct 27 ms 41324 KB Output is correct
5 Correct 26 ms 41196 KB Output is correct
6 Correct 27 ms 41324 KB Output is correct
7 Correct 26 ms 41324 KB Output is correct
8 Correct 27 ms 41472 KB Output is correct
9 Correct 26 ms 41196 KB Output is correct
10 Correct 27 ms 41324 KB Output is correct
11 Correct 27 ms 41324 KB Output is correct
12 Correct 27 ms 41324 KB Output is correct
13 Correct 27 ms 41196 KB Output is correct
14 Correct 27 ms 41196 KB Output is correct
15 Correct 27 ms 41452 KB Output is correct
16 Correct 30 ms 41196 KB Output is correct
17 Correct 27 ms 41196 KB Output is correct
18 Correct 27 ms 41324 KB Output is correct
19 Correct 26 ms 41196 KB Output is correct
20 Correct 27 ms 41196 KB Output is correct
21 Correct 27 ms 41196 KB Output is correct
22 Correct 31 ms 41324 KB Output is correct
23 Correct 26 ms 41324 KB Output is correct
24 Correct 27 ms 41196 KB Output is correct
25 Correct 181 ms 46188 KB Output is correct
26 Correct 50 ms 42348 KB Output is correct
27 Correct 252 ms 48108 KB Output is correct
28 Correct 256 ms 48224 KB Output is correct
29 Correct 180 ms 46444 KB Output is correct
30 Correct 180 ms 46316 KB Output is correct
31 Correct 190 ms 47340 KB Output is correct
32 Correct 260 ms 48236 KB Output is correct
33 Correct 228 ms 47980 KB Output is correct
34 Correct 142 ms 45164 KB Output is correct
35 Correct 247 ms 48504 KB Output is correct
36 Correct 254 ms 48228 KB Output is correct
37 Correct 137 ms 44908 KB Output is correct
38 Correct 213 ms 47596 KB Output is correct
39 Correct 60 ms 42604 KB Output is correct
40 Correct 216 ms 47212 KB Output is correct
41 Correct 167 ms 45932 KB Output is correct
42 Correct 218 ms 47212 KB Output is correct
43 Correct 89 ms 43756 KB Output is correct
44 Correct 216 ms 46956 KB Output is correct
45 Correct 61 ms 42732 KB Output is correct
46 Correct 210 ms 47084 KB Output is correct
47 Correct 79 ms 42988 KB Output is correct
48 Correct 210 ms 47084 KB Output is correct
49 Correct 2360 ms 93904 KB Output is correct
50 Correct 2716 ms 99632 KB Output is correct
51 Correct 1755 ms 82408 KB Output is correct
52 Correct 2687 ms 100060 KB Output is correct
53 Correct 1041 ms 68112 KB Output is correct
54 Correct 2718 ms 100012 KB Output is correct
55 Correct 2276 ms 92076 KB Output is correct
56 Correct 2720 ms 99864 KB Output is correct
57 Correct 250 ms 50540 KB Output is correct
58 Correct 2753 ms 99740 KB Output is correct
59 Correct 1525 ms 77656 KB Output is correct
60 Correct 2734 ms 99688 KB Output is correct
61 Correct 1202 ms 101496 KB Output is correct
62 Correct 1084 ms 99584 KB Output is correct
63 Correct 812 ms 91112 KB Output is correct
64 Correct 922 ms 108620 KB Output is correct
65 Correct 1231 ms 105760 KB Output is correct
66 Correct 1004 ms 88936 KB Output is correct
67 Correct 955 ms 75500 KB Output is correct
68 Correct 951 ms 81772 KB Output is correct
69 Correct 1059 ms 91752 KB Output is correct
70 Correct 1072 ms 92136 KB Output is correct
71 Correct 1037 ms 84876 KB Output is correct
72 Correct 851 ms 94016 KB Output is correct
73 Execution timed out 3002 ms 101156 KB Time limit exceeded
74 Halted 0 ms 0 KB -