oj.uz

Submission #376840

# Submission time Handle Problem Language Result Execution time Memory
376840 2021-03-12T05:13:19 Z YJU Bitaro, who Leaps through Time (JOI19_timeleap) C++14
100 / 100
 702 ms 88172 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll N=3e5+5;
const ll INF=(1LL<<40);
const ld pi=acos(-1);
const ll MOD=1e9+7;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define setp setprecision
#define SZ(_a) (ll)_a.size()

struct ele{
	ll ty,a,b,c;
	//ele(ll _ty,ll _a,ll _b,ll _c):ty(_ty),a(_a),b(_b),c(_c){};
	void out(){
		cout<<ty<<" "<<a<<" "<<b<<" "<<c<<"\n";
	}
};

ele operator +(ele A,ele B){
	if(A.ty==1){
        if(B.ty==1){
			if(A.a>B.b)return ele{2,A.a,B.b,A.c+B.c+(A.a-B.b)};
			else if(A.b<B.a)return ele{2,A.b,B.a,A.c+B.c};
			else return ele{1,max(A.a,B.a),min(A.b,B.b),A.c+B.c};
        }else{
            if(B.a<=A.b&&A.a<=B.a)return ele{2,B.a,B.b,A.c+B.c};
            else if(A.b<B.a)return ele{2,A.b,B.b,A.c+B.c};
            else if(A.a>B.a)return ele{2,A.a,B.b,A.c+B.c+(A.a-B.a)};
        }
	}else{
		if(B.ty==1){
			if(A.b<=B.b&&A.b>=B.a)return ele{2,A.a,A.b,A.c+B.c};
			else if(A.b>B.b)return ele{2,A.a,B.b,A.c+B.c+(A.b-B.b)};
			else if(A.b<B.a)return ele{2,A.a,B.a,A.c+B.c};
		}else{
            return ele{2,A.a,B.b,A.c+B.c+max(A.b-B.a,0LL)};
		}
	}
}

ll L[N],R[N];
ll n,q,x,ans[N];
vector<ll> input[N];
vector<ele> seg(4*N);

void rev(){
	reverse(L+1,L+n);
	reverse(R+1,R+n);
	REP1(i,q){
        if(input[i][0]==1){
            input[i][1]=n-input[i][1];
		}else{
            input[i][1]=n+1-input[i][1];
            input[i][3]=n+1-input[i][3];
		}
	}
}

void build(ll id,ll l,ll r){
	if(l==r-1){seg[id]=ele{1,L[l]-l,R[l]-l-1,0};return ;}
	ll mid=(l+r)>>1;
	build(id*2,l,mid);
	build(id*2+1,mid,r);
	seg[id]=seg[id*2]+seg[id*2+1];
}

void upd(ll id,ll l,ll r,ll to,ele d){
    if(l==r-1){seg[id]=d;return ;}
    ll mid=(l+r)>>1;
    if(to<mid){
		upd(id*2,l,mid,to,d);
    }else{
		upd(id*2+1,mid,r,to,d);
    }
    seg[id]=seg[id*2]+seg[id*2+1];
}

ele query(ll id,ll l,ll r,ll ql,ll qr){
	if(l>=ql&&r<=qr)return seg[id];
	if(l>=qr||r<=ql)return ele{1,-INF,INF,0};
    ll mid=(l+r)>>1;
    return query(id*2,l,mid,ql,qr)+query(id*2+1,mid,r,ql,qr);
}

