oj.uz

답안 #410344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410344 2021-05-22T14:27:52 Z alishahali1382 Bitaro, who Leaps through Time (JOI19_timeleap) C++14
0 / 100
 792 ms 524292 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, l, r, a, b;

struct Node{
	ll dp[2][2];
	Node(ll l=0, ll r=0){
		dp[0][0]=l;
		dp[0][1]=0;
		dp[1][0]=0;
		dp[1][1]=-r;
	}
};
Node Merge(Node X, Node Y){
	Node Z;
	for (int a=0; a<2; a++) for (int b=0; b<2; b++)
		Z.dp[a][b]=max(X.dp[a][0]+Y.dp[1][b], X.dp[a][1]+Y.dp[0][b]);
	return Z;
}
struct Solver{
	int L[MAXN], R[MAXN];
	Node seg[MAXN<<2];
	Solver(){
		seg[0].dp[0][0]=-INF;
		seg[0].dp[0][1]=0;
		seg[0].dp[1][0]=0;
		seg[0].dp[1][1]=-INF;
	}
	void Build(int id, int tl, int tr){
		if (tr-tl==1){
			seg[id]=Node(L[tl], R[tl]);
			return ;
		}
		int mid=(tl+tr)>>1;
		Build(id<<1, tl, mid);
		Build(id<<1 | 1, mid, tr);
		seg[id]=Merge(seg[id<<1], seg[id<<1 | 1]);
	}
	void Set(int id, int tl, int tr, int pos){
		if (pos<tl || tr<=pos) return ;
		if (tr-tl==1){
			seg[id]=Node(L[tl], R[tl]);
			return ;	
		}
		int mid=(tl+tr)>>1;
		Set(id<<1, tl, mid, pos);
		Set(id<<1 | 1, mid, tr, pos);
		seg[id]=Merge(seg[id<<1], seg[id<<1 | 1]);	
	}
	Node Get(int id, int tl, int tr, int l, int r){
		if (r<=tl || tr<=l) return seg[0];
		if (l<=tl && tr<=r) return seg[id];
		int mid=(tl+tr)>>1;
		return Merge(Get(id<<1, tl, mid, l, r), Get(id<<1 | 1, mid, tr, l, r));
	}
	ll Solve(int x, int y, int a, int b){
		a-=x;
		b-=y;
		Node X(a, a);
		Node Y=Get(1, 1, n, x, y);
		Node Z(b, b);
		X=Merge(X, Merge(Y, Z));
//		return max(X.dp[0][1], X.dp[1][0]);
		return X.dp[0][1];
	}
} S1, S2;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<n; i++){
		cin>>l>>r; r--;
		S1.L[i]=l-i;
		S2.L[n-i]=l-(n-i);
		S1.R[i]=r-i;
		S2.R[n-i]=r-(n-i);
	}
	S1.Build(1, 1, n);
	S2.Build(1, 1, n);
	
	while (m--){
		cin>>t;
		if (t==1){
			cin>>x>>l>>r;
			r--;
			S1.L[x]=l-x;
			S2.L[n-x]=l-(n-x);
			S1.R[x]=r-x;
			S2.R[n-x]=r-(n-x);
			S1.Set(1, 1, n, x);
			S2.Set(1, 1, n, n-x);
		}
		else{
			cin>>x>>a>>y>>b;
			if (x==y) cout<<max(0, a-b)<<"\n";
			if (x<y) cout<<S1.Solve(x, y, a, b)<<"\n";
			if (x>y) cout<<S2.Solve(n+1-x, n+1-y, a, b)<<"\n";
		}
	}
	
	return 0;
}
/*
5 1
3 5
4 8
2 6
5 10
2 5 3 1 10

5 1
5 10
2 6
4 8
3 5
2 1 3 5 10

*/

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 75460 KB Output is correct
2 Correct 41 ms 75424 KB Output is correct
3 Correct 40 ms 75360 KB Output is correct
4 Correct 41 ms 75416 KB Output is correct
5 Correct 40 ms 75460 KB Output is correct
6 Correct 41 ms 75472 KB Output is correct
7 Correct 41 ms 75360 KB Output is correct
8 Correct 42 ms 75404 KB Output is correct
9 Correct 40 ms 75432 KB Output is correct
10 Correct 40 ms 75408 KB Output is correct
11 Correct 42 ms 75460 KB Output is correct
12 Correct 42 ms 75420 KB Output is correct
13 Correct 42 ms 75464 KB Output is correct
14 Correct 42 ms 75488 KB Output is correct
15 Correct 42 ms 75388 KB Output is correct
16 Correct 41 ms 75460 KB Output is correct
17 Correct 42 ms 75464 KB Output is correct
18 Correct 41 ms 75408 KB Output is correct
19 Correct 41 ms 75472 KB Output is correct
20 Correct 41 ms 75468 KB Output is correct
21 Correct 42 ms 75460 KB Output is correct
22 Correct 42 ms 75440 KB Output is correct
23 Correct 42 ms 75480 KB Output is correct
24 Correct 41 ms 75400 KB Output is correct
25 Correct 41 ms 75460 KB Output is correct
26 Correct 42 ms 75380 KB Output is correct
27 Correct 42 ms 75436 KB Output is correct
28 Correct 42 ms 75372 KB Output is correct
29 Correct 42 ms 75468 KB Output is correct
30 Correct 42 ms 75492 KB Output is correct
31 Correct 42 ms 75464 KB Output is correct
32 Correct 41 ms 75460 KB Output is correct
33 Correct 42 ms 75476 KB Output is correct
34 Correct 44 ms 75412 KB Output is correct
35 Correct 42 ms 75456 KB Output is correct
36 Correct 41 ms 75380 KB Output is correct
37 Correct 41 ms 75392 KB Output is correct
38 Correct 42 ms 75432 KB Output is correct
39 Correct 42 ms 75472 KB Output is correct
40 Correct 42 ms 75460 KB Output is correct
41 Runtime error 259 ms 524292 KB Execution killed with signal 9

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 690 ms 83944 KB Output is correct
2 Correct 683 ms 83688 KB Output is correct
3 Correct 686 ms 83920 KB Output is correct
4 Correct 693 ms 83652 KB Output is correct
5 Correct 718 ms 83936 KB Output is correct
6 Correct 715 ms 83884 KB Output is correct
7 Correct 738 ms 84072 KB Output is correct
8 Correct 725 ms 84284 KB Output is correct
9 Correct 718 ms 83672 KB Output is correct
10 Correct 785 ms 83912 KB Output is correct
11 Correct 792 ms 83932 KB Output is correct
12 Correct 771 ms 84296 KB Output is correct
13 Correct 729 ms 84384 KB Output is correct
14 Runtime error 247 ms 524292 KB Execution killed with signal 9

