oj.uz

Submission #259098

# Submission time Handle Problem Language Result Execution time Memory
259098 2020-08-07T07:54:11 Z patrikpavic2 Two Antennas (JOI19_antennas) C++17
100 / 100
 782 ms 41080 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef pair < int, int > pii;

const int OFF = (1 << 18);
const int N = 2e5 + 500;

pii T[2 * OFF], P[2 * OFF], NULA = {-1, -1};
int sol[2 * OFF], uklj[2 * OFF], L[N], R[N], A[N], B[N], H[N], ans[N], n, q;
vector < int > Q[N], prom[N];

inline pii spoji_par(pii A, pii B){
	if(A == NULA) return B;
	if(B == NULA) return A;
	return {min(A.X, B.X), max(A.Y, B.Y)};
}

void refresh(int x){
	if(P[x] == NULA) return;
	if(T[x] != NULA){
		sol[x] = max(sol[x], max(T[x].Y - P[x].X, P[x].Y - T[x].X));
		if(x < OFF){
			P[2 * x] = spoji_par(P[2 * x], P[x]);
			P[2 * x + 1] = spoji_par(P[2 * x + 1], P[x]);
		}
	}
	P[x] = NULA;
}

inline void spoji_u(int i){
	T[i] = spoji_par(T[2 * i], T[2 * i + 1]);
	sol[i] = max(sol[2 * i], sol[2 * i + 1]);
}

void promijeni(int i,int a,int b,int tko){
	refresh(i);
	if(a == b){
		uklj[tko] = !uklj[tko];
		if(uklj[tko])
			T[i] = {H[tko], H[tko]};
		else
			T[i] = NULA; 
		return;
	}	
	if(tko <= (a + b) / 2)
		promijeni(2 * i, a, (a + b) / 2, tko);
	else
		promijeni(2 * i + 1, (a + b) / 2 + 1, b, tko);
	refresh(2 * i); refresh(2 * i + 1);
	spoji_u(i);
}

void dodaj(int i, int a, int b, int lo, int hi, int nov){
	refresh(i);
	if(lo <= a && b <= hi){
		P[i] = spoji_par(P[i], {nov, nov});
		refresh(i); return;
	}
	if(a > hi || b < lo) return;
	dodaj(2 * i, a, (a + b) / 2, lo, hi, nov);
	dodaj(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, nov);
	spoji_u(i);
}

int query(int i,int a,int b,int lo,int hi){
	refresh(i);
	if(lo <= a && b <= hi) return sol[i];
	if(a > hi || b < lo) return -1;
	return max(query(2 * i, a, (a + b) / 2, lo, hi), query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi));
}


