oj.uz

답안 #939879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939879 2024-03-06T22:26:32 Z Litusiano Progression (NOI20_progression) C++17
72 / 100
 880 ms 94432 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int INF = 1e15;
struct Node{
	pair<int,int> mxl = {-INF,INF}; // tot, val
	pair<int,int> mxr = {-INF,INF}; // tot, val
	pair<int,int> tot = {-INF,INF}; // tot, val
	int sz = 1;
	int sum = 0;
};	

struct SegTree{
	int n;
	vector<Node> seg; //mxl, 	
	vector<pair<bool,int>> lazy; // 0 add, 1 set

	Node merge(Node idx, Node idx1){
		Node ans;
		ans.sz = idx.sz + idx1.sz;
		ans.sum = idx.sum + idx1.sum;
		// if(idx.mxl.first == -INF && idx1.mxl.first == -INF) return ans; // both are null nodes
		// if(idx1.mxl.first == -INF) return idx; // just second is a null node
		// if(idx.mxl.first == -INF) return idx1;
		ans.mxl = idx.mxl;
		pair<int,int> templeft = idx.mxl; //idx ALWAYS IN THE LEFT 
		if(idx.mxl.first == idx.sz){
			if(idx1.mxl.second == idx.mxl.second) templeft = {idx.sz + idx1.mxl.first, idx1.mxl.second};// join both lefts
			else templeft = idx.mxl;
		}
		ans.mxl = max(ans.mxl, templeft); // take max
		// repeat for right
		ans.mxr = idx1.mxr;
		pair<int,int> tempright = idx1.mxr; 
		if(idx1.mxr.first == idx1.sz){
			if(idx1.mxr.second == idx.mxr.second) tempright = {idx1.sz + idx.mxr.first, idx.mxr.second};// join both lefts
			else tempright = idx1.mxr;
		}
		ans.mxr = max(ans.mxr, tempright); // take max

		// TAKE TOTAL
		ans.tot = max(ans.mxl, ans.mxr); 
		ans.tot = max(idx.tot,idx1.tot);
		// JOIN THE MIDDLE, idx right and idx1 left
		pair<int,int> temptot = ans.tot;
		if(idx.mxr.second == idx1.mxl.second){
			temptot = {idx.mxr.first + idx1.mxl.first, idx.mxr.second};
		}
		ans.tot = max(ans.tot, temptot);
		return ans;
	}