Subtask #3
0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 75460 KB Output is correct
2 Correct 41 ms 75424 KB Output is correct
3 Correct 40 ms 75360 KB Output is correct
4 Correct 41 ms 75416 KB Output is correct
5 Correct 40 ms 75460 KB Output is correct
6 Correct 41 ms 75472 KB Output is correct
7 Correct 41 ms 75360 KB Output is correct
8 Correct 42 ms 75404 KB Output is correct
9 Correct 40 ms 75432 KB Output is correct
10 Correct 40 ms 75408 KB Output is correct
11 Correct 42 ms 75460 KB Output is correct
12 Correct 42 ms 75420 KB Output is correct
13 Correct 42 ms 75464 KB Output is correct
14 Correct 42 ms 75488 KB Output is correct
15 Correct 42 ms 75388 KB Output is correct
16 Correct 41 ms 75460 KB Output is correct
17 Correct 42 ms 75464 KB Output is correct
18 Correct 41 ms 75408 KB Output is correct
19 Correct 41 ms 75472 KB Output is correct
20 Correct 41 ms 75468 KB Output is correct
21 Correct 42 ms 75460 KB Output is correct
22 Correct 42 ms 75440 KB Output is correct
23 Correct 42 ms 75480 KB Output is correct
24 Correct 41 ms 75400 KB Output is correct
25 Correct 41 ms 75460 KB Output is correct
26 Correct 42 ms 75380 KB Output is correct
27 Correct 42 ms 75436 KB Output is correct
28 Correct 42 ms 75372 KB Output is correct
29 Correct 42 ms 75468 KB Output is correct
30 Correct 42 ms 75492 KB Output is correct
31 Correct 42 ms 75464 KB Output is correct
32 Correct 41 ms 75460 KB Output is correct
33 Correct 42 ms 75476 KB Output is correct
34 Correct 44 ms 75412 KB Output is correct
35 Correct 42 ms 75456 KB Output is correct
36 Correct 41 ms 75380 KB Output is correct
37 Correct 41 ms 75392 KB Output is correct
38 Correct 42 ms 75432 KB Output is correct
39 Correct 42 ms 75472 KB Output is correct
40 Correct 42 ms 75460 KB Output is correct
41 Runtime error 259 ms 524292 KB Execution killed with signal 9