oj.uz

Submission #292890

# Submission time Handle Problem Language Result Execution time Memory
292890 2020-09-07T14:38:05 Z arnold518 Two Antennas (JOI19_antennas) C++14
100 / 100
 1209 ms 39388 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const ll INF = 1e17;

struct Query
{
	int l, r, p;
};

int N, Q;
int A[MAXN+10], B[MAXN+10], H[MAXN+10];
Query C[MAXN+10];

struct Node
{
	ll lazy, val, val2;
	Node() : lazy(-INF), val(-INF), val2(-INF) {}
};

Node tree[MAXN*4+10];
ll P[MAXN+10], ans[MAXN+10];

Node operator + (Node p, Node q)
{
	Node ret;
	ret.val=max(p.val, q.val);
	ret.val2=max(p.val2, q.val2);
	return ret;
}

void busy(int node, int tl, int tr)
{
	tree[node].val=max(tree[node].val, tree[node].val2+tree[node].lazy);
	if(tl!=tr) tree[node*2].lazy=max(tree[node*2].lazy, tree[node].lazy), tree[node*2+1].lazy=max(tree[node*2+1].lazy, tree[node].lazy);
	else P[tl]=max(P[tl], tree[node].lazy);
	tree[node].lazy=-INF;
}

void init(int node, int tl, int tr)
{
	tree[node]=Node();
	if(tl==tr)
	{
		P[tl]=-INF;
		return;
	}
	int mid=tl+tr>>1;
	init(node*2, tl, mid);
	init(node*2+1, mid+1, tr);
}

void update1(int node, int tl, int tr, int l, int r, ll k)
{
	busy(node, tl, tr);
	if(r<tl || tr<l) return;
	if(l<=tl && tr<=r)
	{
		tree[node].lazy=k;
		busy(node, tl, tr);
		return;
	}
	int mid=tl+tr>>1;
	update1(node*2, tl, mid, l, r, k);
	update1(node*2+1, mid+1, tr, l, r, k);
	tree[node]=tree[node*2]+tree[node*2+1];
}

void update2(int node, int tl, int tr, int p, ll k)
{
	busy(node, tl, tr);
	if(tr<p || p<tl) return;
	if(tl==tr)
	{
		tree[node].val2=k;
		return;
	}
	int mid=tl+tr>>1;
	update2(node*2, tl, mid, p, k);
	update2(node*2+1, mid+1, tr, p, k);
	tree[node]=tree[node*2]+tree[node*2+1];
}

ll query(int node, int tl, int tr, int l, int r)
{
	busy(node, tl, tr);
	if(l<=tl && tr<=r) return tree[node].val;
	if(r<tl || tr<l) return -INF;
	int mid=tl+tr>>1;
	return max(query(node*2, tl, mid, l, r), query(node*2+1, mid+1 ,tr, l, r));
}

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++) scanf("%d%d%d", &H[i], &A[i], &B[i]);
	scanf("%d", &Q);
	for(int i=1; i<=Q; i++) scanf("%d%d", &C[i].l, &C[i].r), C[i].p=i;

	sort(C+1, C+Q+1, [&](const Query &p, const Query &q) { return p.r<q.r; });
	
	vector<pii> V;
	for(int i=1; i<=N; i++)
	{
		V.push_back({i+A[i], i});
		V.push_back({i+B[i]+1, -i});
	}	
	sort(V.begin(), V.end());

	for(int i=1; i<=Q; i++) ans[i]=-INF;

	init(1, 1, N);
	for(int i=1, j=0, k=1; i<=N; i++)
	{
		for(; j<V.size() && V[j].first<=i; j++)
		{
			if(V[j].second>0) 
			{
				update2(1, 1, N, V[j].second, -H[V[j].second]);
			}
			else
			{
				update2(1, 1, N, -V[j].second, -INF);
			}
		}
		int l=i-B[i], r=i-A[i];
		update1(1, 1, N, l, r, H[i]);
		for(; k<=Q && C[k].r==i; k++)
		{
			ans[C[k].p]=max(ans[C[k].p], query(1, 1, N, C[k].l, C[k].r));
		}
	}

	for(int i=1; i<=N; i++) H[i]=-H[i];
	init(1, 1, N);
	for(int i=1, j=0, k=1; i<=N; i++)
	{
		for(; j<V.size() && V[j].first<=i; j++)
		{
			if(V[j].second>0) 
			{
				update2(1, 1, N, V[j].second, -H[V[j].second]);
			}
			else
			{
				update2(1, 1, N, -V[j].second, -INF);
			}
		}
		int l=i-B[i], r=i-A[i];
		update1(1, 1, N, l, r, H[i]);
		for(; k<=Q && C[k].r==i; k++)
		{
			ans[C[k].p]=max(ans[C[k].p], query(1, 1, N, C[k].l, C[k].r));
		}
	}

	for(int i=1; i<=Q; i++)
	{
		if(ans[i]<0) ans[i]=-1;
		printf("%lld\n", ans[i]);
	}
}

