oj.uz

답안 #670522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670522 2022-12-09T13:02:34 Z ymm Two Antennas (JOI19_antennas) C++17
100 / 100
 455 ms 45232 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 200'010;
const int inf = 1e9 + 10;

struct {
	int mnr, mxr;
	int mni, mxi;
	int mxv;
} seg[N*4];

void init(int i, int b, int e)
{
	seg[i] = {inf, -inf, inf, -inf, -inf};
	if (e-b == 1)
		return;
	init(2*i+1, b, (b+e)/2);
	init(2*i+2, (b+e)/2, e);
}

void insertr_node(int mn, int mx, int i)
{
	seg[i].mnr = min(seg[i].mnr, mn);
	seg[i].mxr = max(seg[i].mxr, mx);
	seg[i].mxv = max({seg[i].mxv, mx - seg[i].mni, seg[i].mxi - mn});
}

void ppg(int i)
{
	insertr_node(seg[i].mnr, seg[i].mxr, 2*i+1);
	insertr_node(seg[i].mnr, seg[i].mxr, 2*i+2);
	seg[i].mnr = inf;
	seg[i].mxr = -inf;
}

void up(int i)
{
	seg[i].mni = min(seg[2*i+1].mni, seg[2*i+2].mni);
	seg[i].mxi = max(seg[2*i+1].mxi, seg[2*i+2].mxi);
	seg[i].mxv = max(seg[2*i+1].mxv, seg[2*i+2].mxv);
}

void insertr(int l, int r, int x, int i, int b, int e)
{
	if (l <= b && e <= r) {
		insertr_node(x, x, i);
		return;
	}
	if (r <= b || e <= l)
		return;
	ppg(i);
	insertr(l, r, x, 2*i+1, b, (b+e)/2);
	insertr(l, r, x, 2*i+2, (b+e)/2, e);
	up(i);
}

void changei(int p, int x, int i, int b, int e)
{
	if (e-b == 1) {
		seg[i].mni = x == -1? inf: x;
		seg[i].mxi = x == -1? -inf: x;
		return;
	}
	ppg(i);
	if (p < (b+e)/2)
		changei(p, x, 2*i+1, b, (b+e)/2);
	else
		changei(p, x, 2*i+2, (b+e)/2, e);
	up(i);
}

int get(int l, int r, int i, int b, int e)
{
	if (l <= b && e <= r)
		return seg[i].mxv;
	if (r <= b || e <= l)
		return -inf;
	ppg(i);
	return max(get(l, r, 2*i+1, b, (b+e)/2),
	           get(l, r, 2*i+2, (b+e)/2, e));
}

