oj.uz

Submission #405305

# Submission time Handle Problem Language Result Execution time Memory
405305 2021-05-16T07:46:54 Z oolimry Progression (NOI20_progression) C++17
35 / 100
 956 ms 63660 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) x.size())
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << ", " << #y << " is " << y << endl;
#define show3(x, y, z) cerr << #x << " is " << x << ", " << #y << " is " << y << ", " << #z << " is " << z << endl;
typedef long long lint;
typedef pair<lint, lint> ii;

struct thing{
	lint leftval, rightval, leftcnt, rightcnt, best, full;
};

inline thing single(int u){
	return {u,u,1,1,1,1};
}

inline thing merge(thing L, thing R){
	thing res;
	if(L.full and R.full and L.rightval == R.leftval){
		return {L.leftval, R.rightval, L.leftcnt+R.leftcnt, L.rightcnt+R.rightcnt, L.best+R.best, 1};
	}
	
	res.leftval = L.leftval, res.rightval = R.rightval;
	res.leftcnt = L.leftcnt, res.rightcnt = R.rightcnt;
	res.best = max(L.best, R.best);
	res.full = 0;
	
	if(L.rightval == R.leftval){
		res.best = max(res.best, L.rightcnt + R.leftcnt);
		if(L.full) res.leftcnt += R.leftcnt;
		else if(R.full) res.rightcnt += L.rightcnt;
		res.best = max(res.best, res.leftcnt);
		res.best = max(res.best, res.rightcnt);
	}
	
	return res;
}

lint arr[300005];
struct node{
	int s, e, m;
	thing val;
	lint add = 0;
	node *l, *r;
	
	node(int S, int E){
		s = S, e = E, m = (s+e)/2;
		if(s == e) val = single(arr[s]);
		else{
			l = new node(s,m);
			r = new node(m+1,e);
			val = merge(l->val, r->val);
		}	
	}
	
	void applyadd(lint A){
		val.leftval += A;
		val.rightval += A;
		add += A;
	}
	
	void push(){
		if(add != 0 and s != e){
			l->applyadd(add);
			r->applyadd(add);
			add = 0;
		}
	}
	
	thing query(int S, int E){
		push();
		if(s == S and E == e) return val;
		else if(E <= m) return l->query(S,E);
		else if(S >= m+1) return r->query(S,E);
		else return merge(l->query(S,m), r->query(m+1,E));
	} 
	
	void updateadd(int S, int E, lint A){
		push();
		if(s == S and E == e){
			applyadd(A);
		}
		else{
			if(E <= m) l->updateadd(S,E,A);
			else if(S >= m+1) r->updateadd(S,E,A);
			else l->updateadd(S,m,A), r->updateadd(m+1,E,A);
			val = merge(l->val, r->val);
		}
	}
} *root;


int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int n, Q; cin >> n >> Q;
	lint x; cin >> x;
	for(int i = 2;i <= n;i++){
		lint y; cin >> y;
		arr[i-1] = y-x;
		x = y;
	}
	
	if(n != 1) root = new node(1,n-1);
	
	while(Q--){
		int t, l, r; cin >> t >> l >> r;
		if(t == 3){
			if(l == r) cout << "1\n";
			else cout << root->query(l,r-1).best+1 << '\n';
		}
		else{
			if(n == 1) continue;
			lint a, b; cin >> a >> b;
			if(t == 1){
				if(l != r) root->updateadd(l,r-1,b);
				if(l != 1) root->updateadd(l-1,l-1,a);
				if(r != n) root->updateadd(r,r,-((r-l)*b+a));
			}
		}
	}
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 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 340 ms 60012 KB Output is correct
2 Correct 99 ms 796 KB Output is correct
3 Correct 97 ms 992 KB Output is correct
4 Correct 92 ms 836 KB Output is correct
5 Correct 95 ms 996 KB Output is correct
6 Correct 101 ms 880 KB Output is correct
7 Correct 96 ms 960 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 411 ms 59716 KB Output is correct
12 Correct 375 ms 59992 KB Output is correct
13 Correct 432 ms 59732 KB Output is correct
14 Correct 415 ms 59764 KB Output is correct
15 Correct 350 ms 59980 KB Output is correct
16 Correct 409 ms 60320 KB Output is correct
17 Correct 450 ms 60388 KB Output is correct
18 Correct 402 ms 60472 KB Output is correct
19 Correct 355 ms 59684 KB Output is correct
20 Correct 383 ms 59740 KB Output is correct
21 Correct 351 ms 59680 KB Output is correct

Subtask #4
0 / 11.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 60012 KB Output is correct
2 Correct 99 ms 796 KB Output is correct
3 Correct 97 ms 992 KB Output is correct
4 Correct 92 ms 836 KB Output is correct
5 Correct 95 ms 996 KB Output is correct
6 Correct 101 ms 880 KB Output is correct
7 Correct 96 ms 960 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 411 ms 59716 KB Output is correct
12 Correct 375 ms 59992 KB Output is correct
13 Correct 432 ms 59732 KB Output is correct
14 Correct 415 ms 59764 KB Output is correct
15 Correct 350 ms 59980 KB Output is correct
16 Correct 409 ms 60320 KB Output is correct
17 Correct 450 ms 60388 KB Output is correct
18 Correct 402 ms 60472 KB Output is correct
19 Correct 355 ms 59684 KB Output is correct
20 Correct 383 ms 59740 KB Output is correct
21 Correct 351 ms 59680 KB Output is correct
22 Correct 956 ms 62948 KB Output is correct
23 Correct 167 ms 3536 KB Output is correct
24 Correct 148 ms 3516 KB Output is correct
25 Correct 146 ms 3640 KB Output is correct
26 Correct 149 ms 3492 KB Output is correct
27 Correct 150 ms 3524 KB Output is correct
28 Correct 156 ms 3672 KB Output is correct
29 Incorrect 1 ms 332 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

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