Compilation message

antennas.cpp: In function 'void init(int, int, int)':
antennas.cpp:53:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |  int mid=tl+tr>>1;
      |          ~~^~~
antennas.cpp: In function 'void update1(int, int, int, int, int, ll)':
antennas.cpp:68:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |  int mid=tl+tr>>1;
      |          ~~^~~
antennas.cpp: In function 'void update2(int, int, int, int, ll)':
antennas.cpp:83:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |  int mid=tl+tr>>1;
      |          ~~^~~
antennas.cpp: In function 'll query(int, int, int, int, int)':
antennas.cpp:94:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |  int mid=tl+tr>>1;
      |          ~~^~~
antennas.cpp: In function 'int main()':
antennas.cpp:120:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |   for(; j<V.size() && V[j].first<=i; j++)
      |         ~^~~~~~~~~
antennas.cpp:143:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |   for(; j<V.size() && V[j].first<=i; j++)
      |         ~^~~~~~~~~
antennas.cpp:100:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  100 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
antennas.cpp:101:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  101 |  for(int i=1; i<=N; i++) scanf("%d%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]
  102 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
antennas.cpp:103:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |  for(int i=1; i<=Q; i++) scanf("%d%d", &C[i].l, &C[i].r), C[i].p=i;
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19200 KB Output is correct
2 Correct 12 ms 19200 KB Output is correct
3 Correct 12 ms 19200 KB Output is correct
4 Correct 12 ms 19200 KB Output is correct
5 Correct 12 ms 19200 KB Output is correct
6 Correct 12 ms 19200 KB Output is correct
7 Correct 12 ms 19200 KB Output is correct
8 Correct 13 ms 19200 KB Output is correct
9 Correct 12 ms 19200 KB Output is correct
10 Correct 12 ms 19200 KB Output is correct
11 Correct 12 ms 19200 KB Output is correct
12 Correct 12 ms 19200 KB Output is correct
13 Correct 12 ms 19200 KB Output is correct
14 Correct 12 ms 19200 KB Output is correct
15 Correct 12 ms 19148 KB Output is correct
16 Correct 12 ms 19200 KB Output is correct
17 Correct 12 ms 19200 KB Output is correct
18 Correct 13 ms 19200 KB Output is correct
19 Correct 12 ms 19200 KB Output is correct
20 Correct 12 ms 19200 KB Output is correct
21 Correct 14 ms 19200 KB Output is correct
22 Correct 12 ms 19200 KB Output is correct
23 Correct 12 ms 19200 KB Output is correct
24 Correct 12 ms 19200 KB Output is correct
25 Correct 172 ms 24440 KB Output is correct
26 Correct 32 ms 19840 KB Output is correct
27 Correct 259 ms 26616 KB Output is correct
28 Correct 268 ms 26872 KB Output is correct
29 Correct 177 ms 24440 KB Output is correct
30 Correct 204 ms 24312 KB Output is correct
31 Correct 212 ms 25976 KB Output is correct
32 Correct 258 ms 26744 KB Output is correct
33 Correct 256 ms 26236 KB Output is correct
34 Correct 131 ms 22904 KB Output is correct
35 Correct 282 ms 26616 KB Output is correct
36 Correct 278 ms 26708 KB Output is correct
37 Correct 157 ms 23032 KB Output is correct
38 Correct 270 ms 25804 KB Output is correct
39 Correct 48 ms 20216 KB Output is correct
40 Correct 288 ms 25776 KB Output is correct
41 Correct 186 ms 24056 KB Output is correct
42 Correct 282 ms 25720 KB Output is correct
43 Correct 92 ms 21368 KB Output is correct
44 Correct 254 ms 25720 KB Output is correct
45 Correct 54 ms 20344 KB Output is correct
46 Correct 269 ms 25848 KB Output is correct
47 Correct 74 ms 20856 KB Output is correct
48 Correct 257 ms 25720 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 565 ms 25692 KB Output is correct
2 Correct 635 ms 30812 KB Output is correct
3 Correct 432 ms 28136 KB Output is correct
4 Correct 699 ms 30812 KB Output is correct
5 Correct 288 ms 24428 KB Output is correct
6 Correct 660 ms 30812 KB Output is correct
7 Correct 562 ms 29288 KB Output is correct
8 Correct 665 ms 30916 KB Output is correct
9 Correct 91 ms 21104 KB Output is correct
10 Correct 651 ms 30812 KB Output is correct
11 Correct 388 ms 26468 KB Output is correct
12 Correct 668 ms 30816 KB Output is correct
13 Correct 529 ms 30816 KB Output is correct
14 Correct 482 ms 30684 KB Output is correct
15 Correct 467 ms 30692 KB Output is correct
16 Correct 396 ms 30860 KB Output is correct
17 Correct 508 ms 30684 KB Output is correct
18 Correct 449 ms 30812 KB Output is correct
19 Correct 476 ms 30692 KB Output is correct
20 Correct 452 ms 30684 KB Output is correct
21 Correct 429 ms 30684 KB Output is correct
22 Correct 457 ms 30696 KB Output is correct
23 Correct 465 ms 30684 KB Output is correct
24 Correct 397 ms 30688 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19200 KB Output is correct
2 Correct 12 ms 19200 KB Output is correct
3 Correct 12 ms 19200 KB Output is correct
4 Correct 12 ms 19200 KB Output is correct
5 Correct 12 ms 19200 KB Output is correct
6 Correct 12 ms 19200 KB Output is correct
7 Correct 12 ms 19200 KB Output is correct
8 Correct 13 ms 19200 KB Output is correct
9 Correct 12 ms 19200 KB Output is correct
10 Correct 12 ms 19200 KB Output is correct
11 Correct 12 ms 19200 KB Output is correct
12 Correct 12 ms 19200 KB Output is correct
13 Correct 12 ms 19200 KB Output is correct
14 Correct 12 ms 19200 KB Output is correct
15 Correct 12 ms 19148 KB Output is correct
16 Correct 12 ms 19200 KB Output is correct
17 Correct 12 ms 19200 KB Output is correct
18 Correct 13 ms 19200 KB Output is correct
19 Correct 12 ms 19200 KB Output is correct
20 Correct 12 ms 19200 KB Output is correct
21 Correct 14 ms 19200 KB Output is correct
22 Correct 12 ms 19200 KB Output is correct
23 Correct 12 ms 19200 KB Output is correct
24 Correct 12 ms 19200 KB Output is correct
25 Correct 172 ms 24440 KB Output is correct
26 Correct 32 ms 19840 KB Output is correct
27 Correct 259 ms 26616 KB Output is correct
28 Correct 268 ms 26872 KB Output is correct
29 Correct 177 ms 24440 KB Output is correct
30 Correct 204 ms 24312 KB Output is correct
31 Correct 212 ms 25976 KB Output is correct
32 Correct 258 ms 26744 KB Output is correct
33 Correct 256 ms 26236 KB Output is correct
34 Correct 131 ms 22904 KB Output is correct
35 Correct 282 ms 26616 KB Output is correct
36 Correct 278 ms 26708 KB Output is correct
37 Correct 157 ms 23032 KB Output is correct
38 Correct 270 ms 25804 KB Output is correct
39 Correct 48 ms 20216 KB Output is correct
40 Correct 288 ms 25776 KB Output is correct
41 Correct 186 ms 24056 KB Output is correct
42 Correct 282 ms 25720 KB Output is correct
43 Correct 92 ms 21368 KB Output is correct
44 Correct 254 ms 25720 KB Output is correct
45 Correct 54 ms 20344 KB Output is correct
46 Correct 269 ms 25848 KB Output is correct
47 Correct 74 ms 20856 KB Output is correct
48 Correct 257 ms 25720 KB Output is correct
49 Correct 565 ms 25692 KB Output is correct
50 Correct 635 ms 30812 KB Output is correct
51 Correct 432 ms 28136 KB Output is correct
52 Correct 699 ms 30812 KB Output is correct
53 Correct 288 ms 24428 KB Output is correct
54 Correct 660 ms 30812 KB Output is correct
55 Correct 562 ms 29288 KB Output is correct
56 Correct 665 ms 30916 KB Output is correct
57 Correct 91 ms 21104 KB Output is correct
58 Correct 651 ms 30812 KB Output is correct
59 Correct 388 ms 26468 KB Output is correct
60 Correct 668 ms 30816 KB Output is correct
61 Correct 529 ms 30816 KB Output is correct
62 Correct 482 ms 30684 KB Output is correct
63 Correct 467 ms 30692 KB Output is correct
64 Correct 396 ms 30860 KB Output is correct
65 Correct 508 ms 30684 KB Output is correct
66 Correct 449 ms 30812 KB Output is correct
67 Correct 476 ms 30692 KB Output is correct
68 Correct 452 ms 30684 KB Output is correct
69 Correct 429 ms 30684 KB Output is correct
70 Correct 457 ms 30696 KB Output is correct
71 Correct 465 ms 30684 KB Output is correct
72 Correct 397 ms 30688 KB Output is correct
73 Correct 959 ms 36008 KB Output is correct
74 Correct 668 ms 31580 KB Output is correct
75 Correct 928 ms 35804 KB Output is correct
76 Correct 1209 ms 39260 KB Output is correct
77 Correct 606 ms 30656 KB Output is correct
78 Correct 1034 ms 36572 KB Output is correct
79 Correct 1117 ms 37980 KB Output is correct
80 Correct 1179 ms 39388 KB Output is correct
81 Correct 422 ms 28912 KB Output is correct
82 Correct 902 ms 34908 KB Output is correct
83 Correct 841 ms 34916 KB Output is correct
84 Correct 1208 ms 39388 KB Output is correct
85 Correct 845 ms 34968 KB Output is correct
86 Correct 1002 ms 38108 KB Output is correct
87 Correct 541 ms 31660 KB Output is correct
88 Correct 946 ms 38236 KB Output is correct
89 Correct 903 ms 36048 KB Output is correct
90 Correct 1016 ms 38108 KB Output is correct
91 Correct 664 ms 33176 KB Output is correct
92 Correct 975 ms 38108 KB Output is correct
93 Correct 525 ms 31976 KB Output is correct
94 Correct 1002 ms 37980 KB Output is correct
95 Correct 629 ms 32604 KB Output is correct
96 Correct 966 ms 38108 KB Output is correct