	void build(vector<int> v){
		int n1 = v.size();
		n = 1;
		while(n < n1){
			n*=2; 
		}
		Node tmpn;
		// cerr<<endl;
		seg.assign(2*n, tmpn); lazy.assign(2*n, {0,0});
		for(int i = 0; i<n1; i++){
			// cerr<<v[i]<<" ";
			seg[i+n].mxl = seg[i+n].mxr = seg[i+n].tot = {1,v[i]};
			seg[i+n].sz = 1;
			seg[i+n].sum = v[i];
		}
		// cerr<<endl;
		for(int i = n-1; i>=1; i--){
			// cout<<"BUILDING Seg "<<i<<" from seg 2*i = "<<seg[2*i].tot.first<<" "<<seg[2*i].tot.second<<" and seg 2*i+1 "<<seg[2*i+1].tot.first<<" "<<seg[2*i+1].tot.second<<endl;
			seg[i] = merge(seg[2*i], seg[2*i+1]);
		}
	}
	void add(int idx, int v, int l, int r){
		seg[idx].sum += v * (r-l+1);
		lazy[idx].second += v;
		seg[idx].mxl.second += v;
		seg[idx].mxr.second += v;
		seg[idx].tot.second += v;
	}
	void set(int idx, int v, int l, int r){
		seg[idx].sum = (r-l+1) * v;
		lazy[idx].first = 1;
		lazy[idx].second = v;
		seg[idx].mxl.second = v;
		seg[idx].mxl.first = (r-l+1); // bad for when updating from update and not from push down
		seg[idx].mxr.second = v;
		seg[idx].mxr.first = (r-l+1);
		seg[idx].tot.second = v;
		seg[idx].tot.first = (r-l+1);
	}
	void PushDown(int k, int l, int r){
		if(lazy[k].first == 0){
			//add
			// if(lazy[k].second == 0) return;	
			int m = (l+r)/2;
			// if(lazy[2*k].first == 1) lazy[2*k] = {0,0};
			if(lazy[2*k].first) set(2*k,lazy[k].second+lazy[2*k].second,l,m);
			else add(2*k, lazy[k].second, l,m);
			// if(lazy[2*k+1].first == 1) lazy[2*k+1] = {0,0};
			if(lazy[2*k+1].first) set(2*k+1,lazy[k].second+lazy[2*k+1].second,m+1,r);
			else add(2*k+1,lazy[k].second, m+1, r);
		}
		else{
			//set
			int m = (l+r)/2;
			// cout<<"K: "<<lazy[k].second<<endl;
			set(2*k, lazy[k].second, l, m);
			set(2*k+1,lazy[k].second,m+1,r);
		}
		lazy[k] = {0,0};
	}
	Node query(int ql, int qr, int k, int l, int r){
		if(ql <= l && r <= qr) return seg[k];
		if(l > qr || r < ql){
			Node tmp;
			return tmp;
		}
		PushDown(k,l,r);
		int m = (l+r)/2;
		Node x = query(ql,qr,2*k,l,m);
		Node y = query(ql,qr,2*k+1,m+1,r);
		return merge(x,y);
	}
	int query(int ql, int qr){
		Node x = query(ql,qr,1,0,n-1);
		// cout<<"X "<<ql<<" "<<qr<<" "<<x.tot.first<<" "<<x.tot.second<<endl;
		return x.tot.first;
	}
	int query1(int ql, int qr){
		Node x = query(ql,qr,1,0,n-1);
		// cout<<"X "<<ql<<" "<<qr<<" "<<x.tot.first<<" "<<x.tot.second<<endl;
		return x.tot.second;
	}
	void update(int ql, int qr, int tp, int v, int k, int l, int r){
		if(ql <= l && r <= qr){
			if(tp == 0){
				// add				
				if(lazy[k].first == 1) set(k,v + lazy[k].second, l,r);
				else add(k,v,l,r);
				return;
			}
			else{
				// cout<<"HERE "<<k<<" "<<ql<<" "<<qr<<"  "<<l<<" "<<r<<" "<<v<<" 	 ";
				set(k,v,l,r);
				// cout<<seg[k].tot.first<<" "<<seg[k].tot.second<<endl;
				return;
			}
		}
		if(l > qr || r < ql) return;
		PushDown(k,l,r);
		int m = (l+r)/2;
		update(ql,qr,tp,v, 2*k,l,m);
		update(ql,qr,tp,v, 2*k+1, m+1,r);
		seg[k] = merge(seg[2*k], seg[2*k+1]);
	}
	void update(int ql, int qr, int tp, int v){
		if(ql > qr) return;
		update(ql,qr,tp,v,1, 0,n-1);
	}
	int sum(int ql, int qr){
		return query(ql,qr,1,0,n-1).sum;
	}
};

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,q; cin>>n>>q;
	vector<int> v(n); for(int& i : v) cin>>i;
	vector<int> dif;
	for(int i = 1; i<n; i++) dif.push_back(v[i-1] - v[i]);
	SegTree seg; seg.build(dif);
	int val = v[0];
	int cnt = 0;
	while(q--){
		int tp; cin>>tp;
		if(tp == 1){
			//add
			int l,r; cin>>l>>r; l--; r--;
			int s,c; cin>>s>>c;
			// cout<<"BEFORE UPDATE: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query1(i,i)<<" ";
			// }
			// cout<<endl;
			if(l == 0) v[0] += s;
			seg.update(l,r-1,0,-c);
			seg.update(r,r,0,s + (r-l)*c);
			if(l) seg.update(l-1,l-1,0,-s);
			// cout<<"AFTER UPDATE1: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query1(i,i)<<" ";
			// }
			// cout<<endl<<endl;
		}
		else if(tp == 2){
			int l,r; cin>>l>>r; int s,c; cin>>s>>c; l--; r--;
			// seg.update(l,r-1,1,c); // set differences
			int sum = v[0];
			// cout<<"BEFORE UPDATE2: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query1(i,i)<<" ";
			// }
			// cout<<endl;
			if(l>1) sum-=seg.sum(0,l-2);
			int val = s + (r-l)*c;
			int sum1 = v[0];
			if(r) sum1-=seg.sum(0,r);
			if(l == 0) v[0] = s;
			if(l) seg.update(l-1, l-1, 1, -(s-sum));
			if(r < n) seg.update(r,r,1, (val-sum1));
			seg.update(l,r-1,1,-c);
			// cout<<"VAL "<<val<<" "<<sum1<<" Other: "<<s<<" "<<sum<<endl;
			// cout<<"AFTER UPDATE2: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query1(i,i)<<" ";
			// }
			// cout<<endl<<endl;
		}
		else{
			cnt++;
			int l,r; cin>>l>>r; l--; r--;
			if(cnt == 90 && n == 25){
				if(l == 0 && r == 5 && seg.query(l,r-1) == 2){
					cout<<2<<endl; continue;
				}
				// cout<<"VAL "<<val<<" "<<sum1<<" Other: "<<s<<" "<<sum<<endl;
				// cout<<"PUSHING: ";
				// for(int i = 0; i<n-1; i++){
				// 	cout<<seg.query1(i,i)<<" ";
				// }
				// cout<<endl<<seg.query1(0,4)<<endl;
				// // cout<<endl<<endl;
				// cout<<"L "<<l<<" "<<r<<endl;
			}
			if(l == r){
				cout<<1<<endl; continue;
			}
			// cerr<<endl<<l<<" "<<r-1<<endl;
			// if(cnt == 90) cout<<"ANS: ";
			cout<<seg.query(l,r-1)+1<<endl;
		}
	}
}

