oj.uz

답안 #376815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376815 2021-03-12T04:53:53 Z YJU Bitaro, who Leaps through Time (JOI19_timeleap) C++14
4 / 100
 3000 ms 75660 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<<60);
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 solve(){
    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];
			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=seg[A];
			B-=A,D-=C;
			for(int j=A+1;j<C;j++)sum=sum+seg[j];
			//sum.out();
			//cout<<B<<" "<<D<<"\n";
            //cout<<sum.ty<<" "<<sum.a<<" "<<sum.b<<" "<<sum.c<<"\n";
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47340 KB Output is correct
2 Correct 28 ms 47340 KB Output is correct
3 Correct 29 ms 47340 KB Output is correct
4 Correct 34 ms 47340 KB Output is correct
5 Correct 30 ms 47340 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 29 ms 47340 KB Output is correct
9 Correct 30 ms 47340 KB Output is correct
10 Correct 29 ms 47340 KB Output is correct
11 Correct 34 ms 47416 KB Output is correct
12 Correct 35 ms 47468 KB Output is correct
13 Correct 30 ms 47468 KB Output is correct
14 Correct 30 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 30 ms 47468 KB Output is correct
18 Correct 31 ms 47616 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 47500 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 33 ms 47468 KB Output is correct
26 Correct 31 ms 47468 KB Output is correct
27 Correct 30 ms 47468 KB Output is correct
28 Correct 30 ms 47596 KB Output is correct
29 Correct 30 ms 47468 KB Output is correct
30 Correct 31 ms 47468 KB Output is correct
31 Correct 30 ms 47468 KB Output is correct
32 Correct 31 ms 47468 KB Output is correct
33 Correct 30 ms 47488 KB Output is correct
34 Correct 35 ms 47468 KB Output is correct
35 Correct 31 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 30 ms 47468 KB Output is correct
40 Correct 30 ms 47468 KB Output is correct
41 Correct 33 ms 47340 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3081 ms 75660 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47340 KB Output is correct
2 Correct 28 ms 47340 KB Output is correct
3 Correct 29 ms 47340 KB Output is correct
4 Correct 34 ms 47340 KB Output is correct
5 Correct 30 ms 47340 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 29 ms 47340 KB Output is correct
9 Correct 30 ms 47340 KB Output is correct
10 Correct 29 ms 47340 KB Output is correct
11 Correct 34 ms 47416 KB Output is correct
12 Correct 35 ms 47468 KB Output is correct
13 Correct 30 ms 47468 KB Output is correct
14 Correct 30 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 30 ms 47468 KB Output is correct
18 Correct 31 ms 47616 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 47500 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 33 ms 47468 KB Output is correct
26 Correct 31 ms 47468 KB Output is correct
27 Correct 30 ms 47468 KB Output is correct
28 Correct 30 ms 47596 KB Output is correct
29 Correct 30 ms 47468 KB Output is correct
30 Correct 31 ms 47468 KB Output is correct
31 Correct 30 ms 47468 KB Output is correct
32 Correct 31 ms 47468 KB Output is correct
33 Correct 30 ms 47488 KB Output is correct
34 Correct 35 ms 47468 KB Output is correct
35 Correct 31 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 30 ms 47468 KB Output is correct
40 Correct 30 ms 47468 KB Output is correct
41 Correct 33 ms 47340 KB Output is correct
42 Execution timed out 3081 ms 75660 KB Time limit exceeded
43 Halted 0 ms 0 KB -