oj.uz

답안 #200032

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200032 2020-02-05T01:44:02 Z arnold518 Two Antennas (JOI19_antennas) C++14
100 / 100
 921 ms 31452 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 = 1e15;

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

int N, Q;
int H[MAXN+10], A[MAXN+10], B[MAXN+10];
ll ans[MAXN+10];
Query query[MAXN+10];

ll tree[MAXN*4+10], val[MAXN*4+10], lazy[MAXN*4+10];

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

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

void update(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)
	{
		lazy[node]=k;
		busy(node, tl, tr);
		return;
	}
	int mid=tl+tr>>1;
	update(node*2, tl, mid, l, r, k);
	update(node*2+1, mid+1, tr, l, r, k);
	tree[node]=max(tree[node*2], tree[node*2+1]);
}

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

void update2(int node, int tl, int tr, int pos, ll k)
{
	busy(node, tl, tr);
	if(tl==tr)
	{
		val[node]=k;
		return;
	}
	int mid=tl+tr>>1;
	if(pos<=mid) update2(node*2, tl, mid, pos, k);
	else update2(node*2+1, mid+1, tr, pos, k);
	val[node]=max(val[node*2], val[node*2+1]);
}

void debug(int node, int tl, int tr)
{
	busy(node, tl, tr);
	printf("DEBUG %d %d : %d %d %d\n", tl, tr, tree[node], val[node], lazy[node]);
	if(tl==tr) return;
	int mid=tl+tr>>1;
	debug(node*2, tl, mid);
	debug(node*2+1, mid+1, tr);
}

int main()
{
	int i, j, k;

	scanf("%d", &N);
	for(i=1; i<=N; i++) scanf("%d%d%d", &H[i], &A[i], &B[i]);
	scanf("%d", &Q);
	for(i=1; i<=Q; i++) scanf("%d%d", &query[i].l, &query[i].r), query[i].p=i, ans[i]=-INF;
	sort(query+1, query+Q+1, [&](const Query &p, const Query &q) { return p.r<q.r; });
		
	vector<pii> todo;
	for(i=1; i<=N; i++)
	{
		todo.push_back({i+A[i], i});
		todo.push_back({i+B[i]+1, -i});
	}
	sort(todo.begin(), todo.end());

	init(1, 1, N);
	for(i=1, j=1, k=0; i<=N; i++)
	{
		int l=i-B[i], r=i-A[i];
		for(; k<todo.size() && todo[k].first==i; k++)
		{
			int t=todo[k].second;
			if(t>0) update2(1, 1, N, t, -H[t]);//, printf("UPDATE2 %d %d\n", t, -H[t]);
			else update2(1, 1, N, -t, -INF);//, printf("UPDATE3 %d %d\n", -t, -INF);
		}
		if(r>=1) update(1, 1, N, max(1, l), r, H[i]);//printf("UPDATE %d %d %d\n", max(1, l), r, H[i]);
		//debug(1, 1, N);

		for(; j<=Q && query[j].r==i; j++)
		{
			ans[query[j].p]=max(ans[query[j].p], qquery(1, 1, N, query[j].l, query[j].r));
			//printf("QUERY %lld %lld %lld\n", query[j].l, query[j].r, qquery(1, 1, N, query[j].l, query[j].r));
		}
	}

	init(1, 1, N);
	for(i=1, j=1, k=0; i<=N; i++)
	{
		int l=i-B[i], r=i-A[i];
		for(; k<todo.size() && todo[k].first<=i; k++)
		{
			int t=todo[k].second;
			if(t>0) update2(1, 1, N, t, H[t]);
			else update2(1, 1, N, -t, -INF);
		}
		if(r>=1) update(1, 1, N, max(1, l), r, -H[i]);

		for(; j<=Q && query[j].r==i; j++)
		{
			ans[query[j].p]=max(ans[query[j].p], qquery(1, 1, N, query[j].l, query[j].r));
		}
	}
	for(i=1; i<=Q; i++)
	{
		if(ans[i]<=-1e14) ans[i]=-1;
		printf("%lld\n", ans[i]);
	}
}

Compilation message

