oj.uz

Submission #939864

# Submission time Handle Problem Language Result Execution time Memory
939864 2024-03-06T21:19:41 Z Litusiano Progression (NOI20_progression) C++17
57 / 100
 817 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};
			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;
	}
	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) 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.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{
			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:173:6: warning: unused variable 'val' [-Wunused-variable]
  173 |  int val = v[0];
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 90256 KB Output is correct
2 Correct 98 ms 564 KB Output is correct
3 Correct 101 ms 596 KB Output is correct
4 Correct 104 ms 848 KB Output is correct
5 Correct 99 ms 596 KB Output is correct
6 Correct 101 ms 760 KB Output is correct
7 Correct 98 ms 800 KB Output is correct
8 Correct 0 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 323 ms 90304 KB Output is correct
12 Correct 353 ms 90052 KB Output is correct
13 Correct 323 ms 90988 KB Output is correct
14 Correct 323 ms 90824 KB Output is correct
15 Correct 327 ms 90064 KB Output is correct
16 Correct 324 ms 90312 KB Output is correct
17 Correct 327 ms 90308 KB Output is correct
18 Correct 321 ms 89540 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 90576 KB Output is correct
2 Correct 88 ms 856 KB Output is correct
3 Correct 85 ms 864 KB Output is correct
4 Correct 69 ms 848 KB Output is correct
5 Correct 80 ms 944 KB Output is correct
6 Correct 81 ms 1108 KB Output is correct
7 Correct 82 ms 1052 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 305 ms 90376 KB Output is correct
12 Correct 316 ms 91080 KB Output is correct
13 Correct 303 ms 89808 KB Output is correct
14 Correct 344 ms 89800 KB Output is correct
15 Correct 328 ms 91332 KB Output is correct
16 Correct 298 ms 89716 KB Output is correct
17 Correct 307 ms 91272 KB Output is correct
18 Correct 307 ms 90252 KB Output is correct
19 Correct 263 ms 90064 KB Output is correct
20 Correct 257 ms 89800 KB Output is correct
21 Correct 262 ms 89540 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 644 ms 90824 KB Output is correct
2 Incorrect 143 ms 884 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 321 ms 90576 KB Output is correct
2 Correct 88 ms 856 KB Output is correct
3 Correct 85 ms 864 KB Output is correct
4 Correct 69 ms 848 KB Output is correct
5 Correct 80 ms 944 KB Output is correct
6 Correct 81 ms 1108 KB Output is correct
7 Correct 82 ms 1052 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 305 ms 90376 KB Output is correct
12 Correct 316 ms 91080 KB Output is correct
13 Correct 303 ms 89808 KB Output is correct
14 Correct 344 ms 89800 KB Output is correct
15 Correct 328 ms 91332 KB Output is correct
16 Correct 298 ms 89716 KB Output is correct
17 Correct 307 ms 91272 KB Output is correct
18 Correct 307 ms 90252 KB Output is correct
19 Correct 263 ms 90064 KB Output is correct
20 Correct 257 ms 89800 KB Output is correct
21 Correct 262 ms 89540 KB Output is correct
22 Correct 785 ms 91256 KB Output is correct
23 Correct 138 ms 740 KB Output is correct
24 Correct 133 ms 596 KB Output is correct
25 Correct 131 ms 716 KB Output is correct
26 Correct 142 ms 852 KB Output is correct
27 Correct 136 ms 532 KB Output is correct
28 Correct 136 ms 544 KB Output is correct
29 Correct 1 ms 500 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 812 ms 90056 KB Output is correct
33 Correct 743 ms 89808 KB Output is correct
34 Correct 770 ms 89544 KB Output is correct
35 Correct 796 ms 89552 KB Output is correct
36 Correct 657 ms 90572 KB Output is correct
37 Correct 650 ms 91076 KB Output is correct
38 Correct 645 ms 90312 KB Output is correct
39 Correct 800 ms 91112 KB Output is correct
40 Correct 796 ms 90308 KB Output is correct
41 Correct 793 ms 90480 KB Output is correct
42 Correct 817 ms 90572 KB Output is correct
43 Correct 802 ms 90476 KB Output is correct
44 Correct 807 ms 89876 KB Output is correct
45 Correct 805 ms 90824 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 90256 KB Output is correct
2 Correct 98 ms 564 KB Output is correct
3 Correct 101 ms 596 KB Output is correct
4 Correct 104 ms 848 KB Output is correct
5 Correct 99 ms 596 KB Output is correct
6 Correct 101 ms 760 KB Output is correct
7 Correct 98 ms 800 KB Output is correct
8 Correct 0 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 323 ms 90304 KB Output is correct
12 Correct 353 ms 90052 KB Output is correct
13 Correct 323 ms 90988 KB Output is correct
14 Correct 323 ms 90824 KB Output is correct
15 Correct 327 ms 90064 KB Output is correct
16 Correct 324 ms 90312 KB Output is correct
17 Correct 327 ms 90308 KB Output is correct
18 Correct 321 ms 89540 KB Output is correct
19 Incorrect 2 ms 600 KB Output isn't correct
20 Halted 0 ms 0 KB -