void solve(){
	if(n>1)build(1,1,n);
    //REP1(i,n-1)seg[i]=ele{1,L[i]-i,R[i]-i-1,0};

	REP1(i,q){
		ll T=input[i][0];
        if(T==1){
			ll P=input[i][1],NL=input[i][2],NR=input[i][3];
			if(n>1)upd(1,1,n,P,ele{1,NL-P,NR-P-1,0});
			//seg[P]=ele{1,NL-P,NR-P-1,0};
        }else{
			ll A=input[i][1],B=input[i][2],C=input[i][3],D=input[i][4];
			if(A>C)continue;
			if(A==C){ans[i]=max(B-D,0LL);continue;}

			ele sum=query(1,1,n,A,C);

			B-=A,D-=C;
            if(sum.ty==1){
				ans[i]=sum.c+max(0LL,B-sum.b)+max(0LL,max(sum.a,min(B,sum.b))-D);
            }else{
				ans[i]=sum.c+max(0LL,B-sum.a)+max(0LL,sum.b-D);
            }
        }
	}
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	memset(ans,-1,sizeof(ans));
    cin>>n>>q;
    REP1(i,n-1)cin>>L[i]>>R[i];
    REP1(i,q){
		cin>>x;input[i].pb(x);
		if(x==1)REP(j,3)cin>>x,input[i].pb(x);
		else REP(j,4)cin>>x,input[i].pb(x);
    }
    solve();
    rev();
    solve();
    REP1(i,q)if(ans[i]!=-1)cout<<ans[i]<<"\n";
	return 0;
}

Compilation message

