oj.uz

답안 #172621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172621 2020-01-02T08:24:40 Z dennisstar Two Antennas (JOI19_antennas) C++11
100 / 100
 1172 ms 75664 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define all(V) ((V).begin()), ((V).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
typedef vector<ll> vlm;

const ll INF=(1ll<<60);

struct Seg {
	Seg *l, *r;
	ll dt1, dt2, dt3;
	Seg() {l=r=NULL; dt1=INF, dt2=dt3=-INF;}
	void upd1(int s, int e, int i, ll val) {
		if (s==e) { dt1=val; dt2=-INF; return; }

		spread();

		int md=(s+e)/2;
		if (i<=md) {
			if (!l) l=new Seg();
			l->upd1(s, md, i, val);
		}
		else {
			if (!r) r=new Seg();
			r->upd1(md+1, e, i, val);
		}

		dt1=min((l?l->dt1:INF), (r?r->dt1:INF));
	}
	void upd2(int s, int e, int is, int ie, ll val) {
		if (is>ie) return ;
		if (is<=s&&e<=ie) { dt2=max(dt2, val); dt3=max(dt3, dt2-dt1); return ; }

		spread();

		int md=(s+e)/2;
		if (is<=md) {
			if (l) l->upd2(s, md, is, ie, val);
		}
		if (md+1<=ie) {
			if (r) r->upd2(md+1, e, is, ie, val);
		}
		dt3=max(dt3, max((l?l->dt3:-INF), (r?r->dt3:-INF)));
	}
	ll get(int s, int e, int is, int ie) {
		if (is>ie) return -INF;
		spread();
		if (is<=s&&e<=ie) return dt3;
		int md=(s+e)/2; ll L, R; L=R=-INF;
		if (is<=md) L=(l?l->get(s, md, is, ie):-INF);
		if (md+1<=ie) R=(r?r->get(md+1, e, is, ie):-INF);
		return max(L, R);
	}
	void spread() {
		dt3=max(dt3, dt2-dt1);
		if (l) l->dt2=max(l->dt2, dt2);
		if (r) r->dt2=max(r->dt2, dt2);
		dt2=-INF;
	}
	void kill(int s, int e, int i) {
		if (s==e) {spread(); dt1=INF; return ;}
		int md=(s+e)/2;
		spread();
		if (i<=md) l->kill(s, md, i);
		else r->kill(md+1, e, i);
		dt1=min((l?l->dt1:INF), (r?r->dt1:INF));
		dt3=max(dt3, max((l?l->dt3:-INF), (r?r->dt3:-INF)));
	}
};
Seg *root;

int N; ll H[200010]; int A[200010], B[200010];
int Q, L[200010], R[200010];
vim Qu[200010]; ll ans[200010];
vim S[400010], E[400010];

void solve() {
	root=new Seg();
	for (int i=1; i<=N; i++) {
		for (int j:S[i]) root->upd1(1, N, j, H[j]);
		for (int j:E[i]) root->kill(1, N, j);
		if (i-A[i]>=1) root->upd2(1, N, max(1, i-B[i]), i-A[i], H[i]);
		for (int j:Qu[i]) ans[j]=max(ans[j], root->get(1, N, L[j], R[j]));
	}
}

int main() {
	//freopen("in.txt", "r", stdin);
	scanf("%d", &N);
	for (int i=1; i<=N; i++) {
		scanf("%lld %d %d", &H[i], &A[i], &B[i]);
		S[i+A[i]].push_back(i);
		E[i+B[i]+1].push_back(i);
	}
	scanf("%d", &Q);
	for (int i=0; i<Q; i++) {
		scanf("%d %d", &L[i], &R[i]);
		Qu[R[i]].push_back(i); ans[i]=-INF;
	}
	solve();
	for (int i=1; i<=N; i++) H[i]=INF-H[i];
	solve();
	for (int i=0; i<Q; i++) printf("%lld\n", ans[i]<0?-1:ans[i]);
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:98:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %d %d", &H[i], &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:102:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:104: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

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 25 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 25 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 20 ms 23940 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 26 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 26 ms 23928 KB Output is correct
13 Correct 25 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 24 ms 23848 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 28 ms 23928 KB Output is correct
19 Correct 28 ms 23836 KB Output is correct
20 Correct 26 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 24 ms 23928 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 25 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 25 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 20 ms 23940 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 26 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 26 ms 23928 KB Output is correct
13 Correct 25 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 24 ms 23848 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 28 ms 23928 KB Output is correct
19 Correct 28 ms 23836 KB Output is correct
20 Correct 26 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 24 ms 23928 KB Output is correct
25 Correct 138 ms 29532 KB Output is correct
26 Correct 44 ms 24824 KB Output is correct
27 Correct 220 ms 31992 KB Output is correct
28 Correct 202 ms 32248 KB Output is correct
29 Correct 136 ms 29728 KB Output is correct
30 Correct 142 ms 29368 KB Output is correct
31 Correct 141 ms 31100 KB Output is correct
32 Correct 205 ms 32248 KB Output is correct
33 Correct 186 ms 31480 KB Output is correct
34 Correct 108 ms 28116 KB Output is correct
35 Correct 195 ms 31992 KB Output is correct
36 Correct 214 ms 32180 KB Output is correct
37 Correct 87 ms 28152 KB Output is correct
38 Correct 163 ms 31124 KB Output is correct
39 Correct 40 ms 25128 KB Output is correct
40 Correct 132 ms 31096 KB Output is correct
41 Correct 99 ms 29176 KB Output is correct
42 Correct 137 ms 31072 KB Output is correct
43 Correct 59 ms 26360 KB Output is correct
44 Correct 127 ms 30968 KB Output is correct
45 Correct 43 ms 25340 KB Output is correct
46 Correct 127 ms 31048 KB Output is correct
47 Correct 51 ms 25980 KB Output is correct
48 Correct 133 ms 31096 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 532 ms 57708 KB Output is correct
2 Correct 584 ms 61560 KB Output is correct
3 Correct 395 ms 50624 KB Output is correct
4 Correct 642 ms 61576 KB Output is correct
5 Correct 265 ms 42104 KB Output is correct
6 Correct 590 ms 61432 KB Output is correct
7 Correct 508 ms 56684 KB Output is correct
8 Correct 588 ms 61556 KB Output is correct
9 Correct 85 ms 30200 KB Output is correct
10 Correct 602 ms 61560 KB Output is correct
11 Correct 342 ms 47736 KB Output is correct
12 Correct 612 ms 60988 KB Output is correct
13 Correct 287 ms 53168 KB Output is correct
14 Correct 267 ms 55932 KB Output is correct
15 Correct 283 ms 56312 KB Output is correct
16 Correct 265 ms 59404 KB Output is correct
17 Correct 308 ms 57484 KB Output is correct
18 Correct 280 ms 58832 KB Output is correct
19 Correct 289 ms 55692 KB Output is correct
20 Correct 278 ms 56256 KB Output is correct
21 Correct 264 ms 55908 KB Output is correct
22 Correct 276 ms 57280 KB Output is correct
23 Correct 277 ms 55544 KB Output is correct
24 Correct 264 ms 56440 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 25 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 25 ms 23928 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 20 ms 23940 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 26 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 26 ms 23928 KB Output is correct
13 Correct 25 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 24 ms 23848 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 28 ms 23928 KB Output is correct
19 Correct 28 ms 23836 KB Output is correct
20 Correct 26 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 24 ms 23928 KB Output is correct
25 Correct 138 ms 29532 KB Output is correct
26 Correct 44 ms 24824 KB Output is correct
27 Correct 220 ms 31992 KB Output is correct
28 Correct 202 ms 32248 KB Output is correct
29 Correct 136 ms 29728 KB Output is correct
30 Correct 142 ms 29368 KB Output is correct
31 Correct 141 ms 31100 KB Output is correct
32 Correct 205 ms 32248 KB Output is correct
33 Correct 186 ms 31480 KB Output is correct
34 Correct 108 ms 28116 KB Output is correct
35 Correct 195 ms 31992 KB Output is correct
36 Correct 214 ms 32180 KB Output is correct
37 Correct 87 ms 28152 KB Output is correct
38 Correct 163 ms 31124 KB Output is correct
39 Correct 40 ms 25128 KB Output is correct
40 Correct 132 ms 31096 KB Output is correct
41 Correct 99 ms 29176 KB Output is correct
42 Correct 137 ms 31072 KB Output is correct
43 Correct 59 ms 26360 KB Output is correct
44 Correct 127 ms 30968 KB Output is correct
45 Correct 43 ms 25340 KB Output is correct
46 Correct 127 ms 31048 KB Output is correct
47 Correct 51 ms 25980 KB Output is correct
48 Correct 133 ms 31096 KB Output is correct
49 Correct 532 ms 57708 KB Output is correct
50 Correct 584 ms 61560 KB Output is correct
51 Correct 395 ms 50624 KB Output is correct
52 Correct 642 ms 61576 KB Output is correct
53 Correct 265 ms 42104 KB Output is correct
54 Correct 590 ms 61432 KB Output is correct
55 Correct 508 ms 56684 KB Output is correct
56 Correct 588 ms 61556 KB Output is correct
57 Correct 85 ms 30200 KB Output is correct
58 Correct 602 ms 61560 KB Output is correct
59 Correct 342 ms 47736 KB Output is correct
60 Correct 612 ms 60988 KB Output is correct
61 Correct 287 ms 53168 KB Output is correct
62 Correct 267 ms 55932 KB Output is correct
63 Correct 283 ms 56312 KB Output is correct
64 Correct 265 ms 59404 KB Output is correct
65 Correct 308 ms 57484 KB Output is correct
66 Correct 280 ms 58832 KB Output is correct
67 Correct 289 ms 55692 KB Output is correct
68 Correct 278 ms 56256 KB Output is correct
69 Correct 264 ms 55908 KB Output is correct
70 Correct 276 ms 57280 KB Output is correct
71 Correct 277 ms 55544 KB Output is correct
72 Correct 264 ms 56440 KB Output is correct
73 Correct 918 ms 68740 KB Output is correct
74 Correct 729 ms 65460 KB Output is correct
75 Correct 947 ms 62752 KB Output is correct
76 Correct 1101 ms 75664 KB Output is correct
77 Correct 519 ms 49976 KB Output is correct
78 Correct 902 ms 72096 KB Output is correct
79 Correct 968 ms 69952 KB Output is correct
80 Correct 1172 ms 75612 KB Output is correct
81 Correct 369 ms 38904 KB Output is correct
82 Correct 843 ms 70392 KB Output is correct
83 Correct 766 ms 59660 KB Output is correct
84 Correct 1077 ms 75504 KB Output is correct
85 Correct 453 ms 62924 KB Output is correct
86 Correct 531 ms 65652 KB Output is correct
87 Correct 313 ms 58108 KB Output is correct
88 Correct 504 ms 69384 KB Output is correct
89 Correct 553 ms 65056 KB Output is correct
90 Correct 555 ms 68664 KB Output is correct
91 Correct 399 ms 59380 KB Output is correct
92 Correct 540 ms 66068 KB Output is correct
93 Correct 311 ms 57824 KB Output is correct
94 Correct 541 ms 67076 KB Output is correct
95 Correct 357 ms 58356 KB Output is correct
96 Correct 469 ms 66168 KB Output is correct