int h[N], a[N], b[N];
vector<int> add[N];
vector<int> rem[N];
int ql[N], qr[N];
int qans[N];
vector<int> qvec[N];
int n, q;

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,0,n) {
		cin >> h[i] >> a[i] >> b[i];
		if (a[i] > b[i])
			swap(a[i], b[i]);
		if (i + a[i] < n)
			add[i + a[i]].push_back(i);
		if (i + b[i] + 1 < n)
			rem[i + b[i] + 1].push_back(i);
	}
	cin >> q;
	Loop (i,0,q) {
		cin >> ql[i] >> qr[i];
		--ql[i];
		qvec[qr[i]-1].push_back(i);
	}
	init(0, 0, n);
	Loop (i,0,n) {
		for (int j : add[i])
			changei(j, h[j], 0, 0, n);
		for (int j : rem[i])
			changei(j, -1, 0, 0, n);
		int l = max(0ll, i - b[i]);
		int r = min(i, i - a[i] + 1);
		if (l < r)
			insertr(l, r, h[i], 0, 0, n);
		for (int j : qvec[i])
			qans[j] = get(ql[j], qr[j], 0, 0, n);
	}
	Loop (i,0,q)
		cout << (qans[i] < 0? -1: qans[i]) << '\n';
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 8 ms 14492 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14432 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14440 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 8 ms 14428 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14488 KB Output is correct
23 Correct 8 ms 14376 KB Output is correct
24 Correct 8 ms 14432 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 8 ms 14492 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14432 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14440 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 8 ms 14428 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14488 KB Output is correct
23 Correct 8 ms 14376 KB Output is correct
24 Correct 8 ms 14432 KB Output is correct
25 Correct 80 ms 19588 KB Output is correct
26 Correct 18 ms 15176 KB Output is correct
27 Correct 112 ms 21604 KB Output is correct
28 Correct 114 ms 21732 KB Output is correct
29 Correct 81 ms 19536 KB Output is correct
30 Correct 79 ms 19356 KB Output is correct
31 Correct 89 ms 20872 KB Output is correct
32 Correct 114 ms 21700 KB Output is correct
33 Correct 108 ms 21216 KB Output is correct
34 Correct 72 ms 17984 KB Output is correct
35 Correct 113 ms 21632 KB Output is correct
36 Correct 115 ms 21716 KB Output is correct
37 Correct 74 ms 18088 KB Output is correct
38 Correct 112 ms 20784 KB Output is correct
39 Correct 24 ms 15436 KB Output is correct
40 Correct 114 ms 20768 KB Output is correct
41 Correct 86 ms 19044 KB Output is correct
42 Correct 115 ms 20760 KB Output is correct
43 Correct 44 ms 16632 KB Output is correct
44 Correct 112 ms 20816 KB Output is correct
45 Correct 27 ms 15600 KB Output is correct
46 Correct 117 ms 20796 KB Output is correct
47 Correct 35 ms 16136 KB Output is correct
48 Correct 111 ms 20684 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 29944 KB Output is correct
2 Correct 241 ms 30560 KB Output is correct
3 Correct 141 ms 28828 KB Output is correct
4 Correct 217 ms 30540 KB Output is correct
5 Correct 92 ms 22152 KB Output is correct
6 Correct 224 ms 30560 KB Output is correct
7 Correct 184 ms 29796 KB Output is correct
8 Correct 219 ms 35104 KB Output is correct
9 Correct 36 ms 17384 KB Output is correct
10 Correct 222 ms 35036 KB Output is correct
11 Correct 128 ms 25932 KB Output is correct
12 Correct 229 ms 35164 KB Output is correct
13 Correct 182 ms 32576 KB Output is correct
14 Correct 169 ms 32492 KB Output is correct
15 Correct 172 ms 32688 KB Output is correct
16 Correct 152 ms 33148 KB Output is correct
17 Correct 183 ms 32624 KB Output is correct
18 Correct 183 ms 33248 KB Output is correct
19 Correct 174 ms 32384 KB Output is correct
20 Correct 167 ms 32536 KB Output is correct
21 Correct 170 ms 32136 KB Output is correct
22 Correct 170 ms 32616 KB Output is correct
23 Correct 176 ms 32492 KB Output is correct
24 Correct 151 ms 32608 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14432 KB Output is correct
3 Correct 8 ms 14492 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14432 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14440 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 8 ms 14428 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 8 ms 14488 KB Output is correct
23 Correct 8 ms 14376 KB Output is correct
24 Correct 8 ms 14432 KB Output is correct
25 Correct 80 ms 19588 KB Output is correct
26 Correct 18 ms 15176 KB Output is correct
27 Correct 112 ms 21604 KB Output is correct
28 Correct 114 ms 21732 KB Output is correct
29 Correct 81 ms 19536 KB Output is correct
30 Correct 79 ms 19356 KB Output is correct
31 Correct 89 ms 20872 KB Output is correct
32 Correct 114 ms 21700 KB Output is correct
33 Correct 108 ms 21216 KB Output is correct
34 Correct 72 ms 17984 KB Output is correct
35 Correct 113 ms 21632 KB Output is correct
36 Correct 115 ms 21716 KB Output is correct
37 Correct 74 ms 18088 KB Output is correct
38 Correct 112 ms 20784 KB Output is correct
39 Correct 24 ms 15436 KB Output is correct
40 Correct 114 ms 20768 KB Output is correct
41 Correct 86 ms 19044 KB Output is correct
42 Correct 115 ms 20760 KB Output is correct
43 Correct 44 ms 16632 KB Output is correct
44 Correct 112 ms 20816 KB Output is correct
45 Correct 27 ms 15600 KB Output is correct
46 Correct 117 ms 20796 KB Output is correct
47 Correct 35 ms 16136 KB Output is correct
48 Correct 111 ms 20684 KB Output is correct
49 Correct 198 ms 29944 KB Output is correct
50 Correct 241 ms 30560 KB Output is correct
51 Correct 141 ms 28828 KB Output is correct
52 Correct 217 ms 30540 KB Output is correct
53 Correct 92 ms 22152 KB Output is correct
54 Correct 224 ms 30560 KB Output is correct
55 Correct 184 ms 29796 KB Output is correct
56 Correct 219 ms 35104 KB Output is correct
57 Correct 36 ms 17384 KB Output is correct
58 Correct 222 ms 35036 KB Output is correct
59 Correct 128 ms 25932 KB Output is correct
60 Correct 229 ms 35164 KB Output is correct
61 Correct 182 ms 32576 KB Output is correct
62 Correct 169 ms 32492 KB Output is correct
63 Correct 172 ms 32688 KB Output is correct
64 Correct 152 ms 33148 KB Output is correct
65 Correct 183 ms 32624 KB Output is correct
66 Correct 183 ms 33248 KB Output is correct
67 Correct 174 ms 32384 KB Output is correct
68 Correct 167 ms 32536 KB Output is correct
69 Correct 170 ms 32136 KB Output is correct
70 Correct 170 ms 32616 KB Output is correct
71 Correct 176 ms 32492 KB Output is correct
72 Correct 151 ms 32608 KB Output is correct
73 Correct 362 ms 41744 KB Output is correct
74 Correct 239 ms 36016 KB Output is correct
75 Correct 365 ms 41508 KB Output is correct
76 Correct 455 ms 45196 KB Output is correct
77 Correct 264 ms 31072 KB Output is correct
78 Correct 381 ms 42336 KB Output is correct
79 Correct 426 ms 43596 KB Output is correct
80 Correct 452 ms 45232 KB Output is correct
81 Correct 179 ms 25188 KB Output is correct
82 Correct 329 ms 40396 KB Output is correct
83 Correct 325 ms 35312 KB Output is correct
84 Correct 451 ms 45132 KB Output is correct
85 Correct 349 ms 38048 KB Output is correct
86 Correct 401 ms 41528 KB Output is correct
87 Correct 216 ms 34196 KB Output is correct
88 Correct 367 ms 42080 KB Output is correct
89 Correct 370 ms 39656 KB Output is correct
90 Correct 392 ms 42088 KB Output is correct
91 Correct 246 ms 35780 KB Output is correct
92 Correct 386 ms 41364 KB Output is correct
93 Correct 204 ms 34124 KB Output is correct
94 Correct 384 ms 41572 KB Output is correct
95 Correct 236 ms 35152 KB Output is correct
96 Correct 367 ms 41692 KB Output is correct