oj.uz

Submission #106777

# Submission time Handle Problem Language Result Execution time Memory
106777 2019-04-20T12:43:00 Z eriksuenderhauf Two Antennas (JOI19_antennas) C++11
100 / 100
 846 ms 44312 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 2e9;
const int MAXN = 2e5 + 5;
const double eps = 1e-9;
ll h[MAXN], ans[MAXN];
int a[MAXN], b[MAXN];
pair<pii,int> qr[MAXN];
pll seg1[MAXN*4], lazy[MAXN*4];
ll seg2[MAXN*4];
int n;
vi arr[2][MAXN];

void build(int l, int r, int k) {
	seg1[k] = {INF, -INF};
	lazy[k] = {INF, -INF};
	seg2[k] = -1;
	if (l == r)
		return;
	int m = (l + r) / 2;
	build(l, m, k*2);
	build(m+1, r, k*2+1);
}

void prop(int l, int r, int k) {
	if (l != r) {
		lazy[k*2].fi = min(lazy[k*2].fi, lazy[k].fi);
		lazy[k*2].se = max(lazy[k*2].se, lazy[k].se);
		lazy[k*2+1].fi = min(lazy[k*2+1].fi, lazy[k].fi);
		lazy[k*2+1].se = max(lazy[k*2+1].se, lazy[k].se);
	}
	lazy[k] = {INF, -INF};
}

void upd1(int l, int r, int k, int x, pll val) {
	if (lazy[k] != mp(INF, -INF)) {
		seg2[k] = max(seg2[k], max(lazy[k].se - seg1[k].fi, seg1[k].se - lazy[k].fi));
		prop(l, r, k);
	}
	if (r < x || x < l) return;
	if (x <= l && r <= x) {
		seg1[k] = val;
		return;
	}
	int m = (l + r) / 2;
	upd1(l, m, k*2, x, val);
	upd1(m+1, r, k*2+1, x, val);
	seg1[k].fi = min(seg1[k*2].fi, seg1[k*2+1].fi);
	seg1[k].se = max(seg1[k*2].se, seg1[k*2+1].se);
}

void upd2(int l, int r, int k, int x, int y, ll val) {
	if (lazy[k] != mp(INF, -INF)) {
		seg2[k] = max(seg2[k], max(lazy[k].se - seg1[k].fi, seg1[k].se - lazy[k].fi));
		prop(l, r, k);
	}
	if (r < x || y < l || y < x) return;
	if (x <= l && r <= y) {
		seg2[k] = max(seg2[k], max(val - seg1[k].fi, seg1[k].se - val));
		lazy[k] = mp(val, val);
		prop(l, r, k);
		return;
	}
	int m = (l + r) / 2;
	upd2(l, m, k*2, x, y, val);
	upd2(m+1, r, k*2+1, x, y, val);
	seg2[k] = max(seg2[k*2], seg2[k*2+1]);
}

ll qry(int l, int r, int k, int x, int y) {
	if (r < x || y < l || y < x) return -1;
	if (lazy[k] != mp(INF, -INF)) {
		seg2[k] = max(seg2[k], max(lazy[k].se - seg1[k].fi, seg1[k].se - lazy[k].fi));
		prop(l, r, k);
	}
	if (x <= l && r <= y)
		return seg2[k];
	int m = (l + r) / 2;
	return max(qry(l, m, k*2, x, y), qry(m+1, r, k*2+1, x, y));
}

void ins(int ind) {
	int lo = max(1, ind - b[ind]), hi = max(0, ind - a[ind]);
	for (int nx: arr[0][ind])
		upd1(1, n, 1, nx, mp(h[nx], h[nx]));
	for (int nx: arr[1][ind])
		upd1(1, n, 1, nx, mp(INF, -INF));
	upd2(1, n, 1, lo, hi, h[ind]);
	lo = min(n + 1, ind + a[ind]);
	hi = min(n, ind + b[ind]);
	arr[0][lo].pb(ind);
	arr[1][hi + 1].pb(ind);
}

