oj.uz

Submission #465986

# Submission time Handle Problem Language Result Execution time Memory
465986 2021-08-17T13:12:27 Z nathanlee726 Two Antennas (JOI19_antennas) C++14
100 / 100
 723 ms 58084 KB 
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;


//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
int h[200010],o[200010];
pii b[200010];
pair<pii,int> qr[200010];
vector<pii> ev;
struct NODE{
	int v,mi,ma,ti,ta;
	NODE():v(-1e15),mi(1e15),ma(-1e15),ti(-1e15),ta(1e15){}
}seg[800010];
void pull(int p){
	seg[p].mi=min(seg[p*2].mi,seg[p*2+1].mi);
	seg[p].ma=max(seg[p*2].ma,seg[p*2+1].ma);
	seg[p].v=max(seg[p*2].v,seg[p*2+1].v);
}
void push(int p,int l,int mi,int r){
	seg[p*2].ta=min(seg[p*2].ta,seg[p].ta);
	seg[p*2+1].ta=min(seg[p*2+1].ta,seg[p].ta);
	seg[p*2].ti=max(seg[p*2].ti,seg[p].ti);
	seg[p*2+1].ti=max(seg[p*2+1].ti,seg[p].ti);
	seg[p*2].v=max(seg[p*2].v,max(seg[p*2].ma-seg[p*2].ta,seg[p*2].ti-seg[p*2].mi));
	seg[p*2+1].v=max(seg[p*2+1].v,max(seg[p*2+1].ma-seg[p*2+1].ta,seg[p*2+1].ti-seg[p*2+1].mi));
	seg[p].ti=-1e15,seg[p].ta=1e15;
}
void insert(int p,int l,int r,int x,int d){
	if(l==r){
		seg[p].ti=-1e15,seg[p].ta=1e15;
		if(d==-1){
			seg[p].ma=-1e15,seg[p].mi=1e15; 
		}
		else{
			seg[p].ma=seg[p].mi=d;
		}
		return;
	}
	int mi=(l+r)/2;
	push(p,l,mi,r);
	if(x>mi)insert(p*2+1,mi+1,r,x,d);
	else insert(p*2,l,mi,x,d);
	pull(p);
}
void modify(int p,int l,int r,int ql,int qr,int v){
	if(ql>r||qr<l)return;
	if(l>=ql&&r<=qr){
		seg[p].ti=max(seg[p].ti,v);
		seg[p].ta=min(seg[p].ta,v);
		seg[p].v=max(seg[p].v,max(seg[p].ma-seg[p].ta,seg[p].ti-seg[p].mi));
		return;
	}
	int mi=(l+r)/2;
	push(p,l,mi,r);
	modify(p*2,l,mi,ql,qr,v);
	modify(p*2+1,mi+1,r,ql,qr,v);
	pull(p);
}
int query(int p,int l,int r,int ql,int qr){
	if(ql>r||qr<l)return -1e15;
	if(l>=ql&&r<=qr){bug(p,l,r,ql,qr,seg[p].v);return seg[p].v;}
	int mi=(l+r)/2;
	push(p,l,mi,r);
	return max(query(p*2,l,mi,ql,qr),query(p*2+1,mi+1,r,ql,qr));
}
bool cmp(pair<pii,int> a,pair<pii,int> b){
	if(a.X.Y==b.X.Y)return a.X.X<b.X.X;
	else return a.X.Y<b.X.Y;
}
bool cmp1(pii a,pii b){
	if(a.X==b.X)return a.Y>b.Y;
	else return a.X<b.X;
}
signed main(){
	IOS();
	int n;
	cin>>n;
	F(n)cin>>h[i]>>b[i].X>>b[i].Y;
	int q;
	cin>>q;
	F(q)cin>>qr[i].X.X>>qr[i].X.Y,qr[i].X.X--,qr[i].X.Y--;
	F(q)qr[i].Y=i;
	sort(qr,qr+q,cmp);
	F(n){
		ev.pb({min(n,i+b[i].X),i+1});
		ev.pb({min(n,i+b[i].Y+1),-i-1});
	}
	sort(all(ev),cmp1);
	int p0=0,p1=0;
	F(n){
		while(p0<sz(ev)&&ev[p0].X==i){
			if(ev[p0].Y>0){
				insert(1,0,n-1,ev[p0].Y-1,h[ev[p0].Y-1]);
			}
			else{
				insert(1,0,n-1,-ev[p0].Y-1,-1);
			}
			p0++;
		}
		if(i-b[i].X>=0ll)modify(1,0,n-1,max(0ll,i-b[i].Y),max(0ll,i-b[i].X),h[i]);
		while(p1<q&&qr[p1].X.Y==i){
			o[qr[p1].Y]=query(1,0,n-1,qr[p1].X.X,qr[p1].X.Y);
			if(o[qr[p1].Y]<0)o[qr[p1].Y]=-1;
			p1++;
		}
	}
	F(q)cout<<o[i]<<endl;
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31564 KB Output is correct
2 Correct 15 ms 31692 KB Output is correct
3 Correct 16 ms 31692 KB Output is correct
4 Correct 16 ms 31592 KB Output is correct
5 Correct 15 ms 31684 KB Output is correct
6 Correct 15 ms 31640 KB Output is correct
7 Correct 15 ms 31632 KB Output is correct
8 Correct 15 ms 31632 KB Output is correct
9 Correct 15 ms 31564 KB Output is correct
10 Correct 15 ms 31692 KB Output is correct
11 Correct 16 ms 31564 KB Output is correct
12 Correct 16 ms 31636 KB Output is correct
13 Correct 15 ms 31568 KB Output is correct
14 Correct 15 ms 31564 KB Output is correct
15 Correct 17 ms 31636 KB Output is correct
16 Correct 15 ms 31652 KB Output is correct
17 Correct 15 ms 31692 KB Output is correct
18 Correct 15 ms 31692 KB Output is correct
19 Correct 17 ms 31664 KB Output is correct
20 Correct 15 ms 31692 KB Output is correct
21 Correct 16 ms 31692 KB Output is correct
22 Correct 15 ms 31580 KB Output is correct
23 Correct 15 ms 31648 KB Output is correct
24 Correct 16 ms 31664 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31564 KB Output is correct
2 Correct 15 ms 31692 KB Output is correct
3 Correct 16 ms 31692 KB Output is correct
4 Correct 16 ms 31592 KB Output is correct
5 Correct 15 ms 31684 KB Output is correct
6 Correct 15 ms 31640 KB Output is correct
7 Correct 15 ms 31632 KB Output is correct
8 Correct 15 ms 31632 KB Output is correct
9 Correct 15 ms 31564 KB Output is correct
10 Correct 15 ms 31692 KB Output is correct
11 Correct 16 ms 31564 KB Output is correct
12 Correct 16 ms 31636 KB Output is correct
13 Correct 15 ms 31568 KB Output is correct
14 Correct 15 ms 31564 KB Output is correct
15 Correct 17 ms 31636 KB Output is correct
16 Correct 15 ms 31652 KB Output is correct
17 Correct 15 ms 31692 KB Output is correct
18 Correct 15 ms 31692 KB Output is correct
19 Correct 17 ms 31664 KB Output is correct
20 Correct 15 ms 31692 KB Output is correct
21 Correct 16 ms 31692 KB Output is correct
22 Correct 15 ms 31580 KB Output is correct
23 Correct 15 ms 31648 KB Output is correct
24 Correct 16 ms 31664 KB Output is correct
25 Correct 136 ms 38764 KB Output is correct
26 Correct 30 ms 32532 KB Output is correct
27 Correct 188 ms 41544 KB Output is correct
28 Correct 188 ms 41672 KB Output is correct
29 Correct 130 ms 38760 KB Output is correct
30 Correct 130 ms 38232 KB Output is correct
31 Correct 153 ms 40832 KB Output is correct
32 Correct 186 ms 41540 KB Output is correct
33 Correct 174 ms 40956 KB Output is correct
34 Correct 98 ms 36420 KB Output is correct
35 Correct 187 ms 41540 KB Output is correct
36 Correct 215 ms 41680 KB Output is correct
37 Correct 117 ms 36920 KB Output is correct
38 Correct 185 ms 40688 KB Output is correct
39 Correct 41 ms 32984 KB Output is correct
40 Correct 204 ms 40688 KB Output is correct
41 Correct 138 ms 38240 KB Output is correct
42 Correct 184 ms 40656 KB Output is correct
43 Correct 71 ms 34744 KB Output is correct
44 Correct 188 ms 40644 KB Output is correct
45 Correct 47 ms 33220 KB Output is correct
46 Correct 185 ms 40684 KB Output is correct
47 Correct 69 ms 34008 KB Output is correct
48 Correct 202 ms 40676 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 44200 KB Output is correct
2 Correct 341 ms 44600 KB Output is correct
3 Correct 222 ms 43252 KB Output is correct
4 Correct 336 ms 44600 KB Output is correct
5 Correct 142 ms 38028 KB Output is correct
6 Correct 347 ms 44636 KB Output is correct
7 Correct 292 ms 43956 KB Output is correct
8 Correct 333 ms 49112 KB Output is correct
9 Correct 53 ms 34232 KB Output is correct
10 Correct 341 ms 49208 KB Output is correct
11 Correct 198 ms 41524 KB Output is correct
12 Correct 348 ms 49208 KB Output is correct
13 Correct 296 ms 49148 KB Output is correct
14 Correct 274 ms 49036 KB Output is correct
15 Correct 278 ms 49100 KB Output is correct
16 Correct 242 ms 49032 KB Output is correct
17 Correct 318 ms 48992 KB Output is correct
18 Correct 266 ms 49128 KB Output is correct
19 Correct 283 ms 49036 KB Output is correct
20 Correct 263 ms 49084 KB Output is correct
21 Correct 281 ms 49032 KB Output is correct
22 Correct 274 ms 49084 KB Output is correct
23 Correct 270 ms 49068 KB Output is correct
24 Correct 243 ms 49080 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31564 KB Output is correct
2 Correct 15 ms 31692 KB Output is correct
3 Correct 16 ms 31692 KB Output is correct
4 Correct 16 ms 31592 KB Output is correct
5 Correct 15 ms 31684 KB Output is correct
6 Correct 15 ms 31640 KB Output is correct
7 Correct 15 ms 31632 KB Output is correct
8 Correct 15 ms 31632 KB Output is correct
9 Correct 15 ms 31564 KB Output is correct
10 Correct 15 ms 31692 KB Output is correct
11 Correct 16 ms 31564 KB Output is correct
12 Correct 16 ms 31636 KB Output is correct
13 Correct 15 ms 31568 KB Output is correct
14 Correct 15 ms 31564 KB Output is correct
15 Correct 17 ms 31636 KB Output is correct
16 Correct 15 ms 31652 KB Output is correct
17 Correct 15 ms 31692 KB Output is correct
18 Correct 15 ms 31692 KB Output is correct
19 Correct 17 ms 31664 KB Output is correct
20 Correct 15 ms 31692 KB Output is correct
21 Correct 16 ms 31692 KB Output is correct
22 Correct 15 ms 31580 KB Output is correct
23 Correct 15 ms 31648 KB Output is correct
24 Correct 16 ms 31664 KB Output is correct
25 Correct 136 ms 38764 KB Output is correct
26 Correct 30 ms 32532 KB Output is correct
27 Correct 188 ms 41544 KB Output is correct
28 Correct 188 ms 41672 KB Output is correct
29 Correct 130 ms 38760 KB Output is correct
30 Correct 130 ms 38232 KB Output is correct
31 Correct 153 ms 40832 KB Output is correct
32 Correct 186 ms 41540 KB Output is correct
33 Correct 174 ms 40956 KB Output is correct
34 Correct 98 ms 36420 KB Output is correct
35 Correct 187 ms 41540 KB Output is correct
36 Correct 215 ms 41680 KB Output is correct
37 Correct 117 ms 36920 KB Output is correct
38 Correct 185 ms 40688 KB Output is correct
39 Correct 41 ms 32984 KB Output is correct
40 Correct 204 ms 40688 KB Output is correct
41 Correct 138 ms 38240 KB Output is correct
42 Correct 184 ms 40656 KB Output is correct
43 Correct 71 ms 34744 KB Output is correct
44 Correct 188 ms 40644 KB Output is correct
45 Correct 47 ms 33220 KB Output is correct
46 Correct 185 ms 40684 KB Output is correct
47 Correct 69 ms 34008 KB Output is correct
48 Correct 202 ms 40676 KB Output is correct
49 Correct 318 ms 44200 KB Output is correct
50 Correct 341 ms 44600 KB Output is correct
51 Correct 222 ms 43252 KB Output is correct
52 Correct 336 ms 44600 KB Output is correct
53 Correct 142 ms 38028 KB Output is correct
54 Correct 347 ms 44636 KB Output is correct
55 Correct 292 ms 43956 KB Output is correct
56 Correct 333 ms 49112 KB Output is correct
57 Correct 53 ms 34232 KB Output is correct
58 Correct 341 ms 49208 KB Output is correct
59 Correct 198 ms 41524 KB Output is correct
60 Correct 348 ms 49208 KB Output is correct
61 Correct 296 ms 49148 KB Output is correct
62 Correct 274 ms 49036 KB Output is correct
63 Correct 278 ms 49100 KB Output is correct
64 Correct 242 ms 49032 KB Output is correct
65 Correct 318 ms 48992 KB Output is correct
66 Correct 266 ms 49128 KB Output is correct
67 Correct 283 ms 49036 KB Output is correct
68 Correct 263 ms 49084 KB Output is correct
69 Correct 281 ms 49032 KB Output is correct
70 Correct 274 ms 49084 KB Output is correct
71 Correct 270 ms 49068 KB Output is correct
72 Correct 243 ms 49080 KB Output is correct
73 Correct 596 ms 53692 KB Output is correct
74 Correct 409 ms 49744 KB Output is correct
75 Correct 538 ms 53652 KB Output is correct
76 Correct 703 ms 57968 KB Output is correct
77 Correct 346 ms 46564 KB Output is correct
78 Correct 571 ms 54432 KB Output is correct
79 Correct 595 ms 56060 KB Output is correct
80 Correct 649 ms 58084 KB Output is correct
81 Correct 313 ms 44224 KB Output is correct
82 Correct 550 ms 52708 KB Output is correct
83 Correct 538 ms 52052 KB Output is correct
84 Correct 723 ms 58044 KB Output is correct
85 Correct 455 ms 53220 KB Output is correct
86 Correct 595 ms 56872 KB Output is correct
87 Correct 311 ms 49976 KB Output is correct
88 Correct 530 ms 56756 KB Output is correct
89 Correct 520 ms 54328 KB Output is correct
90 Correct 569 ms 56792 KB Output is correct
91 Correct 383 ms 51512 KB Output is correct
92 Correct 574 ms 56832 KB Output is correct
93 Correct 329 ms 50392 KB Output is correct
94 Correct 565 ms 56868 KB Output is correct
95 Correct 348 ms 50876 KB Output is correct
96 Correct 559 ms 56784 KB Output is correct