oj.uz

답안 #376959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376959 2021-03-12T11:58:01 Z pit4h Two Antennas (JOI19_antennas) C++14
100 / 100
 858 ms 43624 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, INF = 1e9+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];
int tree[2*base+1];
int treeMin[2*base+1], treeMax[2*base+1];

int get_min(int x) {
	return treeMin[x];
}
int get_max(int x) {
	return treeMax[x];
}
int eval(int id) {
	if(get_min(id)==INF || 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);
	//updm(id);
	if(rl==x && rr==x) {
		treeMin[id] = treeMax[id] = val.st;
		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]);
	treeMin[id] = min(treeMin[id*2], treeMin[id*2+1]); //.
	treeMax[id] = max(treeMax[id*2], treeMax[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;
	//treeR[id].erase(val);
	//updm(id);
	if(rl==x && rr==x) {
		treeMin[id] = INF; //.
		treeMax[id] = 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);

	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]);
	treeMin[id] = min(treeMin[id*2], treeMin[id*2+1]); //.
	treeMax[id] = max(treeMax[id*2], treeMax[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));
		return tree[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;
		treeMin[i] = INF;
	}

	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:132:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  132 |   for(auto& [j, id]: queries[i]) {
      |             ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18668 KB Output is correct
2 Correct 13 ms 18668 KB Output is correct
3 Correct 14 ms 18688 KB Output is correct
4 Correct 14 ms 18680 KB Output is correct
5 Correct 13 ms 18668 KB Output is correct
6 Correct 14 ms 18796 KB Output is correct
7 Correct 14 ms 18668 KB Output is correct
8 Correct 14 ms 18668 KB Output is correct
9 Correct 14 ms 18668 KB Output is correct
10 Correct 14 ms 18668 KB Output is correct
11 Correct 13 ms 18668 KB Output is correct
12 Correct 16 ms 18668 KB Output is correct
13 Correct 13 ms 18668 KB Output is correct
14 Correct 14 ms 18668 KB Output is correct
15 Correct 16 ms 18668 KB Output is correct
16 Correct 15 ms 18668 KB Output is correct
17 Correct 14 ms 18668 KB Output is correct
18 Correct 14 ms 18668 KB Output is correct
19 Correct 13 ms 18668 KB Output is correct
20 Correct 13 ms 18668 KB Output is correct
21 Correct 14 ms 18668 KB Output is correct
22 Correct 14 ms 18668 KB Output is correct
23 Correct 16 ms 18668 KB Output is correct
24 Correct 14 ms 18668 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18668 KB Output is correct
2 Correct 13 ms 18668 KB Output is correct
3 Correct 14 ms 18688 KB Output is correct
4 Correct 14 ms 18680 KB Output is correct
5 Correct 13 ms 18668 KB Output is correct
6 Correct 14 ms 18796 KB Output is correct
7 Correct 14 ms 18668 KB Output is correct
8 Correct 14 ms 18668 KB Output is correct
9 Correct 14 ms 18668 KB Output is correct
10 Correct 14 ms 18668 KB Output is correct
11 Correct 13 ms 18668 KB Output is correct
12 Correct 16 ms 18668 KB Output is correct
13 Correct 13 ms 18668 KB Output is correct
14 Correct 14 ms 18668 KB Output is correct
15 Correct 16 ms 18668 KB Output is correct
16 Correct 15 ms 18668 KB Output is correct
17 Correct 14 ms 18668 KB Output is correct
18 Correct 14 ms 18668 KB Output is correct
19 Correct 13 ms 18668 KB Output is correct
20 Correct 13 ms 18668 KB Output is correct
21 Correct 14 ms 18668 KB Output is correct
22 Correct 14 ms 18668 KB Output is correct
23 Correct 16 ms 18668 KB Output is correct
24 Correct 14 ms 18668 KB Output is correct
25 Correct 140 ms 22508 KB Output is correct
26 Correct 30 ms 19180 KB Output is correct
27 Correct 195 ms 23788 KB Output is correct
28 Correct 205 ms 23532 KB Output is correct
29 Correct 140 ms 22636 KB Output is correct
30 Correct 135 ms 22252 KB Output is correct
31 Correct 169 ms 23276 KB Output is correct
32 Correct 202 ms 23824 KB Output is correct
33 Correct 188 ms 23916 KB Output is correct
34 Correct 106 ms 21100 KB Output is correct
35 Correct 195 ms 24172 KB Output is correct
36 Correct 202 ms 23532 KB Output is correct
37 Correct 113 ms 21100 KB Output is correct
38 Correct 182 ms 22508 KB Output is correct
39 Correct 39 ms 19308 KB Output is correct
40 Correct 212 ms 22636 KB Output is correct
41 Correct 144 ms 21996 KB Output is correct
42 Correct 180 ms 22636 KB Output is correct
43 Correct 69 ms 20204 KB Output is correct
44 Correct 189 ms 22508 KB Output is correct
45 Correct 43 ms 19436 KB Output is correct
46 Correct 182 ms 22636 KB Output is correct
47 Correct 57 ms 19820 KB Output is correct
48 Correct 187 ms 22636 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 489 ms 28264 KB Output is correct
2 Correct 506 ms 29416 KB Output is correct
3 Correct 359 ms 26216 KB Output is correct
4 Correct 514 ms 29416 KB Output is correct
5 Correct 237 ms 23660 KB Output is correct
6 Correct 492 ms 29416 KB Output is correct
7 Correct 468 ms 28008 KB Output is correct
8 Correct 521 ms 29544 KB Output is correct
9 Correct 69 ms 20332 KB Output is correct
10 Correct 558 ms 29416 KB Output is correct
11 Correct 291 ms 25452 KB Output is correct
12 Correct 518 ms 29416 KB Output is correct
13 Correct 330 ms 27112 KB Output is correct
14 Correct 296 ms 26472 KB Output is correct
15 Correct 256 ms 24808 KB Output is correct
16 Correct 281 ms 24652 KB Output is correct
17 Correct 346 ms 27528 KB Output is correct
18 Correct 311 ms 25576 KB Output is correct
19 Correct 298 ms 26088 KB Output is correct
20 Correct 298 ms 25948 KB Output is correct
21 Correct 312 ms 26984 KB Output is correct
22 Correct 307 ms 26344 KB Output is correct
23 Correct 296 ms 26344 KB Output is correct
24 Correct 255 ms 24640 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18668 KB Output is correct
2 Correct 13 ms 18668 KB Output is correct
3 Correct 14 ms 18688 KB Output is correct
4 Correct 14 ms 18680 KB Output is correct
5 Correct 13 ms 18668 KB Output is correct
6 Correct 14 ms 18796 KB Output is correct
7 Correct 14 ms 18668 KB Output is correct
8 Correct 14 ms 18668 KB Output is correct
9 Correct 14 ms 18668 KB Output is correct
10 Correct 14 ms 18668 KB Output is correct
11 Correct 13 ms 18668 KB Output is correct
12 Correct 16 ms 18668 KB Output is correct
13 Correct 13 ms 18668 KB Output is correct
14 Correct 14 ms 18668 KB Output is correct
15 Correct 16 ms 18668 KB Output is correct
16 Correct 15 ms 18668 KB Output is correct
17 Correct 14 ms 18668 KB Output is correct
18 Correct 14 ms 18668 KB Output is correct
19 Correct 13 ms 18668 KB Output is correct
20 Correct 13 ms 18668 KB Output is correct
21 Correct 14 ms 18668 KB Output is correct
22 Correct 14 ms 18668 KB Output is correct
23 Correct 16 ms 18668 KB Output is correct
24 Correct 14 ms 18668 KB Output is correct
25 Correct 140 ms 22508 KB Output is correct
26 Correct 30 ms 19180 KB Output is correct
27 Correct 195 ms 23788 KB Output is correct
28 Correct 205 ms 23532 KB Output is correct
29 Correct 140 ms 22636 KB Output is correct
30 Correct 135 ms 22252 KB Output is correct
31 Correct 169 ms 23276 KB Output is correct
32 Correct 202 ms 23824 KB Output is correct
33 Correct 188 ms 23916 KB Output is correct
34 Correct 106 ms 21100 KB Output is correct
35 Correct 195 ms 24172 KB Output is correct
36 Correct 202 ms 23532 KB Output is correct
37 Correct 113 ms 21100 KB Output is correct
38 Correct 182 ms 22508 KB Output is correct
39 Correct 39 ms 19308 KB Output is correct
40 Correct 212 ms 22636 KB Output is correct
41 Correct 144 ms 21996 KB Output is correct
42 Correct 180 ms 22636 KB Output is correct
43 Correct 69 ms 20204 KB Output is correct
44 Correct 189 ms 22508 KB Output is correct
45 Correct 43 ms 19436 KB Output is correct
46 Correct 182 ms 22636 KB Output is correct
47 Correct 57 ms 19820 KB Output is correct
48 Correct 187 ms 22636 KB Output is correct
49 Correct 489 ms 28264 KB Output is correct
50 Correct 506 ms 29416 KB Output is correct
51 Correct 359 ms 26216 KB Output is correct
52 Correct 514 ms 29416 KB Output is correct
53 Correct 237 ms 23660 KB Output is correct
54 Correct 492 ms 29416 KB Output is correct
55 Correct 468 ms 28008 KB Output is correct
56 Correct 521 ms 29544 KB Output is correct
57 Correct 69 ms 20332 KB Output is correct
58 Correct 558 ms 29416 KB Output is correct
59 Correct 291 ms 25452 KB Output is correct
60 Correct 518 ms 29416 KB Output is correct
61 Correct 330 ms 27112 KB Output is correct
62 Correct 296 ms 26472 KB Output is correct
63 Correct 256 ms 24808 KB Output is correct
64 Correct 281 ms 24652 KB Output is correct
65 Correct 346 ms 27528 KB Output is correct
66 Correct 311 ms 25576 KB Output is correct
67 Correct 298 ms 26088 KB Output is correct
68 Correct 298 ms 25948 KB Output is correct
69 Correct 312 ms 26984 KB Output is correct
70 Correct 307 ms 26344 KB Output is correct
71 Correct 296 ms 26344 KB Output is correct
72 Correct 255 ms 24640 KB Output is correct
73 Correct 743 ms 33768 KB Output is correct
74 Correct 569 ms 30180 KB Output is correct
75 Correct 668 ms 32792 KB Output is correct
76 Correct 858 ms 36456 KB Output is correct
77 Correct 439 ms 32236 KB Output is correct
78 Correct 737 ms 40808 KB Output is correct
79 Correct 789 ms 41276 KB Output is correct
80 Correct 829 ms 43496 KB Output is correct
81 Correct 306 ms 28652 KB Output is correct
82 Correct 712 ms 39200 KB Output is correct
83 Correct 621 ms 37228 KB Output is correct
84 Correct 839 ms 43624 KB Output is correct
85 Correct 503 ms 36712 KB Output is correct
86 Correct 621 ms 39356 KB Output is correct
87 Correct 308 ms 30696 KB Output is correct
88 Correct 557 ms 37452 KB Output is correct
89 Correct 602 ms 38248 KB Output is correct
90 Correct 599 ms 38576 KB Output is correct
91 Correct 446 ms 33516 KB Output is correct
92 Correct 619 ms 39020 KB Output is correct
93 Correct 367 ms 33384 KB Output is correct
94 Correct 603 ms 39144 KB Output is correct
95 Correct 388 ms 33356 KB Output is correct
96 Correct 558 ms 37440 KB Output is correct