antennas.cpp: In function 'void init(int, int, int)':
antennas.cpp:26:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
antennas.cpp: In function 'void update(int, int, int, int, int, ll)':
antennas.cpp:52:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
antennas.cpp: In function 'll qquery(int, int, int, int, int)':
antennas.cpp:63:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
antennas.cpp: In function 'void update2(int, int, int, int, ll)':
antennas.cpp:75:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
antennas.cpp: In function 'void debug(int, int, int)':
antennas.cpp:84:78: warning: format '%d' expects argument of type 'int', but argument 4 has type 'll {aka long long int}' [-Wformat=]
  printf("DEBUG %d %d : %d %d %d\n", tl, tr, tree[node], val[node], lazy[node]);
                                             ~~~~~~~~~~                       ^
antennas.cpp:84:78: warning: format '%d' expects argument of type 'int', but argument 5 has type 'll {aka long long int}' [-Wformat=]
antennas.cpp:84:78: warning: format '%d' expects argument of type 'int', but argument 6 has type 'll {aka long long int}' [-Wformat=]
antennas.cpp:86:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
antennas.cpp: In function 'int main()':
antennas.cpp:113:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; k<todo.size() && todo[k].first==i; k++)
         ~^~~~~~~~~~~~
antennas.cpp:133:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(; k<todo.size() && todo[k].first<=i; k++)
         ~^~~~~~~~~~~~
