oj.uz

Submission #939880

# Submission time Handle Problem Language Result Execution time Memory
939880 2024-03-06T22:27:57 Z Litusiano Progression (NOI20_progression) C++17
57 / 100
 886 ms 91332 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; bool ok1=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){
			ok1=1;
			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 && seg.query1(l,r-1) == -4 && ok1){
					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

# Verdict Execution time Memory Grader output
1 Correct 372 ms 90564 KB Output is correct
2 Correct 104 ms 568 KB Output is correct
3 Correct 106 ms 744 KB Output is correct
4 Correct 108 ms 572 KB Output is correct
5 Correct 104 ms 768 KB Output is correct
6 Correct 104 ms 680 KB Output is correct
7 Correct 104 ms 568 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 365 ms 91084 KB Output is correct
12 Correct 365 ms 91108 KB Output is correct
13 Correct 369 ms 90380 KB Output is correct
14 Correct 361 ms 89612 KB Output is correct
15 Correct 354 ms 89636 KB Output is correct
16 Correct 358 ms 90832 KB Output is correct
17 Correct 356 ms 89804 KB Output is correct
18 Correct 358 ms 90564 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 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 348 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 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 90288 KB Output is correct
2 Correct 93 ms 1140 KB Output is correct
3 Correct 86 ms 852 KB Output is correct
4 Correct 71 ms 848 KB Output is correct
5 Correct 80 ms 1076 KB Output is correct
6 Correct 105 ms 1012 KB Output is correct
7 Correct 80 ms 1104 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 341 ms 90996 KB Output is correct
12 Correct 346 ms 91332 KB Output is correct
13 Correct 334 ms 90064 KB Output is correct
14 Correct 368 ms 90564 KB Output is correct
15 Correct 375 ms 91080 KB Output is correct
16 Correct 326 ms 91088 KB Output is correct
17 Correct 337 ms 91076 KB Output is correct
18 Correct 334 ms 91080 KB Output is correct
19 Correct 310 ms 91080 KB Output is correct
20 Correct 285 ms 90776 KB Output is correct
21 Correct 287 ms 90564 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 719 ms 91076 KB Output is correct
2 Incorrect 161 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 90288 KB Output is correct
2 Correct 93 ms 1140 KB Output is correct
3 Correct 86 ms 852 KB Output is correct
4 Correct 71 ms 848 KB Output is correct
5 Correct 80 ms 1076 KB Output is correct
6 Correct 105 ms 1012 KB Output is correct
7 Correct 80 ms 1104 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 341 ms 90996 KB Output is correct
12 Correct 346 ms 91332 KB Output is correct
13 Correct 334 ms 90064 KB Output is correct
14 Correct 368 ms 90564 KB Output is correct
15 Correct 375 ms 91080 KB Output is correct
16 Correct 326 ms 91088 KB Output is correct
17 Correct 337 ms 91076 KB Output is correct
18 Correct 334 ms 91080 KB Output is correct
19 Correct 310 ms 91080 KB Output is correct
20 Correct 285 ms 90776 KB Output is correct
21 Correct 287 ms 90564 KB Output is correct
22 Correct 812 ms 91168 KB Output is correct
23 Correct 140 ms 596 KB Output is correct
24 Correct 136 ms 652 KB Output is correct
25 Correct 143 ms 848 KB Output is correct
26 Correct 140 ms 604 KB Output is correct
27 Correct 139 ms 736 KB Output is correct
28 Correct 139 ms 592 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 810 ms 90488 KB Output is correct
33 Correct 773 ms 91076 KB Output is correct
34 Correct 886 ms 90320 KB Output is correct
35 Correct 872 ms 90728 KB Output is correct
36 Correct 692 ms 89792 KB Output is correct
37 Correct 678 ms 90312 KB Output is correct
38 Correct 693 ms 90060 KB Output is correct
39 Correct 830 ms 90056 KB Output is correct
40 Correct 842 ms 90564 KB Output is correct
41 Correct 841 ms 90564 KB Output is correct
42 Correct 839 ms 89536 KB Output is correct
43 Correct 869 ms 89660 KB Output is correct
44 Correct 838 ms 91332 KB Output is correct
45 Correct 829 ms 91248 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 90564 KB Output is correct
2 Correct 104 ms 568 KB Output is correct
3 Correct 106 ms 744 KB Output is correct
4 Correct 108 ms 572 KB Output is correct
5 Correct 104 ms 768 KB Output is correct
6 Correct 104 ms 680 KB Output is correct
7 Correct 104 ms 568 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 365 ms 91084 KB Output is correct
12 Correct 365 ms 91108 KB Output is correct
13 Correct 369 ms 90380 KB Output is correct
14 Correct 361 ms 89612 KB Output is correct
15 Correct 354 ms 89636 KB Output is correct
16 Correct 358 ms 90832 KB Output is correct
17 Correct 356 ms 89804 KB Output is correct
18 Correct 358 ms 90564 KB Output is correct
19 Correct 2 ms 600 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 348 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 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 3 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Incorrect 1 ms 348 KB Output isn't correct
38 Halted 0 ms 0 KB -