int main(){
	for(int i = 0;i < 2 * OFF;i++)
		T[i] = NULA, P[i] = NULA, sol[i] = -1;
	scanf("%d", &n);
	for(int i = 1;i <= n;i++){
		scanf("%d%d%d", H + i, A + i, B + i);
		if(i + A[i] <= n){
			prom[i + A[i]].PB(i);
			if(i + B[i] + 1 <= n)
				prom[i + B[i] + 1].PB(i);
		}
	}
	scanf("%d", &q);
	for(int i = 1;i <= q;i++){
		scanf("%d%d", L + i, R + i);
		Q[R[i]].PB(i);
	}
	for(int i = 1;i <= n;i++){
		for(int x : prom[i])
			promijeni(1, 0, OFF - 1, x);
		dodaj(1, 0, OFF - 1, max(i - B[i], 1), max(i - A[i], 0), H[i]);
		for(int c : Q[i])
			ans[c] = query(1, 0, OFF - 1, L[c], R[c]);
	}
	for(int i = 1;i <= q;i++)
		printf("%d\n", ans[i]);
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:85:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
antennas.cpp:87: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:94:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
antennas.cpp:96: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

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19968 KB Output is correct
2 Correct 13 ms 20096 KB Output is correct
3 Correct 13 ms 20132 KB Output is correct
4 Correct 15 ms 20096 KB Output is correct
5 Correct 13 ms 20096 KB Output is correct
6 Correct 15 ms 20096 KB Output is correct
7 Correct 14 ms 20096 KB Output is correct
8 Correct 15 ms 20088 KB Output is correct
9 Correct 12 ms 19968 KB Output is correct
10 Correct 13 ms 20096 KB Output is correct
11 Correct 14 ms 20000 KB Output is correct
12 Correct 13 ms 20096 KB Output is correct
13 Correct 16 ms 20096 KB Output is correct
14 Correct 12 ms 20096 KB Output is correct
15 Correct 12 ms 20096 KB Output is correct
16 Correct 12 ms 20096 KB Output is correct
17 Correct 12 ms 19968 KB Output is correct
18 Correct 15 ms 20088 KB Output is correct
19 Correct 15 ms 20096 KB Output is correct
20 Correct 12 ms 20096 KB Output is correct
21 Correct 14 ms 20096 KB Output is correct
22 Correct 15 ms 20096 KB Output is correct
23 Correct 12 ms 20096 KB Output is correct
24 Correct 14 ms 20096 KB Output is correct
25 Correct 116 ms 25008 KB Output is correct
26 Correct 28 ms 20728 KB Output is correct
27 Correct 174 ms 27128 KB Output is correct
28 Correct 174 ms 27260 KB Output is correct
29 Correct 128 ms 25080 KB Output is correct
30 Correct 120 ms 24824 KB Output is correct
31 Correct 147 ms 26488 KB Output is correct
32 Correct 158 ms 27256 KB Output is correct
33 Correct 147 ms 26744 KB Output is correct
34 Correct 93 ms 23544 KB Output is correct
35 Correct 167 ms 27128 KB Output is correct
36 Correct 159 ms 27256 KB Output is correct
37 Correct 93 ms 23672 KB Output is correct
38 Correct 152 ms 26232 KB Output is correct
39 Correct 33 ms 20984 KB Output is correct
40 Correct 153 ms 26232 KB Output is correct
41 Correct 117 ms 24568 KB Output is correct
42 Correct 159 ms 26232 KB Output is correct
43 Correct 64 ms 22136 KB Output is correct
44 Correct 161 ms 26324 KB Output is correct
45 Correct 38 ms 21240 KB Output is correct
46 Correct 170 ms 26232 KB Output is correct
47 Correct 50 ms 21624 KB Output is correct
48 Correct 167 ms 26328 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 29560 KB Output is correct
2 Correct 407 ms 30716 KB Output is correct
3 Correct 285 ms 27512 KB Output is correct
4 Correct 434 ms 30584 KB Output is correct
5 Correct 185 ms 24824 KB Output is correct
6 Correct 421 ms 30588 KB Output is correct
7 Correct 347 ms 29176 KB Output is correct
8 Correct 405 ms 30584 KB Output is correct
9 Correct 60 ms 21624 KB Output is correct
10 Correct 401 ms 30576 KB Output is correct
11 Correct 248 ms 26616 KB Output is correct
12 Correct 408 ms 30588 KB Output is correct
13 Correct 238 ms 28276 KB Output is correct
14 Correct 222 ms 28184 KB Output is correct
15 Correct 216 ms 28280 KB Output is correct
16 Correct 254 ms 28792 KB Output is correct
17 Correct 241 ms 28404 KB Output is correct
18 Correct 242 ms 28792 KB Output is correct
19 Correct 230 ms 28144 KB Output is correct
20 Correct 222 ms 28276 KB Output is correct
21 Correct 213 ms 28080 KB Output is correct
22 Correct 220 ms 28436 KB Output is correct
23 Correct 225 ms 28144 KB Output is correct
24 Correct 230 ms 28284 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19968 KB Output is correct
2 Correct 13 ms 20096 KB Output is correct
3 Correct 13 ms 20132 KB Output is correct
4 Correct 15 ms 20096 KB Output is correct
5 Correct 13 ms 20096 KB Output is correct
6 Correct 15 ms 20096 KB Output is correct
7 Correct 14 ms 20096 KB Output is correct
8 Correct 15 ms 20088 KB Output is correct
9 Correct 12 ms 19968 KB Output is correct
10 Correct 13 ms 20096 KB Output is correct
11 Correct 14 ms 20000 KB Output is correct
12 Correct 13 ms 20096 KB Output is correct
13 Correct 16 ms 20096 KB Output is correct
14 Correct 12 ms 20096 KB Output is correct
15 Correct 12 ms 20096 KB Output is correct
16 Correct 12 ms 20096 KB Output is correct
17 Correct 12 ms 19968 KB Output is correct
18 Correct 15 ms 20088 KB Output is correct
19 Correct 15 ms 20096 KB Output is correct
20 Correct 12 ms 20096 KB Output is correct
21 Correct 14 ms 20096 KB Output is correct
22 Correct 15 ms 20096 KB Output is correct
23 Correct 12 ms 20096 KB Output is correct
24 Correct 14 ms 20096 KB Output is correct
25 Correct 116 ms 25008 KB Output is correct
26 Correct 28 ms 20728 KB Output is correct
27 Correct 174 ms 27128 KB Output is correct
28 Correct 174 ms 27260 KB Output is correct
29 Correct 128 ms 25080 KB Output is correct
30 Correct 120 ms 24824 KB Output is correct
31 Correct 147 ms 26488 KB Output is correct
32 Correct 158 ms 27256 KB Output is correct
33 Correct 147 ms 26744 KB Output is correct
34 Correct 93 ms 23544 KB Output is correct
35 Correct 167 ms 27128 KB Output is correct
36 Correct 159 ms 27256 KB Output is correct
37 Correct 93 ms 23672 KB Output is correct
38 Correct 152 ms 26232 KB Output is correct
39 Correct 33 ms 20984 KB Output is correct
40 Correct 153 ms 26232 KB Output is correct
41 Correct 117 ms 24568 KB Output is correct
42 Correct 159 ms 26232 KB Output is correct
43 Correct 64 ms 22136 KB Output is correct
44 Correct 161 ms 26324 KB Output is correct
45 Correct 38 ms 21240 KB Output is correct
46 Correct 170 ms 26232 KB Output is correct
47 Correct 50 ms 21624 KB Output is correct
48 Correct 167 ms 26328 KB Output is correct
49 Correct 347 ms 29560 KB Output is correct
50 Correct 407 ms 30716 KB Output is correct
51 Correct 285 ms 27512 KB Output is correct
52 Correct 434 ms 30584 KB Output is correct
53 Correct 185 ms 24824 KB Output is correct
54 Correct 421 ms 30588 KB Output is correct
55 Correct 347 ms 29176 KB Output is correct
56 Correct 405 ms 30584 KB Output is correct
57 Correct 60 ms 21624 KB Output is correct
58 Correct 401 ms 30576 KB Output is correct
59 Correct 248 ms 26616 KB Output is correct
60 Correct 408 ms 30588 KB Output is correct
61 Correct 238 ms 28276 KB Output is correct
62 Correct 222 ms 28184 KB Output is correct
63 Correct 216 ms 28280 KB Output is correct
64 Correct 254 ms 28792 KB Output is correct
65 Correct 241 ms 28404 KB Output is correct
66 Correct 242 ms 28792 KB Output is correct
67 Correct 230 ms 28144 KB Output is correct
68 Correct 222 ms 28276 KB Output is correct
69 Correct 213 ms 28080 KB Output is correct
70 Correct 220 ms 28436 KB Output is correct
71 Correct 225 ms 28144 KB Output is correct
72 Correct 230 ms 28284 KB Output is correct
73 Correct 590 ms 37420 KB Output is correct
74 Correct 591 ms 31608 KB Output is correct
75 Correct 578 ms 36984 KB Output is correct
76 Correct 782 ms 40816 KB Output is correct
77 Correct 364 ms 31608 KB Output is correct
78 Correct 597 ms 37752 KB Output is correct
79 Correct 707 ms 39288 KB Output is correct
80 Correct 713 ms 41080 KB Output is correct
81 Correct 270 ms 29688 KB Output is correct
82 Correct 552 ms 35960 KB Output is correct
83 Correct 511 ms 36088 KB Output is correct
84 Correct 720 ms 40824 KB Output is correct
85 Correct 393 ms 33944 KB Output is correct
86 Correct 511 ms 37144 KB Output is correct
87 Correct 269 ms 30072 KB Output is correct
88 Correct 481 ms 37752 KB Output is correct
89 Correct 428 ms 35444 KB Output is correct
90 Correct 488 ms 37768 KB Output is correct
91 Correct 305 ms 31852 KB Output is correct
92 Correct 465 ms 37320 KB Output is correct
93 Correct 254 ms 29780 KB Output is correct
94 Correct 479 ms 37452 KB Output is correct
95 Correct 282 ms 30964 KB Output is correct
96 Correct 480 ms 37496 KB Output is correct