int main() {
	int q;
	ni(n);
	build(1, n, 1);
	for (int i = 1; i <= n; i++)
		scanf("%d %d %d", &h[i], &a[i], &b[i]);
	ni(q);
	for (int i = 1; i <= q; i++) {
		scanf("%d %d", &qr[i].fi.fi, &qr[i].fi.se);
		qr[i].se = i;
	}
	sort(qr+1, qr+1+ q, [](pair<pii,int> l, pair<pii,int> r) {
		return l.fi.se < r.fi.se;
	});
	int cur = 1;
	for (int i = 1; i <= q; i++) {
		while (cur <= qr[i].fi.se)
			ins(cur++);
		ans[qr[i].se] = qry(1, n, 1, qr[i].fi.fi, qr[i].fi.se);
	}
	for (int i = 1; i <= q; i++)
		pri(ans[i]);
    return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:130:40: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
   scanf("%d %d %d", &h[i], &a[i], &b[i]);
                     ~~~~~              ^
antennas.cpp:12:34: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 #define pri(n) printf("%d\n", (n))
                               ~~~^
antennas.cpp:146:3: note: in expansion of macro 'pri'
   pri(ans[i]);
   ^~~
antennas.cpp:8:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
antennas.cpp:127:2: note: in expansion of macro 'ni'
  ni(n);
  ^~
antennas.cpp:130: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:8:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
antennas.cpp:131:2: note: in expansion of macro 'ni'
  ni(q);
  ^~
antennas.cpp:133:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &qr[i].fi.fi, &qr[i].fi.se);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9728 KB Output is correct
2 Correct 14 ms 9856 KB Output is correct
3 Correct 12 ms 9856 KB Output is correct
4 Correct 13 ms 9856 KB Output is correct
5 Correct 12 ms 9728 KB Output is correct
6 Correct 11 ms 9856 KB Output is correct
7 Correct 14 ms 9856 KB Output is correct
8 Correct 14 ms 9856 KB Output is correct
9 Correct 12 ms 9728 KB Output is correct
10 Correct 13 ms 9856 KB Output is correct
11 Correct 15 ms 9856 KB Output is correct
12 Correct 13 ms 9856 KB Output is correct
13 Correct 15 ms 9856 KB Output is correct
14 Correct 14 ms 9856 KB Output is correct
15 Correct 12 ms 9856 KB Output is correct
16 Correct 13 ms 9856 KB Output is correct
17 Correct 13 ms 9728 KB Output is correct
18 Correct 13 ms 9856 KB Output is correct
19 Correct 13 ms 9856 KB Output is correct
20 Correct 14 ms 9856 KB Output is correct
21 Correct 12 ms 9772 KB Output is correct
22 Correct 12 ms 9856 KB Output is correct
23 Correct 12 ms 9856 KB Output is correct
24 Correct 14 ms 9856 KB Output is correct
25 Correct 134 ms 14072 KB Output is correct
26 Correct 28 ms 10360 KB Output is correct
27 Correct 155 ms 15592 KB Output is correct
28 Correct 199 ms 15608 KB Output is correct
29 Correct 116 ms 14044 KB Output is correct
30 Correct 106 ms 13688 KB Output is correct
31 Correct 110 ms 15156 KB Output is correct
32 Correct 162 ms 15580 KB Output is correct
33 Correct 132 ms 15352 KB Output is correct
34 Correct 70 ms 12664 KB Output is correct
35 Correct 143 ms 15608 KB Output is correct
36 Correct 180 ms 15736 KB Output is correct
37 Correct 120 ms 12664 KB Output is correct
38 Correct 157 ms 14696 KB Output is correct
39 Correct 32 ms 10616 KB Output is correct
40 Correct 152 ms 14840 KB Output is correct
41 Correct 127 ms 13432 KB Output is correct
42 Correct 144 ms 14712 KB Output is correct
43 Correct 60 ms 11512 KB Output is correct
44 Correct 149 ms 14684 KB Output is correct
45 Correct 33 ms 10752 KB Output is correct
46 Correct 135 ms 14712 KB Output is correct
47 Correct 41 ms 11100 KB Output is correct
48 Correct 146 ms 14840 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 38144 KB Output is correct
2 Correct 496 ms 38640 KB Output is correct
3 Correct 288 ms 35824 KB Output is correct
4 Correct 462 ms 38596 KB Output is correct
5 Correct 192 ms 23924 KB Output is correct
6 Correct 441 ms 38528 KB Output is correct
7 Correct 381 ms 37108 KB Output is correct
8 Correct 437 ms 38516 KB Output is correct
9 Correct 55 ms 13560 KB Output is correct
10 Correct 500 ms 38512 KB Output is correct
11 Correct 262 ms 24984 KB Output is correct
12 Correct 473 ms 38708 KB Output is correct
13 Correct 264 ms 35652 KB Output is correct
14 Correct 194 ms 36256 KB Output is correct
15 Correct 201 ms 35704 KB Output is correct
16 Correct 222 ms 36052 KB Output is correct
17 Correct 284 ms 35836 KB Output is correct
18 Correct 228 ms 36204 KB Output is correct
19 Correct 235 ms 35664 KB Output is correct
20 Correct 214 ms 35668 KB Output is correct
21 Correct 241 ms 35744 KB Output is correct
22 Correct 218 ms 36088 KB Output is correct
23 Correct 245 ms 35588 KB Output is correct
24 Correct 190 ms 35784 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9728 KB Output is correct
2 Correct 14 ms 9856 KB Output is correct
3 Correct 12 ms 9856 KB Output is correct
4 Correct 13 ms 9856 KB Output is correct
5 Correct 12 ms 9728 KB Output is correct
6 Correct 11 ms 9856 KB Output is correct
7 Correct 14 ms 9856 KB Output is correct
8 Correct 14 ms 9856 KB Output is correct
9 Correct 12 ms 9728 KB Output is correct
10 Correct 13 ms 9856 KB Output is correct
11 Correct 15 ms 9856 KB Output is correct
12 Correct 13 ms 9856 KB Output is correct
13 Correct 15 ms 9856 KB Output is correct
14 Correct 14 ms 9856 KB Output is correct
15 Correct 12 ms 9856 KB Output is correct
16 Correct 13 ms 9856 KB Output is correct
17 Correct 13 ms 9728 KB Output is correct
18 Correct 13 ms 9856 KB Output is correct
19 Correct 13 ms 9856 KB Output is correct
20 Correct 14 ms 9856 KB Output is correct
21 Correct 12 ms 9772 KB Output is correct
22 Correct 12 ms 9856 KB Output is correct
23 Correct 12 ms 9856 KB Output is correct
24 Correct 14 ms 9856 KB Output is correct
25 Correct 134 ms 14072 KB Output is correct
26 Correct 28 ms 10360 KB Output is correct
27 Correct 155 ms 15592 KB Output is correct
28 Correct 199 ms 15608 KB Output is correct
29 Correct 116 ms 14044 KB Output is correct
30 Correct 106 ms 13688 KB Output is correct
31 Correct 110 ms 15156 KB Output is correct
32 Correct 162 ms 15580 KB Output is correct
33 Correct 132 ms 15352 KB Output is correct
34 Correct 70 ms 12664 KB Output is correct
35 Correct 143 ms 15608 KB Output is correct
36 Correct 180 ms 15736 KB Output is correct
37 Correct 120 ms 12664 KB Output is correct
38 Correct 157 ms 14696 KB Output is correct
39 Correct 32 ms 10616 KB Output is correct
40 Correct 152 ms 14840 KB Output is correct
41 Correct 127 ms 13432 KB Output is correct
42 Correct 144 ms 14712 KB Output is correct
43 Correct 60 ms 11512 KB Output is correct
44 Correct 149 ms 14684 KB Output is correct
45 Correct 33 ms 10752 KB Output is correct
46 Correct 135 ms 14712 KB Output is correct
47 Correct 41 ms 11100 KB Output is correct
48 Correct 146 ms 14840 KB Output is correct
49 Correct 452 ms 38144 KB Output is correct
50 Correct 496 ms 38640 KB Output is correct
51 Correct 288 ms 35824 KB Output is correct
52 Correct 462 ms 38596 KB Output is correct
53 Correct 192 ms 23924 KB Output is correct
54 Correct 441 ms 38528 KB Output is correct
55 Correct 381 ms 37108 KB Output is correct
56 Correct 437 ms 38516 KB Output is correct
57 Correct 55 ms 13560 KB Output is correct
58 Correct 500 ms 38512 KB Output is correct
59 Correct 262 ms 24984 KB Output is correct
60 Correct 473 ms 38708 KB Output is correct
61 Correct 264 ms 35652 KB Output is correct
62 Correct 194 ms 36256 KB Output is correct
63 Correct 201 ms 35704 KB Output is correct
64 Correct 222 ms 36052 KB Output is correct
65 Correct 284 ms 35836 KB Output is correct
66 Correct 228 ms 36204 KB Output is correct
67 Correct 235 ms 35664 KB Output is correct
68 Correct 214 ms 35668 KB Output is correct
69 Correct 241 ms 35744 KB Output is correct
70 Correct 218 ms 36088 KB Output is correct
71 Correct 245 ms 35588 KB Output is correct
72 Correct 190 ms 35784 KB Output is correct
73 Correct 714 ms 41724 KB Output is correct
74 Correct 530 ms 38900 KB Output is correct
75 Correct 584 ms 41728 KB Output is correct
76 Correct 773 ms 44108 KB Output is correct
77 Correct 349 ms 28112 KB Output is correct
78 Correct 710 ms 42036 KB Output is correct
79 Correct 678 ms 43000 KB Output is correct
80 Correct 846 ms 44312 KB Output is correct
81 Correct 274 ms 19368 KB Output is correct
82 Correct 672 ms 41004 KB Output is correct
83 Correct 602 ms 30828 KB Output is correct
84 Correct 785 ms 44176 KB Output is correct
85 Correct 472 ms 38412 KB Output is correct
86 Correct 443 ms 40352 KB Output is correct
87 Correct 261 ms 36296 KB Output is correct
88 Correct 504 ms 40736 KB Output is correct
89 Correct 459 ms 39084 KB Output is correct
90 Correct 465 ms 40736 KB Output is correct
91 Correct 308 ms 37340 KB Output is correct
92 Correct 477 ms 40296 KB Output is correct
93 Correct 258 ms 36508 KB Output is correct
94 Correct 473 ms 40556 KB Output is correct
95 Correct 309 ms 36884 KB Output is correct
96 Correct 460 ms 40328 KB Output is correct