oj.uz

답안 #829528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829528 2023-08-18T12:02:59 Z MohamedAhmed04 Two Antennas (JOI19_antennas) C++14
100 / 100
 638 ms 46856 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 2e5 + 10 ;

int arr[MAX] , a[MAX] , b[MAX] ;
int n , q ;

int L[MAX] , R[MAX] ;

vector<int>ins[MAX] , del[MAX] ;
vector< pair<int , int> >queries[MAX] ;

int tree[4 * MAX] , lazy[4 * MAX] , val[4 * MAX] ;

void build(int node , int l , int r)
{
	tree[node] = val[node] = -1e9 - 10 , lazy[node] = 0 ;
	if(l == r)
		return ;
	int mid = (l + r) >> 1 ;
	build(node << 1 , l , mid) ;
	build(node << 1 | 1 , mid+1 , r) ;
}

void prop(int node , int l , int r)
{
	val[node] = max(val[node] , tree[node] + lazy[node]) ;
	if(l != r)
	{
		lazy[node << 1] = max(lazy[node << 1] , lazy[node]) ;
		lazy[node << 1 | 1] = max(lazy[node << 1 | 1] , lazy[node]) ;
	}
	lazy[node] = 0 ;
}

void update(int node , int l , int r , int idx , int x)
{
	prop(node , l , r) ;
	if(idx > r || idx < l)
		return ;
	if(l == r)
	{
		tree[node] = x ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	update(node << 1 , l , mid , idx , x) ;
	update(node << 1 | 1 , mid+1 , r , idx , x) ;
	tree[node] = max(tree[node << 1] , tree[node << 1 | 1]) ;
}

void update2(int node , int l , int r , int from , int to , int x)
{
	prop(node , l , r) ;
	if(from > r || to < l || from > to)
		return ;
	if(l >= from && r <= to)
	{
		lazy[node] = x ;
		prop(node , l , r) ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	update2(node << 1 , l , mid , from , to , x) ;
	update2(node << 1 | 1 , mid+1 , r , from , to , x) ;
	val[node] = max({val[node] , val[node << 1] , val[node << 1 | 1]}) ;
}

int query(int node , int l , int r , int from , int to)
{
	prop(node , l , r) ;
	if(from > r || to < l || from > to)
		return (-1e9 - 10) ;
	if(l >= from && r <= to)
		return val[node] ;
	int mid = (l + r) >> 1 ;
	int x = query(node << 1 , l , mid , from , to) ;
	int y = query(node << 1 | 1 , mid+1 , r , from , to) ;
	return max(x , y) ;
}

int ans[MAX] ;

void solve()
{
	build(1 , 1 , n) ;
	for(int i = 0 ; i <= n+1 ; ++i)
		ins[i].clear() , del[i].clear() , queries[i].clear() ;
	for(int i = 1 ; i <= n ; ++i)
	{
		int idx = min(n+1 , i + a[i]) ;
		ins[idx].push_back(i) ;
		idx = min(n+1 , i + b[i] + 1) ;
		del[idx].push_back(i) ;
	}
	for(int i = 1 ; i <= q ; ++i)
		queries[R[i]].emplace_back(L[i] , i) ;
	for(int i = 1 ; i <= n ; ++i)
	{
		for(auto &idx : del[i])
			update(1 , 1 , n , idx , -1e9 - 10) ;
		for(auto &idx : ins[i])
			update(1 , 1 , n , idx , -1 * arr[idx]) ;
		int l = max(1 , i-b[i]) , r = i-a[i] ;
		update2(1 , 1 , n , l , r , arr[i]) ;
		for(auto &p : queries[i])
			ans[p.second] = max(ans[p.second] , query(1 , 1 , n , p.first , i)) ;
	}
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>arr[i]>>a[i]>>b[i] ;
	cin>>q ;
	for(int i = 1 ; i <= q ; ++i)
	{
		cin>>L[i]>>R[i] ;
		ans[i] = -1 ;
	}
	solve() ;
	for(int i = 1 ; n-i+1 > i ; ++i)
		swap(arr[i] , arr[n-i+1]) , swap(a[i] , a[n-i+1]) , swap(b[i] , b[n-i+1]) ;
	for(int i = 1 ; i <= q ; ++i)
	{
		int l = n-R[i]+1 , r = n-L[i]+1 ;
		L[i] = l , R[i] = r ;
	}
	solve() ;
	for(int i = 1 ; i <= q ; ++i)
		cout<<ans[i]<<"\n" ;
	return 0 ;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14380 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 6 ms 14500 KB Output is correct
4 Correct 6 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14368 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14448 KB Output is correct
22 Correct 7 ms 14448 KB Output is correct
23 Correct 7 ms 14448 KB Output is correct
24 Correct 9 ms 14484 KB Output is correct
25 Correct 105 ms 19908 KB Output is correct
26 Correct 19 ms 15188 KB Output is correct
27 Correct 167 ms 22716 KB Output is correct
28 Correct 142 ms 23588 KB Output is correct
29 Correct 97 ms 21304 KB Output is correct
30 Correct 109 ms 20780 KB Output is correct
31 Correct 105 ms 22768 KB Output is correct
32 Correct 143 ms 23628 KB Output is correct
33 Correct 131 ms 23420 KB Output is correct
34 Correct 104 ms 18868 KB Output is correct
35 Correct 137 ms 23996 KB Output is correct
36 Correct 142 ms 23620 KB Output is correct
37 Correct 94 ms 19288 KB Output is correct
38 Correct 140 ms 22636 KB Output is correct
39 Correct 27 ms 15708 KB Output is correct
40 Correct 169 ms 22752 KB Output is correct
41 Correct 105 ms 20724 KB Output is correct
42 Correct 150 ms 22600 KB Output is correct
43 Correct 53 ms 17380 KB Output is correct
44 Correct 152 ms 22676 KB Output is correct
45 Correct 31 ms 16036 KB Output is correct
46 Correct 140 ms 22580 KB Output is correct
47 Correct 46 ms 16588 KB Output is correct
48 Correct 138 ms 22600 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 298 ms 28624 KB Output is correct
2 Correct 314 ms 29512 KB Output is correct
3 Correct 204 ms 26860 KB Output is correct
4 Correct 316 ms 29504 KB Output is correct
5 Correct 123 ms 21624 KB Output is correct
6 Correct 345 ms 29488 KB Output is correct
7 Correct 323 ms 28224 KB Output is correct
8 Correct 267 ms 29500 KB Output is correct
9 Correct 38 ms 16596 KB Output is correct
10 Correct 281 ms 29520 KB Output is correct
11 Correct 194 ms 23064 KB Output is correct
12 Correct 331 ms 29516 KB Output is correct
13 Correct 217 ms 27184 KB Output is correct
14 Correct 217 ms 31400 KB Output is correct
15 Correct 246 ms 30532 KB Output is correct
16 Correct 217 ms 31084 KB Output is correct
17 Correct 248 ms 32088 KB Output is correct
18 Correct 223 ms 31036 KB Output is correct
19 Correct 214 ms 30916 KB Output is correct
20 Correct 217 ms 31224 KB Output is correct
21 Correct 192 ms 31644 KB Output is correct
22 Correct 210 ms 31320 KB Output is correct
23 Correct 207 ms 31356 KB Output is correct
24 Correct 229 ms 30828 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14380 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 6 ms 14500 KB Output is correct
4 Correct 6 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 6 ms 14420 KB Output is correct
7 Correct 7 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 7 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14368 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14448 KB Output is correct
22 Correct 7 ms 14448 KB Output is correct
23 Correct 7 ms 14448 KB Output is correct
24 Correct 9 ms 14484 KB Output is correct
25 Correct 105 ms 19908 KB Output is correct
26 Correct 19 ms 15188 KB Output is correct
27 Correct 167 ms 22716 KB Output is correct
28 Correct 142 ms 23588 KB Output is correct
29 Correct 97 ms 21304 KB Output is correct
30 Correct 109 ms 20780 KB Output is correct
31 Correct 105 ms 22768 KB Output is correct
32 Correct 143 ms 23628 KB Output is correct
33 Correct 131 ms 23420 KB Output is correct
34 Correct 104 ms 18868 KB Output is correct
35 Correct 137 ms 23996 KB Output is correct
36 Correct 142 ms 23620 KB Output is correct
37 Correct 94 ms 19288 KB Output is correct
38 Correct 140 ms 22636 KB Output is correct
39 Correct 27 ms 15708 KB Output is correct
40 Correct 169 ms 22752 KB Output is correct
41 Correct 105 ms 20724 KB Output is correct
42 Correct 150 ms 22600 KB Output is correct
43 Correct 53 ms 17380 KB Output is correct
44 Correct 152 ms 22676 KB Output is correct
45 Correct 31 ms 16036 KB Output is correct
46 Correct 140 ms 22580 KB Output is correct
47 Correct 46 ms 16588 KB Output is correct
48 Correct 138 ms 22600 KB Output is correct
49 Correct 298 ms 28624 KB Output is correct
50 Correct 314 ms 29512 KB Output is correct
51 Correct 204 ms 26860 KB Output is correct
52 Correct 316 ms 29504 KB Output is correct
53 Correct 123 ms 21624 KB Output is correct
54 Correct 345 ms 29488 KB Output is correct
55 Correct 323 ms 28224 KB Output is correct
56 Correct 267 ms 29500 KB Output is correct
57 Correct 38 ms 16596 KB Output is correct
58 Correct 281 ms 29520 KB Output is correct
59 Correct 194 ms 23064 KB Output is correct
60 Correct 331 ms 29516 KB Output is correct
61 Correct 217 ms 27184 KB Output is correct
62 Correct 217 ms 31400 KB Output is correct
63 Correct 246 ms 30532 KB Output is correct
64 Correct 217 ms 31084 KB Output is correct
65 Correct 248 ms 32088 KB Output is correct
66 Correct 223 ms 31036 KB Output is correct
67 Correct 214 ms 30916 KB Output is correct
68 Correct 217 ms 31224 KB Output is correct
69 Correct 192 ms 31644 KB Output is correct
70 Correct 210 ms 31320 KB Output is correct
71 Correct 207 ms 31356 KB Output is correct
72 Correct 229 ms 30828 KB Output is correct
73 Correct 443 ms 42564 KB Output is correct
74 Correct 381 ms 35384 KB Output is correct
75 Correct 453 ms 42060 KB Output is correct
76 Correct 546 ms 46848 KB Output is correct
77 Correct 337 ms 32164 KB Output is correct
78 Correct 471 ms 43256 KB Output is correct
79 Correct 522 ms 44700 KB Output is correct
80 Correct 638 ms 46856 KB Output is correct
81 Correct 226 ms 27336 KB Output is correct
82 Correct 506 ms 41136 KB Output is correct
83 Correct 513 ms 37672 KB Output is correct
84 Correct 545 ms 46816 KB Output is correct
85 Correct 374 ms 39072 KB Output is correct
86 Correct 544 ms 43064 KB Output is correct
87 Correct 243 ms 32836 KB Output is correct
88 Correct 470 ms 42612 KB Output is correct
89 Correct 469 ms 41084 KB Output is correct
90 Correct 550 ms 42728 KB Output is correct
91 Correct 330 ms 35712 KB Output is correct
92 Correct 498 ms 42908 KB Output is correct
93 Correct 277 ms 34352 KB Output is correct
94 Correct 480 ms 43060 KB Output is correct
95 Correct 296 ms 35172 KB Output is correct
96 Correct 491 ms 42048 KB Output is correct