oj.uz

답안 #939837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939837 2024-03-06T19:44:18 Z Litusiano Progression (NOI20_progression) C++17
57 / 100
 811 ms 94388 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};
			add(2*k, lazy[k].second, l,m);
			if(lazy[2*k+1].first == 1) lazy[2*k+1] = {0,0};
			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;
	}
	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) lazy[k] = {0,0};
				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];
	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.query(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 UPDATE: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query(i,i)<<" ";
			// }
			// cout<<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 UPDATE: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query(i,i)<<" ";
			// }
			// cout<<endl;
			if(l) sum+=seg.sum(0,l-1);
			int val = s + (r-l)*s;
			int sum1 = v[0];
			if(r) sum1+=seg.sum(0,r-1);
			if(l == 0) v[0] = s;
			if(l) seg.update(l-1, l-1, 0, +(s-sum));
			if(r < n) seg.update(r,r,0, -(val-sum1));
			seg.update(l,r-1,1,c);
			// cout<<"AFTER UPDATE: ";
			// for(int i = 0; i<n-1; i++){
			// 	cout<<seg.query(i,i)<<" ";
			// }
			// cout<<endl;
		}
		else{
			int l,r; cin>>l>>r; l--; r--;
			if(l == r){
				cout<<1<<endl; continue;
			}
			// cerr<<endl<<l<<" "<<r-1<<endl;
			cout<<seg.query(l,r-1)+1<<endl;
		}
	}
}

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 332 ms 93228 KB Output is correct
2 Correct 96 ms 2364 KB Output is correct
3 Correct 97 ms 2396 KB Output is correct
4 Correct 97 ms 2388 KB Output is correct
5 Correct 96 ms 2384 KB Output is correct
6 Correct 101 ms 2724 KB Output is correct
7 Correct 96 ms 2336 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 330 ms 94388 KB Output is correct
12 Correct 330 ms 93080 KB Output is correct
13 Correct 329 ms 93768 KB Output is correct
14 Correct 326 ms 94156 KB Output is correct
15 Correct 334 ms 93756 KB Output is correct
16 Correct 325 ms 92312 KB Output is correct
17 Correct 328 ms 93184 KB Output is correct
18 Correct 326 ms 92308 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 91676 KB Output is correct
2 Correct 87 ms 2384 KB Output is correct
3 Correct 84 ms 2508 KB Output is correct
4 Correct 69 ms 2372 KB Output is correct
5 Correct 81 ms 2640 KB Output is correct
6 Correct 82 ms 2624 KB Output is correct
7 Correct 80 ms 2632 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 306 ms 92764 KB Output is correct
12 Correct 320 ms 92756 KB Output is correct
13 Correct 300 ms 91952 KB Output is correct
14 Correct 301 ms 91400 KB Output is correct
15 Correct 314 ms 91608 KB Output is correct
16 Correct 304 ms 92736 KB Output is correct
17 Correct 338 ms 93548 KB Output is correct
18 Correct 292 ms 92652 KB Output is correct
19 Correct 255 ms 92664 KB Output is correct
20 Correct 262 ms 93492 KB Output is correct
21 Correct 254 ms 92868 KB Output is correct

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 629 ms 93784 KB Output is correct
2 Incorrect 149 ms 2408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 91676 KB Output is correct
2 Correct 87 ms 2384 KB Output is correct
3 Correct 84 ms 2508 KB Output is correct
4 Correct 69 ms 2372 KB Output is correct
5 Correct 81 ms 2640 KB Output is correct
6 Correct 82 ms 2624 KB Output is correct
7 Correct 80 ms 2632 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 306 ms 92764 KB Output is correct
12 Correct 320 ms 92756 KB Output is correct
13 Correct 300 ms 91952 KB Output is correct
14 Correct 301 ms 91400 KB Output is correct
15 Correct 314 ms 91608 KB Output is correct
16 Correct 304 ms 92736 KB Output is correct
17 Correct 338 ms 93548 KB Output is correct
18 Correct 292 ms 92652 KB Output is correct
19 Correct 255 ms 92664 KB Output is correct
20 Correct 262 ms 93492 KB Output is correct
21 Correct 254 ms 92868 KB Output is correct
22 Correct 775 ms 94368 KB Output is correct
23 Correct 141 ms 2888 KB Output is correct
24 Correct 134 ms 2772 KB Output is correct
25 Correct 140 ms 2644 KB Output is correct
26 Correct 139 ms 2784 KB Output is correct
27 Correct 141 ms 2628 KB Output is correct
28 Correct 138 ms 2704 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 774 ms 91452 KB Output is correct
33 Correct 764 ms 92984 KB Output is correct
34 Correct 804 ms 92320 KB Output is correct
35 Correct 811 ms 92744 KB Output is correct
36 Correct 637 ms 92900 KB Output is correct
37 Correct 638 ms 92084 KB Output is correct
38 Correct 625 ms 91768 KB Output is correct
39 Correct 745 ms 93080 KB Output is correct
40 Correct 786 ms 92800 KB Output is correct
41 Correct 786 ms 93848 KB Output is correct
42 Correct 766 ms 92892 KB Output is correct
43 Correct 748 ms 92444 KB Output is correct
44 Correct 754 ms 93560 KB Output is correct
45 Correct 745 ms 92564 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 332 ms 93228 KB Output is correct
2 Correct 96 ms 2364 KB Output is correct
3 Correct 97 ms 2396 KB Output is correct
4 Correct 97 ms 2388 KB Output is correct
5 Correct 96 ms 2384 KB Output is correct
6 Correct 101 ms 2724 KB Output is correct
7 Correct 96 ms 2336 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 330 ms 94388 KB Output is correct
12 Correct 330 ms 93080 KB Output is correct
13 Correct 329 ms 93768 KB Output is correct
14 Correct 326 ms 94156 KB Output is correct
15 Correct 334 ms 93756 KB Output is correct
16 Correct 325 ms 92312 KB Output is correct
17 Correct 328 ms 93184 KB Output is correct
18 Correct 326 ms 92308 KB Output is correct
19 Incorrect 3 ms 600 KB Output isn't correct
20 Halted 0 ms 0 KB -