timeleap.cpp: In function 'ele operator+(ele, ele)':
timeleap.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47372 KB Output is correct
2 Correct 29 ms 47340 KB Output is correct
3 Correct 28 ms 47340 KB Output is correct
4 Correct 29 ms 47340 KB Output is correct
5 Correct 36 ms 47340 KB Output is correct
6 Correct 29 ms 47340 KB Output is correct
7 Correct 29 ms 47340 KB Output is correct
8 Correct 29 ms 47340 KB Output is correct
9 Correct 29 ms 47340 KB Output is correct
10 Correct 29 ms 47340 KB Output is correct
11 Correct 30 ms 47468 KB Output is correct
12 Correct 30 ms 47468 KB Output is correct
13 Correct 30 ms 47468 KB Output is correct
14 Correct 37 ms 47468 KB Output is correct
15 Correct 30 ms 47468 KB Output is correct
16 Correct 30 ms 47468 KB Output is correct
17 Correct 32 ms 47468 KB Output is correct
18 Correct 30 ms 47468 KB Output is correct
19 Correct 30 ms 47468 KB Output is correct
20 Correct 30 ms 47468 KB Output is correct
21 Correct 30 ms 47468 KB Output is correct
22 Correct 30 ms 47468 KB Output is correct
23 Correct 30 ms 47468 KB Output is correct
24 Correct 30 ms 47468 KB Output is correct
25 Correct 30 ms 47468 KB Output is correct
26 Correct 30 ms 47468 KB Output is correct
27 Correct 31 ms 47468 KB Output is correct
28 Correct 30 ms 47468 KB Output is correct
29 Correct 39 ms 47468 KB Output is correct
30 Correct 30 ms 47468 KB Output is correct
31 Correct 30 ms 47468 KB Output is correct
32 Correct 30 ms 47468 KB Output is correct
33 Correct 38 ms 47488 KB Output is correct
34 Correct 30 ms 47468 KB Output is correct
35 Correct 30 ms 47468 KB Output is correct
36 Correct 30 ms 47468 KB Output is correct
37 Correct 30 ms 47468 KB Output is correct
38 Correct 30 ms 47468 KB Output is correct
39 Correct 29 ms 47468 KB Output is correct
40 Correct 30 ms 47468 KB Output is correct
41 Correct 28 ms 47340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 647 ms 80324 KB Output is correct
2 Correct 637 ms 79680 KB Output is correct
3 Correct 650 ms 79852 KB Output is correct
4 Correct 628 ms 79596 KB Output is correct
5 Correct 702 ms 79980 KB Output is correct
6 Correct 634 ms 79980 KB Output is correct
7 Correct 667 ms 80236 KB Output is correct
8 Correct 660 ms 80492 KB Output is correct
9 Correct 639 ms 79852 KB Output is correct
10 Correct 675 ms 80108 KB Output is correct
11 Correct 644 ms 79988 KB Output is correct
12 Correct 660 ms 80364 KB Output is correct
13 Correct 649 ms 80364 KB Output is correct
14 Correct 29 ms 47488 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47372 KB Output is correct
2 Correct 29 ms 47340 KB Output is correct
3 Correct 28 ms 47340 KB Output is correct
4 Correct 29 ms 47340 KB Output is correct
5 Correct 36 ms 47340 KB Output is correct
6 Correct 29 ms 47340 KB Output is correct
7 Correct 29 ms 47340 KB Output is correct
8 Correct 29 ms 47340 KB Output is correct
9 Correct 29 ms 47340 KB Output is correct
10 Correct 29 ms 47340 KB Output is correct
11 Correct 30 ms 47468 KB Output is correct
12 Correct 30 ms 47468 KB Output is correct
13 Correct 30 ms 47468 KB Output is correct
14 Correct 37 ms 47468 KB Output is correct
15 Correct 30 ms 47468 KB Output is correct
16 Correct 30 ms 47468 KB Output is correct
17 Correct 32 ms 47468 KB Output is correct
18 Correct 30 ms 47468 KB Output is correct
19 Correct 30 ms 47468 KB Output is correct
20 Correct 30 ms 47468 KB Output is correct
21 Correct 30 ms 47468 KB Output is correct
22 Correct 30 ms 47468 KB Output is correct
23 Correct 30 ms 47468 KB Output is correct
24 Correct 30 ms 47468 KB Output is correct
25 Correct 30 ms 47468 KB Output is correct
26 Correct 30 ms 47468 KB Output is correct
27 Correct 31 ms 47468 KB Output is correct
28 Correct 30 ms 47468 KB Output is correct
29 Correct 39 ms 47468 KB Output is correct
30 Correct 30 ms 47468 KB Output is correct
31 Correct 30 ms 47468 KB Output is correct
32 Correct 30 ms 47468 KB Output is correct
33 Correct 38 ms 47488 KB Output is correct
34 Correct 30 ms 47468 KB Output is correct
35 Correct 30 ms 47468 KB Output is correct
36 Correct 30 ms 47468 KB Output is correct
37 Correct 30 ms 47468 KB Output is correct
38 Correct 30 ms 47468 KB Output is correct
39 Correct 29 ms 47468 KB Output is correct
40 Correct 30 ms 47468 KB Output is correct
41 Correct 28 ms 47340 KB Output is correct
42 Correct 647 ms 80324 KB Output is correct
43 Correct 637 ms 79680 KB Output is correct
44 Correct 650 ms 79852 KB Output is correct
45 Correct 628 ms 79596 KB Output is correct
46 Correct 702 ms 79980 KB Output is correct
47 Correct 634 ms 79980 KB Output is correct
48 Correct 667 ms 80236 KB Output is correct
49 Correct 660 ms 80492 KB Output is correct
50 Correct 639 ms 79852 KB Output is correct
51 Correct 675 ms 80108 KB Output is correct
52 Correct 644 ms 79988 KB Output is correct
53 Correct 660 ms 80364 KB Output is correct
54 Correct 649 ms 80364 KB Output is correct
55 Correct 29 ms 47488 KB Output is correct
56 Correct 627 ms 87016 KB Output is correct
57 Correct 612 ms 86380 KB Output is correct
58 Correct 625 ms 87276 KB Output is correct
59 Correct 622 ms 87532 KB Output is correct
60 Correct 671 ms 86636 KB Output is correct
61 Correct 657 ms 87916 KB Output is correct
62 Correct 654 ms 87660 KB Output is correct
63 Correct 631 ms 87660 KB Output is correct
64 Correct 636 ms 87660 KB Output is correct
65 Correct 649 ms 87148 KB Output is correct
66 Correct 629 ms 87276 KB Output is correct
67 Correct 645 ms 87660 KB Output is correct
68 Correct 631 ms 86508 KB Output is correct
69 Correct 668 ms 87896 KB Output is correct
70 Correct 602 ms 86668 KB Output is correct
71 Correct 631 ms 85740 KB Output is correct
72 Correct 615 ms 86336 KB Output is correct
73 Correct 628 ms 87276 KB Output is correct
74 Correct 675 ms 87276 KB Output is correct
75 Correct 631 ms 87532 KB Output is correct
76 Correct 670 ms 88172 KB Output is correct
77 Correct 27 ms 47340 KB Output is correct