oj.uz

Submission #337344

# Submission time Handle Problem Language Result Execution time Memory
337344 2020-12-19T23:35:26 Z alishahali1382 Two Antennas (JOI19_antennas) C++14
100 / 100
 673 ms 51168 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=200010, LOG=20;

int n, m, k, u, v, x, y, t, a, b;
int H[MAXN], A[MAXN], B[MAXN], L[MAXN], ans[MAXN];
int lazymn[MAXN<<2], lazymx[MAXN<<2];
int seg[MAXN<<2], Mn[MAXN<<2], Mx[MAXN<<2];
bool alive[MAXN];
vector<int> V1[MAXN], V2[MAXN], Q[MAXN];

inline void add_lazy(int id, int mn, int mx){
	seg[id]=max(seg[id], mx-Mn[id]);
	seg[id]=max(seg[id], Mx[id]-mn);
	lazymn[id]=min(lazymn[id], mn);
	lazymx[id]=max(lazymx[id], mx);
}
inline void shift(int id){
	if (lazymn[id]>lazymx[id]) return ;
	add_lazy(id<<1, lazymn[id], lazymx[id]);
	add_lazy(id<<1 | 1, lazymn[id], lazymx[id]);
	lazymn[id]=inf, lazymx[id]=-inf;
}
void Set(int id, int tl, int tr, int pos){
	if (pos<tl || tr<=pos) return ;
	if (tr-tl==1){
		if (alive[pos]) Mn[id]=Mx[id]=H[pos];
		else Mn[id]=inf, Mx[id]=-inf;
		return ;
	}
	shift(id);
	int mid=(tl+tr)>>1;
	Set(id<<1, tl, mid, pos);
	Set(id<<1 | 1, mid, tr, pos);
	Mn[id]=min(Mn[id<<1], Mn[id<<1 | 1]);
	Mx[id]=max(Mx[id<<1], Mx[id<<1 | 1]);
	seg[id]=max(seg[id<<1], seg[id<<1 | 1]);
}
void Update(int id, int tl, int tr, int l, int r, int val){
	if (r<=tl || tr<=l) return ;
	if (l<=tl && tr<=r){
		add_lazy(id, val, val);
//		debug2(id, val)
//		debug(seg[id])
		return ;
	}
	shift(id);
	int mid=(tl+tr)>>1;
	Update(id<<1, tl, mid, l, r, val);
	Update(id<<1 | 1, mid, tr, l, r, val);
	Mn[id]=min(Mn[id<<1], Mn[id<<1 | 1]);
	Mx[id]=max(Mx[id<<1], Mx[id<<1 | 1]);
	seg[id]=max(seg[id<<1], seg[id<<1 | 1]);
}
int Get(int id, int tl, int tr, int l, int r){
	if (r<=tl || tr<=l) return -1;
	if (l<=tl && tr<=r) return seg[id];
	shift(id);
	int mid=(tl+tr)>>1;
	return max(Get(id<<1, tl, mid, l, r), Get(id<<1 | 1, mid, tr, l, r));
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++){
		cin>>H[i]>>A[i]>>B[i];
		V1[min(n+1, i+A[i])].pb(i);
		V2[min(n, i+B[i])+1].pb(i);
	}
	cin>>m;
	for (int i=1; i<=m; i++){
		cin>>L[i]>>x;
		Q[x].pb(i);
	}
	memset(lazymn, 63, sizeof(lazymn));
	memset(lazymx, -63, sizeof(lazymx));
	memset(Mn, 63, sizeof(Mn));
	memset(Mx, -63, sizeof(Mx));
	memset(seg, -1, sizeof(seg));
