oj.uz

Submission #708201

# Submission time Handle Problem Language Result Execution time Memory
708201 2023-03-11T09:42:35 Z alvingogo Two Antennas (JOI19_antennas) C++14
100 / 100
 502 ms 71004 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

const int inf=3e10;
struct ST{
	struct no{
		int mx=-inf,mn=inf,tx=-inf,tn=inf;
		int ans=-1;
		int tz=0;
	};
	vector<no> st;
	void init(int x){
		st.resize(4*x);
	}
	void upd(int v,int x){
		st[v].tn=min(st[v].tn,x);
		st[v].tx=max(st[v].tx,x);
		st[v].tz=1;
		st[v].ans=max(st[v].ans,max(st[v].mx-x,x-st[v].mn));
	}
	void pudo(int v){
		if(!st[v].tz){
			return;
		}
		upd(2*v+1,st[v].tx);
		upd(2*v+1,st[v].tn);
		upd(2*v+2,st[v].tx);
		upd(2*v+2,st[v].tn);
		st[v].tn=inf;
		st[v].tx=-inf;
		st[v].tz=0;
	}
	void pull(int v){
		st[v].ans=max(st[2*v+1].ans,st[2*v+2].ans);
		st[v].mx=max(st[2*v+1].mx,st[2*v+2].mx);
		st[v].mn=min(st[2*v+1].mn,st[2*v+2].mn);
	}
	void update(int v,int L,int R,int l,int r,int x){
		if(L==l && r==R){
			upd(v,x);
			return;
		}
		pudo(v);
		int m=(L+R)/2;
		if(r<=m){
			update(2*v+1,L,m,l,r,x);
		}
		else if(l>m){
			update(2*v+2,m+1,R,l,r,x);
		}
		else{
			update(2*v+1,L,m,l,m,x);
			update(2*v+2,m+1,R,m+1,r,x);
		}
		pull(v);
	}
	void update2(int v,int L,int R,int p,int a){
		if(L==R){
			if(a<0){
				st[v].mx=-inf;
				st[v].mn=inf;
			}
			else{
				st[v].mx=a;
				st[v].mn=a;
			}
			return;
		}
		pudo(v);
		int m=(L+R)/2;
		if(p<=m){
			update2(2*v+1,L,m,p,a);
		}
		else{
			update2(2*v+2,m+1,R,p,a);
		}
		pull(v);
	}
	int query(int v,int L,int R,int l,int r){
		if(L==l && r==R){
			return st[v].ans;
		}
		int m=(L+R)/2;
		pudo(v);
		if(r<=m){
			return query(2*v+1,L,m,l,r);
		}
		else if(l>m){
			return query(2*v+2,m+1,R,l,r);
		}
		else{
			return max(query(2*v+1,L,m,l,m),query(2*v+2,m+1,R,m+1,r));
		}
	}
}st;
struct qu{
	int l,r;
	int id;
};
signed main(){
    AquA;
	int n;
	cin >> n;
	vector<int> h(n),a(n),b(n);
	for(int i=0;i<n;i++){
		cin >> h[i] >> a[i] >> b[i];
	}
	int q;
	cin >> q;
	vector<qu> vq(q);
	for(int i=0;i<q;i++){
		cin >> vq[i].l >> vq[i].r;
		vq[i].l--;
		vq[i].r--;
		vq[i].id=i;
	}
	vector<vector<int> > act(n),ina(n);
	sort(vq.begin(),vq.end(),[&](qu a,qu b){return a.r<b.r;});
	vector<int> ans(q);
	int z=0;
	st.init(n);
	for(int i=0;i<n;i++){
		for(auto x:act[i]){
			st.update2(0,0,n-1,x,h[x]);
		}
		if(i-a[i]>=0){
			st.update(0,0,n-1,max(0ll,i-b[i]),i-a[i],h[i]);
		}
		while(z<q && vq[z].r==i){
			ans[vq[z].id]=st.query(0,0,n-1,vq[z].l,i);
			z++;
		}
		if(i+a[i]<n){
			act[i+a[i]].push_back(i);
		}
		if(i+b[i]<n){
			ina[i+b[i]].push_back(i);
		}
		for(auto x:ina[i]){
			st.update2(0,0,n-1,x,-1);
		}
	}
	for(int i=0;i<q;i++){
		cout << ans[i] << "\n";
	}
    return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 404 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 63 ms 7548 KB Output is correct
26 Correct 9 ms 1648 KB Output is correct
27 Correct 93 ms 10500 KB Output is correct
28 Correct 96 ms 10648 KB Output is correct
29 Correct 57 ms 7520 KB Output is correct
30 Correct 62 ms 7296 KB Output is correct
31 Correct 68 ms 9584 KB Output is correct
32 Correct 116 ms 10676 KB Output is correct
33 Correct 77 ms 9864 KB Output is correct
34 Correct 47 ms 5580 KB Output is correct
35 Correct 84 ms 10420 KB Output is correct
36 Correct 90 ms 10692 KB Output is correct
37 Correct 51 ms 5884 KB Output is correct
38 Correct 86 ms 9676 KB Output is correct
39 Correct 13 ms 2040 KB Output is correct
40 Correct 83 ms 9736 KB Output is correct
41 Correct 62 ms 7248 KB Output is correct
42 Correct 87 ms 9696 KB Output is correct
43 Correct 27 ms 3688 KB Output is correct
44 Correct 85 ms 9684 KB Output is correct
45 Correct 15 ms 2280 KB Output is correct
46 Correct 79 ms 9684 KB Output is correct
47 Correct 23 ms 3032 KB Output is correct
48 Correct 85 ms 9668 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 50036 KB Output is correct
2 Correct 314 ms 55604 KB Output is correct
3 Correct 195 ms 42248 KB Output is correct
4 Correct 311 ms 60100 KB Output is correct
5 Correct 123 ms 27756 KB Output is correct
6 Correct 331 ms 60132 KB Output is correct
7 Correct 261 ms 52152 KB Output is correct
8 Correct 340 ms 60156 KB Output is correct
9 Correct 33 ms 9684 KB Output is correct
10 Correct 325 ms 60208 KB Output is correct
11 Correct 164 ms 37848 KB Output is correct
12 Correct 296 ms 60156 KB Output is correct
13 Correct 162 ms 58372 KB Output is correct
14 Correct 147 ms 58472 KB Output is correct
15 Correct 144 ms 58500 KB Output is correct
16 Correct 148 ms 58960 KB Output is correct
17 Correct 149 ms 58552 KB Output is correct
18 Correct 140 ms 59020 KB Output is correct
19 Correct 147 ms 58304 KB Output is correct
20 Correct 162 ms 58712 KB Output is correct
21 Correct 139 ms 58368 KB Output is correct
22 Correct 159 ms 58540 KB Output is correct
23 Correct 144 ms 58372 KB Output is correct
24 Correct 128 ms 58368 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 404 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 63 ms 7548 KB Output is correct
26 Correct 9 ms 1648 KB Output is correct
27 Correct 93 ms 10500 KB Output is correct
28 Correct 96 ms 10648 KB Output is correct
29 Correct 57 ms 7520 KB Output is correct
30 Correct 62 ms 7296 KB Output is correct
31 Correct 68 ms 9584 KB Output is correct
32 Correct 116 ms 10676 KB Output is correct
33 Correct 77 ms 9864 KB Output is correct
34 Correct 47 ms 5580 KB Output is correct
35 Correct 84 ms 10420 KB Output is correct
36 Correct 90 ms 10692 KB Output is correct
37 Correct 51 ms 5884 KB Output is correct
38 Correct 86 ms 9676 KB Output is correct
39 Correct 13 ms 2040 KB Output is correct
40 Correct 83 ms 9736 KB Output is correct
41 Correct 62 ms 7248 KB Output is correct
42 Correct 87 ms 9696 KB Output is correct
43 Correct 27 ms 3688 KB Output is correct
44 Correct 85 ms 9684 KB Output is correct
45 Correct 15 ms 2280 KB Output is correct
46 Correct 79 ms 9684 KB Output is correct
47 Correct 23 ms 3032 KB Output is correct
48 Correct 85 ms 9668 KB Output is correct
49 Correct 277 ms 50036 KB Output is correct
50 Correct 314 ms 55604 KB Output is correct
51 Correct 195 ms 42248 KB Output is correct
52 Correct 311 ms 60100 KB Output is correct
53 Correct 123 ms 27756 KB Output is correct
54 Correct 331 ms 60132 KB Output is correct
55 Correct 261 ms 52152 KB Output is correct
56 Correct 340 ms 60156 KB Output is correct
57 Correct 33 ms 9684 KB Output is correct
58 Correct 325 ms 60208 KB Output is correct
59 Correct 164 ms 37848 KB Output is correct
60 Correct 296 ms 60156 KB Output is correct
61 Correct 162 ms 58372 KB Output is correct
62 Correct 147 ms 58472 KB Output is correct
63 Correct 144 ms 58500 KB Output is correct
64 Correct 148 ms 58960 KB Output is correct
65 Correct 149 ms 58552 KB Output is correct
66 Correct 140 ms 59020 KB Output is correct
67 Correct 147 ms 58304 KB Output is correct
68 Correct 162 ms 58712 KB Output is correct
69 Correct 139 ms 58368 KB Output is correct
70 Correct 159 ms 58540 KB Output is correct
71 Correct 144 ms 58372 KB Output is correct
72 Correct 128 ms 58368 KB Output is correct
73 Correct 441 ms 62276 KB Output is correct
74 Correct 311 ms 60936 KB Output is correct
75 Correct 358 ms 52988 KB Output is correct
76 Correct 502 ms 70948 KB Output is correct
77 Correct 230 ms 35584 KB Output is correct
78 Correct 438 ms 67284 KB Output is correct
79 Correct 461 ms 63004 KB Output is correct
80 Correct 493 ms 71004 KB Output is correct
81 Correct 161 ms 19816 KB Output is correct
82 Correct 400 ms 65320 KB Output is correct
83 Correct 336 ms 48460 KB Output is correct
84 Correct 492 ms 70908 KB Output is correct
85 Correct 266 ms 64028 KB Output is correct
86 Correct 290 ms 68140 KB Output is correct
87 Correct 170 ms 59844 KB Output is correct
88 Correct 283 ms 68660 KB Output is correct
89 Correct 287 ms 65512 KB Output is correct
90 Correct 286 ms 68620 KB Output is correct
91 Correct 191 ms 61320 KB Output is correct
92 Correct 305 ms 68352 KB Output is correct
93 Correct 172 ms 59884 KB Output is correct
94 Correct 281 ms 68092 KB Output is correct
95 Correct 196 ms 60812 KB Output is correct
96 Correct 275 ms 67984 KB Output is correct