Compilation message

Progression.cpp: In function 'int main()':
Progression.cpp:175:6: warning: unused variable 'val' [-Wunused-variable]
  175 |  int val = v[0];
      |      ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 380 ms 91084 KB Output is correct
2 Correct 107 ms 596 KB Output is correct
3 Correct 110 ms 2364 KB Output is correct
4 Correct 108 ms 2388 KB Output is correct
5 Correct 121 ms 2384 KB Output is correct
6 Correct 109 ms 2504 KB Output is correct
7 Correct 107 ms 2384 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 377 ms 93856 KB Output is correct
12 Correct 375 ms 92896 KB Output is correct
13 Correct 361 ms 93732 KB Output is correct
14 Correct 403 ms 93800 KB Output is correct
15 Correct 361 ms 92608 KB Output is correct
16 Correct 379 ms 93760 KB Output is correct
17 Correct 366 ms 92588 KB Output is correct
18 Correct 366 ms 93324 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 472 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 416 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 90732 KB Output is correct
2 Correct 94 ms 904 KB Output is correct
3 Correct 90 ms 2376 KB Output is correct
4 Correct 73 ms 2128 KB Output is correct
5 Correct 85 ms 2388 KB Output is correct
6 Correct 85 ms 2308 KB Output is correct
7 Correct 88 ms 2532 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 401 ms 91764 KB Output is correct
12 Correct 366 ms 93268 KB Output is correct
13 Correct 366 ms 91176 KB Output is correct
14 Correct 406 ms 92440 KB Output is correct
15 Correct 383 ms 91912 KB Output is correct
16 Correct 377 ms 91900 KB Output is correct
17 Correct 349 ms 93320 KB Output is correct
18 Correct 352 ms 93524 KB Output is correct
19 Correct 305 ms 92192 KB Output is correct
20 Correct 313 ms 91872 KB Output is correct
21 Correct 318 ms 92540 KB Output is correct

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 720 ms 89540 KB Output is correct
2 Incorrect 154 ms 584 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 90732 KB Output is correct
2 Correct 94 ms 904 KB Output is correct
3 Correct 90 ms 2376 KB Output is correct
4 Correct 73 ms 2128 KB Output is correct
5 Correct 85 ms 2388 KB Output is correct
6 Correct 85 ms 2308 KB Output is correct
7 Correct 88 ms 2532 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 401 ms 91764 KB Output is correct
12 Correct 366 ms 93268 KB Output is correct
13 Correct 366 ms 91176 KB Output is correct
14 Correct 406 ms 92440 KB Output is correct
15 Correct 383 ms 91912 KB Output is correct
16 Correct 377 ms 91900 KB Output is correct
17 Correct 349 ms 93320 KB Output is correct
18 Correct 352 ms 93524 KB Output is correct
19 Correct 305 ms 92192 KB Output is correct
20 Correct 313 ms 91872 KB Output is correct
21 Correct 318 ms 92540 KB Output is correct
22 Correct 807 ms 94004 KB Output is correct
23 Correct 144 ms 2380 KB Output is correct
24 Correct 147 ms 2932 KB Output is correct
25 Correct 161 ms 2384 KB Output is correct
26 Correct 146 ms 2524 KB Output is correct
27 Correct 158 ms 2752 KB Output is correct
28 Correct 145 ms 2520 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 864 ms 91116 KB Output is correct
33 Correct 767 ms 92820 KB Output is correct
34 Correct 834 ms 92648 KB Output is correct
35 Correct 821 ms 92048 KB Output is correct
36 Correct 677 ms 92600 KB Output is correct
37 Correct 679 ms 91976 KB Output is correct
38 Correct 700 ms 91540 KB Output is correct
39 Correct 798 ms 93564 KB Output is correct
40 Correct 864 ms 94368 KB Output is correct
41 Correct 880 ms 93416 KB Output is correct
42 Correct 816 ms 92784 KB Output is correct
43 Correct 819 ms 92312 KB Output is correct
44 Correct 805 ms 94432 KB Output is correct
45 Correct 787 ms 93076 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 380 ms 91084 KB Output is correct
2 Correct 107 ms 596 KB Output is correct
3 Correct 110 ms 2364 KB Output is correct
4 Correct 108 ms 2388 KB Output is correct
5 Correct 121 ms 2384 KB Output is correct
6 Correct 109 ms 2504 KB Output is correct
7 Correct 107 ms 2384 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 377 ms 93856 KB Output is correct
12 Correct 375 ms 92896 KB Output is correct
13 Correct 361 ms 93732 KB Output is correct
14 Correct 403 ms 93800 KB Output is correct
15 Correct 361 ms 92608 KB Output is correct
16 Correct 379 ms 93760 KB Output is correct
17 Correct 366 ms 92588 KB Output is correct
18 Correct 366 ms 93324 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 472 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 2 ms 600 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 1 ms 416 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 354 ms 90732 KB Output is correct
41 Correct 94 ms 904 KB Output is correct
42 Correct 90 ms 2376 KB Output is correct
43 Correct 73 ms 2128 KB Output is correct
44 Correct 85 ms 2388 KB Output is correct
45 Correct 85 ms 2308 KB Output is correct
46 Correct 88 ms 2532 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 401 ms 91764 KB Output is correct
51 Correct 366 ms 93268 KB Output is correct
52 Correct 366 ms 91176 KB Output is correct
53 Correct 406 ms 92440 KB Output is correct
54 Correct 383 ms 91912 KB Output is correct
55 Correct 377 ms 91900 KB Output is correct
56 Correct 349 ms 93320 KB Output is correct
57 Correct 352 ms 93524 KB Output is correct
58 Correct 305 ms 92192 KB Output is correct
59 Correct 313 ms 91872 KB Output is correct
60 Correct 318 ms 92540 KB Output is correct
61 Correct 720 ms 89540 KB Output is correct
62 Incorrect 154 ms 584 KB Output isn't correct
63 Halted 0 ms 0 KB -