//	debugv(V1[2])
//	debugv(V2[2])
	for (int r=1; r<=n; r++){
		for (int i:V1[r]) alive[i]=1, Set(1, 1, n+1, i);
		for (int i:V2[r]) alive[i]=0, Set(1, 1, n+1, i);
		Update(1, 1, n+1, r-B[r], r-A[r]+1, H[r]);
		for (int i:Q[r]) ans[i]=Get(1, 1, n+1, L[i], r+1);
	}
	for (int i=1; i<=m; i++) cout<<ans[i]<<"\n";
	
	return 0;
}
/*
5
10 2 4
1 1 1
2 1 3
1 1 1
100 1 1
5
1 2
2 3
1 3
1 4
1 5

2
10 2 4
1 1 1
1
1 2


*/

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30060 KB Output is correct
2 Correct 19 ms 30188 KB Output is correct
3 Correct 19 ms 30112 KB Output is correct
4 Correct 20 ms 30140 KB Output is correct
5 Correct 19 ms 30188 KB Output is correct
6 Correct 19 ms 30188 KB Output is correct
7 Correct 20 ms 30188 KB Output is correct
8 Correct 19 ms 30188 KB Output is correct
9 Correct 19 ms 30188 KB Output is correct
10 Correct 19 ms 30188 KB Output is correct
11 Correct 19 ms 30060 KB Output is correct
12 Correct 19 ms 30188 KB Output is correct
13 Correct 20 ms 30188 KB Output is correct
14 Correct 20 ms 30188 KB Output is correct
15 Correct 19 ms 30188 KB Output is correct
16 Correct 19 ms 30188 KB Output is correct
17 Correct 19 ms 30188 KB Output is correct
18 Correct 22 ms 30188 KB Output is correct
19 Correct 19 ms 30188 KB Output is correct
20 Correct 22 ms 30188 KB Output is correct
21 Correct 19 ms 30188 KB Output is correct
22 Correct 19 ms 30188 KB Output is correct
23 Correct 19 ms 30188 KB Output is correct
24 Correct 19 ms 30080 KB Output is correct
25 Correct 89 ms 34668 KB Output is correct
26 Correct 29 ms 30700 KB Output is correct
27 Correct 122 ms 36588 KB Output is correct
28 Correct 125 ms 36716 KB Output is correct
29 Correct 88 ms 34668 KB Output is correct
30 Correct 92 ms 34540 KB Output is correct
31 Correct 108 ms 35820 KB Output is correct
32 Correct 124 ms 36588 KB Output is correct
33 Correct 113 ms 36204 KB Output is correct
34 Correct 75 ms 33260 KB Output is correct
35 Correct 125 ms 36528 KB Output is correct
36 Correct 127 ms 36700 KB Output is correct
37 Correct 76 ms 33388 KB Output is correct
38 Correct 136 ms 35640 KB Output is correct
39 Correct 34 ms 30956 KB Output is correct
40 Correct 123 ms 35692 KB Output is correct
41 Correct 92 ms 34156 KB Output is correct
42 Correct 123 ms 35564 KB Output is correct
43 Correct 54 ms 31980 KB Output is correct
44 Correct 119 ms 35692 KB Output is correct
45 Correct 38 ms 31212 KB Output is correct
46 Correct 128 ms 35692 KB Output is correct
47 Correct 45 ms 31596 KB Output is correct
48 Correct 120 ms 35692 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 40800 KB Output is correct
2 Correct 384 ms 41988 KB Output is correct
3 Correct 248 ms 38296 KB Output is correct
4 Correct 383 ms 41992 KB Output is correct
5 Correct 155 ms 35556 KB Output is correct
6 Correct 385 ms 41952 KB Output is correct
7 Correct 329 ms 40160 KB Output is correct
8 Correct 380 ms 41952 KB Output is correct
9 Correct 56 ms 31980 KB Output is correct
10 Correct 396 ms 41980 KB Output is correct
11 Correct 232 ms 37348 KB Output is correct
12 Correct 389 ms 41952 KB Output is correct
13 Correct 233 ms 39256 KB Output is correct
14 Correct 216 ms 39240 KB Output is correct
15 Correct 213 ms 39268 KB Output is correct
16 Correct 199 ms 39564 KB Output is correct
17 Correct 233 ms 39252 KB Output is correct
18 Correct 215 ms 39648 KB Output is correct
19 Correct 224 ms 39264 KB Output is correct
20 Correct 212 ms 39076 KB Output is correct
21 Correct 202 ms 39364 KB Output is correct
22 Correct 215 ms 39344 KB Output is correct
23 Correct 236 ms 39280 KB Output is correct
24 Correct 201 ms 39320 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30060 KB Output is correct
2 Correct 19 ms 30188 KB Output is correct
3 Correct 19 ms 30112 KB Output is correct
4 Correct 20 ms 30140 KB Output is correct
5 Correct 19 ms 30188 KB Output is correct
6 Correct 19 ms 30188 KB Output is correct
7 Correct 20 ms 30188 KB Output is correct
8 Correct 19 ms 30188 KB Output is correct
9 Correct 19 ms 30188 KB Output is correct
10 Correct 19 ms 30188 KB Output is correct
11 Correct 19 ms 30060 KB Output is correct
12 Correct 19 ms 30188 KB Output is correct
13 Correct 20 ms 30188 KB Output is correct
14 Correct 20 ms 30188 KB Output is correct
15 Correct 19 ms 30188 KB Output is correct
16 Correct 19 ms 30188 KB Output is correct
17 Correct 19 ms 30188 KB Output is correct
18 Correct 22 ms 30188 KB Output is correct
19 Correct 19 ms 30188 KB Output is correct
20 Correct 22 ms 30188 KB Output is correct
21 Correct 19 ms 30188 KB Output is correct
22 Correct 19 ms 30188 KB Output is correct
23 Correct 19 ms 30188 KB Output is correct
24 Correct 19 ms 30080 KB Output is correct
25 Correct 89 ms 34668 KB Output is correct
26 Correct 29 ms 30700 KB Output is correct
27 Correct 122 ms 36588 KB Output is correct
28 Correct 125 ms 36716 KB Output is correct
29 Correct 88 ms 34668 KB Output is correct
30 Correct 92 ms 34540 KB Output is correct
31 Correct 108 ms 35820 KB Output is correct
32 Correct 124 ms 36588 KB Output is correct
33 Correct 113 ms 36204 KB Output is correct
34 Correct 75 ms 33260 KB Output is correct
35 Correct 125 ms 36528 KB Output is correct
36 Correct 127 ms 36700 KB Output is correct
37 Correct 76 ms 33388 KB Output is correct
38 Correct 136 ms 35640 KB Output is correct
39 Correct 34 ms 30956 KB Output is correct
40 Correct 123 ms 35692 KB Output is correct
41 Correct 92 ms 34156 KB Output is correct
42 Correct 123 ms 35564 KB Output is correct
43 Correct 54 ms 31980 KB Output is correct
44 Correct 119 ms 35692 KB Output is correct
45 Correct 38 ms 31212 KB Output is correct
46 Correct 128 ms 35692 KB Output is correct
47 Correct 45 ms 31596 KB Output is correct
48 Correct 120 ms 35692 KB Output is correct
49 Correct 346 ms 40800 KB Output is correct
50 Correct 384 ms 41988 KB Output is correct
51 Correct 248 ms 38296 KB Output is correct
52 Correct 383 ms 41992 KB Output is correct
53 Correct 155 ms 35556 KB Output is correct
54 Correct 385 ms 41952 KB Output is correct
55 Correct 329 ms 40160 KB Output is correct
56 Correct 380 ms 41952 KB Output is correct
57 Correct 56 ms 31980 KB Output is correct
58 Correct 396 ms 41980 KB Output is correct
59 Correct 232 ms 37348 KB Output is correct
60 Correct 389 ms 41952 KB Output is correct
61 Correct 233 ms 39256 KB Output is correct
62 Correct 216 ms 39240 KB Output is correct
63 Correct 213 ms 39268 KB Output is correct
64 Correct 199 ms 39564 KB Output is correct
65 Correct 233 ms 39252 KB Output is correct
66 Correct 215 ms 39648 KB Output is correct
67 Correct 224 ms 39264 KB Output is correct
68 Correct 212 ms 39076 KB Output is correct
69 Correct 202 ms 39364 KB Output is correct
70 Correct 215 ms 39344 KB Output is correct
71 Correct 236 ms 39280 KB Output is correct
72 Correct 201 ms 39320 KB Output is correct
73 Correct 555 ms 47840 KB Output is correct
74 Correct 409 ms 42592 KB Output is correct
75 Correct 510 ms 47148 KB Output is correct
76 Correct 671 ms 50988 KB Output is correct
77 Correct 322 ms 41572 KB Output is correct
78 Correct 579 ms 48528 KB Output is correct
79 Correct 609 ms 49376 KB Output is correct
80 Correct 673 ms 51168 KB Output is correct
81 Correct 217 ms 39148 KB Output is correct
82 Correct 553 ms 46816 KB Output is correct
83 Correct 470 ms 46032 KB Output is correct
84 Correct 669 ms 51044 KB Output is correct
85 Correct 378 ms 44088 KB Output is correct
86 Correct 478 ms 47208 KB Output is correct
87 Correct 248 ms 40420 KB Output is correct
88 Correct 450 ms 47864 KB Output is correct
89 Correct 414 ms 45396 KB Output is correct
90 Correct 474 ms 47712 KB Output is correct
91 Correct 305 ms 41952 KB Output is correct
92 Correct 464 ms 47068 KB Output is correct
93 Correct 246 ms 40520 KB Output is correct
94 Correct 456 ms 47332 KB Output is correct
95 Correct 284 ms 41572 KB Output is correct
96 Correct 438 ms 47376 KB Output is correct