antennas.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:96:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%d%d%d", &H[i], &A[i], &B[i]);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:97:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:98:75: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=Q; i++) scanf("%d%d", &query[i].l, &query[i].r), query[i].p=i, ans[i]=-INF;
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 372 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 152 ms 5880 KB Output is correct
26 Correct 22 ms 1144 KB Output is correct
27 Correct 221 ms 8228 KB Output is correct
28 Correct 212 ms 8016 KB Output is correct
29 Correct 143 ms 5756 KB Output is correct
30 Correct 145 ms 5628 KB Output is correct
31 Correct 182 ms 7316 KB Output is correct
32 Correct 225 ms 8056 KB Output is correct
33 Correct 209 ms 7544 KB Output is correct
34 Correct 118 ms 4344 KB Output is correct
35 Correct 207 ms 7928 KB Output is correct
36 Correct 230 ms 8056 KB Output is correct
37 Correct 126 ms 4344 KB Output is correct
38 Correct 210 ms 7032 KB Output is correct
39 Correct 35 ms 1400 KB Output is correct
40 Correct 217 ms 7288 KB Output is correct
41 Correct 173 ms 5368 KB Output is correct
42 Correct 243 ms 7288 KB Output is correct
43 Correct 79 ms 2684 KB Output is correct
44 Correct 224 ms 7160 KB Output is correct
45 Correct 41 ms 1660 KB Output is correct
46 Correct 224 ms 7036 KB Output is correct
47 Correct 64 ms 2324 KB Output is correct
48 Correct 209 ms 7160 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 397 ms 21724 KB Output is correct
2 Correct 445 ms 22876 KB Output is correct
3 Correct 299 ms 19804 KB Output is correct
4 Correct 439 ms 22944 KB Output is correct
5 Correct 170 ms 11108 KB Output is correct
6 Correct 441 ms 22876 KB Output is correct
7 Correct 378 ms 21468 KB Output is correct
8 Correct 443 ms 22876 KB Output is correct
9 Correct 52 ms 3564 KB Output is correct
10 Correct 449 ms 22748 KB Output is correct
11 Correct 235 ms 12776 KB Output is correct
12 Correct 468 ms 22916 KB Output is correct
13 Correct 324 ms 22748 KB Output is correct
14 Correct 306 ms 22748 KB Output is correct
15 Correct 302 ms 22620 KB Output is correct
16 Correct 255 ms 22744 KB Output is correct
17 Correct 331 ms 22620 KB Output is correct
18 Correct 280 ms 22876 KB Output is correct
19 Correct 314 ms 22748 KB Output is correct
20 Correct 310 ms 22748 KB Output is correct
21 Correct 294 ms 22624 KB Output is correct
22 Correct 307 ms 22620 KB Output is correct
23 Correct 316 ms 22748 KB Output is correct
24 Correct 260 ms 22752 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 372 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 152 ms 5880 KB Output is correct
26 Correct 22 ms 1144 KB Output is correct
27 Correct 221 ms 8228 KB Output is correct
28 Correct 212 ms 8016 KB Output is correct
29 Correct 143 ms 5756 KB Output is correct
30 Correct 145 ms 5628 KB Output is correct
31 Correct 182 ms 7316 KB Output is correct
32 Correct 225 ms 8056 KB Output is correct
33 Correct 209 ms 7544 KB Output is correct
34 Correct 118 ms 4344 KB Output is correct
35 Correct 207 ms 7928 KB Output is correct
36 Correct 230 ms 8056 KB Output is correct
37 Correct 126 ms 4344 KB Output is correct
38 Correct 210 ms 7032 KB Output is correct
39 Correct 35 ms 1400 KB Output is correct
40 Correct 217 ms 7288 KB Output is correct
41 Correct 173 ms 5368 KB Output is correct
42 Correct 243 ms 7288 KB Output is correct
43 Correct 79 ms 2684 KB Output is correct
44 Correct 224 ms 7160 KB Output is correct
45 Correct 41 ms 1660 KB Output is correct
46 Correct 224 ms 7036 KB Output is correct
47 Correct 64 ms 2324 KB Output is correct
48 Correct 209 ms 7160 KB Output is correct
49 Correct 397 ms 21724 KB Output is correct
50 Correct 445 ms 22876 KB Output is correct
51 Correct 299 ms 19804 KB Output is correct
52 Correct 439 ms 22944 KB Output is correct
53 Correct 170 ms 11108 KB Output is correct
54 Correct 441 ms 22876 KB Output is correct
55 Correct 378 ms 21468 KB Output is correct
56 Correct 443 ms 22876 KB Output is correct
57 Correct 52 ms 3564 KB Output is correct
58 Correct 449 ms 22748 KB Output is correct
59 Correct 235 ms 12776 KB Output is correct
60 Correct 468 ms 22916 KB Output is correct
61 Correct 324 ms 22748 KB Output is correct
62 Correct 306 ms 22748 KB Output is correct
63 Correct 302 ms 22620 KB Output is correct
64 Correct 255 ms 22744 KB Output is correct
65 Correct 331 ms 22620 KB Output is correct
66 Correct 280 ms 22876 KB Output is correct
67 Correct 314 ms 22748 KB Output is correct
68 Correct 310 ms 22748 KB Output is correct
69 Correct 294 ms 22624 KB Output is correct
70 Correct 307 ms 22620 KB Output is correct
71 Correct 316 ms 22748 KB Output is correct
72 Correct 260 ms 22752 KB Output is correct
73 Correct 729 ms 28084 KB Output is correct
74 Correct 492 ms 23516 KB Output is correct
75 Correct 692 ms 28252 KB Output is correct
76 Correct 884 ms 31324 KB Output is correct
77 Correct 434 ms 17252 KB Output is correct
78 Correct 732 ms 28512 KB Output is correct
79 Correct 790 ms 29916 KB Output is correct
80 Correct 921 ms 31324 KB Output is correct
81 Correct 351 ms 11376 KB Output is correct
82 Correct 648 ms 26972 KB Output is correct
83 Correct 649 ms 21220 KB Output is correct
84 Correct 858 ms 31452 KB Output is correct
85 Correct 562 ms 26848 KB Output is correct
86 Correct 722 ms 30044 KB Output is correct
87 Correct 370 ms 23644 KB Output is correct
88 Correct 657 ms 30048 KB Output is correct
89 Correct 653 ms 28004 KB Output is correct
90 Correct 730 ms 30172 KB Output is correct
91 Correct 459 ms 25180 KB Output is correct
92 Correct 726 ms 30120 KB Output is correct
93 Correct 371 ms 23904 KB Output is correct
94 Correct 755 ms 30044 KB Output is correct
95 Correct 422 ms 24540 KB Output is correct
96 Correct 672 ms 30180 KB Output is correct