oj.uz

Submission #538182

# Submission time Handle Problem Language Result Execution time Memory
538182 2022-03-16T07:34:40 Z blue Progression (NOI20_progression) C++17
83 / 100
 929 ms 71860 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
using ll = long long;
using vll = vector<ll>;
 
 
int N, Q;
vll diff;
 
 
struct Node
{
	int l, r;
 
	ll lp = 0; //lp (everything below already includes lp)
	int ns = 1; //node size
 
	bool ih = 0; //is homogenous (if homogenous, adjust everything below!)
 
	ll fv = 0; //first value
	int fs = 1; //first size
 
	ll lv = 0; //last value
	int ls = 1; //last size
 
	int ts = 1; //total size
 
	ll sm = 0; //post lp
};
 
Node singlenode(int i)
{
	return {i, i, 0, 1, 1, diff[i], 1, diff[i], 1, 1, diff[i]};
}
 
Node combine(Node& A, Node& B)
{
	Node res;
 
	res.l = A.l;
	res.r = B.r;
 
	res.lp = 0;
	res.ns = A.ns + B.ns;
	res.ih = 0;
 
	res.fv = A.fv;
	if(A.fs == A.ns && B.fv == A.fv)
		res.fs = A.fs + B.fs;
	else
		res.fs = A.fs;
 
	res.lv = B.lv;
	if(B.ls == B.ns && A.lv == B.lv)
		res.ls = A.ls + B.ls;
	else
		res.ls = B.ls;
 
	res.ts = max(A.ts, B.ts);
	if(A.lv == B.fv)
		res.ts = max(res.ts, A.ls + B.fs);
 
	res.sm = A.sm + B.sm;
 
	// cerr << "combine " << A.l << ' ' << A.r << ' ' << A.lv << ' ' << A.ls << " with " << B.l << ' ' << B.r << ' ' << B.fv << ' ' << B.fs << "\n";
	return res;
}
 
Node combine2(Node A, Node B)
{
	return combine(A, B);
}
 
void add(Node& A, ll V)
{
	A.lp += V;
	A.fv += V;
	A.lv += V;
	A.sm += V * A.ns;
}
 
void set(Node& A, ll V)
{
	A.lp = 0;
	A.ih = 1;
 
	A.fv = A.lv = V;
	A.fs = A.ls = A.ts = A.ns;
	A.sm = A.ns * V;
}
 
 
 
struct segtree
{
	Node v;
	segtree* left = NULL;
	segtree* right = NULL;
 
	segtree()
	{
		;
	}
 
	segtree(int L, int R)
	{
		if(L == R) v = singlenode(L);
		else
		{
			left = new segtree(L, (L+R)/2);
			right = new segtree((L+R)/2+1, R);
			v = combine(left->v, right->v);
		}
 
		// cerr << "Node = " << L << ' ' << R << '\n';
		// cerr << v.fv << ' ' << v.fs << "  " << v.lv << ' ' << v.ls << '\n';
		// cerr << v.ts << '\n';
	}
 
	void pushdown()
	{
		if(v.ih)
		{
			v.ih = 0;
			set(left->v, v.fv);
			set(right->v, v.fv);
		}
		else
		{
			add(left->v, v.lp);
			add(right->v, v.lp);
			v.lp = 0;
		}
	}
 
	ll rangesum(int L, int R)
	{
		if(R < v.l || v.r < L) return 0;
		else if(L <= v.l && v.r <= R)
		{
			return v.sm;
		}
		else
		{
			pushdown();
			return left->rangesum(L, R) + right->rangesum(L, R);
		}
	}
 
	Node getRange(int L, int R)
	{
		if(L <= v.l && v.r <= R) return v;
		else 
		{
			pushdown();
			if(L <= left->v.r && right->v.l <= R) return combine2(left->getRange(L, R), right->getRange(L, R));
			else if(L <= left->v.r) return left->getRange(L, R);
			else return right->getRange(L, R);
		}
	}
 
	void rangeadd(int L, int R, ll V)
	{
		if(L <= v.l && v.r <= R) add(v, V);
		else
		{
			pushdown();
			if(L <= left->v.r) left->rangeadd(L, R, V);
			if(right->v.l <= R) right->rangeadd(L, R, V);
			v = combine(left->v, right->v);
		}
	}
 
	void rangeset(int L, int R, ll V)
	{
		// cerr << "range set " << L << ' ' << R << ' ' << V << " at " << 
		if(L <= v.l && v.r <= R) set(v, V);
		else
		{
			pushdown();
			if(L <= left->v.r) left->rangeset(L, R, V);
			if(right->v.l <= R) right->rangeset(L, R, V);
			v = combine(left->v, right->v);
		}
 
		// cerr << "new range " << v.l << ' ' << v.r << " = " << v.fv << ' ' << v.lv << '\n';
 	}
};
 
 
 
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	cin >> N >> Q;
 
	vll D(1+N);
	for(int i = 1; i <= N; i++) cin >> D[i];
 
	// ll adj = D[1];
	// for(int i = 1; i <= N; i++) D[i] -= adj;
 
	if(N == 1)
	{
		for(int j = 1; j <= Q; j++)
		{
			int Z;
			cin >> Z;
 
			int u;
			if(Z <= 2) cin >> u >> u >> u >> u;
			else
			{
				cin >> u >> u;
				cout << 1 << '\n';
			}
		}
		return 0;
	}
 
	diff = vll(1+N);
	for(int i = 1; i <= N-1; i++) diff[i] = D[i+1] - D[i];
 
	segtree ST(1, N-1);
 
	// for(int i = 1; i <= N-1; i++) cerr << diff[i] << ' ';
	// 	cerr << '\n';
 
	// cerr << "done \n";
 
	ll A0 = D[1];
 
	for(int j = 1; j <= Q; j++)
	{
		// cerr << "\n\n\n\n\n\n";
		ll o;
		cin >> o;
 
		if(o == 1)
		{
			ll L, R, S, C;
			cin >> L >> R >> S >> C;
 
			if(L > 1)
				ST.rangeadd(L-1, L-1, S);
 
			if(R < N)
				ST.rangeadd(R, R, -(S + (R-L)*C));
 
			if(L < R)
				ST.rangeadd(L, R-1, C);
 
			if(L == 1) A0 += S;
		}
		else if(o == 2)
		{
			ll L, R, S, C;
			cin >> L >> R >> S >> C;
			// S -= adj;
 
			ll SL = ST.rangesum(1, L-1);
			// ll SR = ST.rangesum(1, R);
			// ll SPL = ST.rangesum(1, L-2);
 
			ll elementR = ST.rangesum(1, R-1) + A0;
 
			if(L > 1)
			{
				// cerr << "A rangeset " << L-1 << ' ' << L-1 << ' ' << S - ST.rangesum(1, L-2) << '\n';
				// ST.rangeset(L-1, L-1, S - (A0 + ST.rangesum(1, L-2)));
				// cerr << "rangesum = " << ST.rangesum(1, L-2) << '\n';
				// cerr << "set " << L-1 << " : " << S - ST.rangesum(1, L-2) << '\n';
 
				ST.rangeadd(L-1, L-1, S - (A0 + SL));
			}
 
			if(R < N)
			{
				// cerr << "right rangesum = " << ST.rangesum(1, R-1) << '\n';
				// cerr << "right diff = " << ST.rangesum(1, R-1) - (S + (R-L)*C) << '\n';
				// cerr << "rangesum = " << ST.rangesum(1, R-1) << '\n';
				// cerr << "right element = " << S+(R-L)*C << '\n';
				// ST.rangeadd(R, R, ST.rangesum(1, R-1) - (S + (R-L)*C));
 
				// cerr << "B rangeset " << R << ' ' << R << " : " << ST.rangesum(1, R) - (S + (R-L)*C) << '\n';
				// cerr << ST.rangesum(1, R) << ' ' << S+(R-L)*C << '\n';
				// ST.rangeset(R, R, A0 + ST.rangesum(1, R) - (S + (R-L)*C));
 
				// ST.rangeset(R, R, (SR - SPL));
				ST.rangeadd(R, R, -(S + (R-L)*C - elementR));
			}
 
			if(L < R)
			{
				// cerr << "ST range set " << L << ' ' << R-1 << ' ' << C << '\n';
				// ST.rangeset(L, R-1, C);

				if(N > 1000 || Q > 1000)
				{
					ST.rangeset(L, R-1, C);
				}
				else
				{
					for(int f = L; f <= R-1; f++)
						ST.rangeadd(f, f, C - ST.rangesum(f, f));	
				}

				
			}
 
			if(L == 1) A0 = S;
		}
		else if(o == 3)
		{
			int L, R;
			cin >> L >> R;
 
			if(L == R) cout << 1 << '\n';
			else
			{
				cout << ST.getRange(L, R-1).ts + 1 << '\n';
			}
		}
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 62092 KB Output is correct
2 Correct 77 ms 628 KB Output is correct
3 Correct 76 ms 636 KB Output is correct
4 Correct 78 ms 692 KB Output is correct
5 Correct 82 ms 672 KB Output is correct
6 Correct 80 ms 728 KB Output is correct
7 Correct 80 ms 572 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 173 ms 62056 KB Output is correct
12 Correct 162 ms 61980 KB Output is correct
13 Correct 159 ms 62264 KB Output is correct
14 Correct 173 ms 62288 KB Output is correct
15 Correct 160 ms 62192 KB Output is correct
16 Correct 168 ms 61860 KB Output is correct
17 Correct 192 ms 62088 KB Output is correct
18 Correct 189 ms 61948 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 468 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 28 ms 468 KB Output is correct
9 Correct 30 ms 468 KB Output is correct
10 Correct 34 ms 468 KB Output is correct
11 Correct 11 ms 468 KB Output is correct
12 Correct 31 ms 468 KB Output is correct
13 Correct 11 ms 540 KB Output is correct
14 Correct 11 ms 540 KB Output is correct
15 Correct 26 ms 468 KB Output is correct
16 Correct 32 ms 524 KB Output is correct
17 Correct 43 ms 528 KB Output is correct
18 Correct 28 ms 524 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 62384 KB Output is correct
2 Correct 94 ms 912 KB Output is correct
3 Correct 81 ms 788 KB Output is correct
4 Correct 79 ms 844 KB Output is correct
5 Correct 86 ms 872 KB Output is correct
6 Correct 85 ms 964 KB Output is correct
7 Correct 81 ms 948 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 415 ms 62152 KB Output is correct
12 Correct 327 ms 62412 KB Output is correct
13 Correct 376 ms 62088 KB Output is correct
14 Correct 373 ms 62176 KB Output is correct
15 Correct 301 ms 62308 KB Output is correct
16 Correct 389 ms 62692 KB Output is correct
17 Correct 428 ms 62728 KB Output is correct
18 Correct 382 ms 62792 KB Output is correct
19 Correct 313 ms 62068 KB Output is correct
20 Correct 307 ms 62068 KB Output is correct
21 Correct 315 ms 62048 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 61600 KB Output is correct
2 Correct 127 ms 436 KB Output is correct
3 Correct 130 ms 496 KB Output is correct
4 Correct 123 ms 480 KB Output is correct
5 Correct 131 ms 452 KB Output is correct
6 Correct 127 ms 492 KB Output is correct
7 Correct 126 ms 500 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 629 ms 61656 KB Output is correct
12 Correct 597 ms 61636 KB Output is correct
13 Correct 613 ms 61704 KB Output is correct
14 Correct 618 ms 61724 KB Output is correct
15 Correct 556 ms 61644 KB Output is correct
16 Correct 630 ms 61656 KB Output is correct
17 Correct 626 ms 61616 KB Output is correct
18 Correct 673 ms 61796 KB Output is correct
19 Correct 614 ms 61596 KB Output is correct
20 Correct 600 ms 61516 KB Output is correct
21 Correct 595 ms 61640 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 62384 KB Output is correct
2 Correct 94 ms 912 KB Output is correct
3 Correct 81 ms 788 KB Output is correct
4 Correct 79 ms 844 KB Output is correct
5 Correct 86 ms 872 KB Output is correct
6 Correct 85 ms 964 KB Output is correct
7 Correct 81 ms 948 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 415 ms 62152 KB Output is correct
12 Correct 327 ms 62412 KB Output is correct
13 Correct 376 ms 62088 KB Output is correct
14 Correct 373 ms 62176 KB Output is correct
15 Correct 301 ms 62308 KB Output is correct
16 Correct 389 ms 62692 KB Output is correct
17 Correct 428 ms 62728 KB Output is correct
18 Correct 382 ms 62792 KB Output is correct
19 Correct 313 ms 62068 KB Output is correct
20 Correct 307 ms 62068 KB Output is correct
21 Correct 315 ms 62048 KB Output is correct
22 Correct 767 ms 61672 KB Output is correct
23 Correct 126 ms 556 KB Output is correct
24 Correct 124 ms 584 KB Output is correct
25 Correct 122 ms 524 KB Output is correct
26 Correct 133 ms 480 KB Output is correct
27 Correct 131 ms 584 KB Output is correct
28 Correct 132 ms 484 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 811 ms 61868 KB Output is correct
33 Correct 738 ms 61656 KB Output is correct
34 Correct 780 ms 61704 KB Output is correct
35 Correct 833 ms 61848 KB Output is correct
36 Correct 635 ms 61940 KB Output is correct
37 Correct 635 ms 61952 KB Output is correct
38 Correct 664 ms 62072 KB Output is correct
39 Correct 749 ms 61800 KB Output is correct
40 Correct 772 ms 61964 KB Output is correct
41 Correct 798 ms 62016 KB Output is correct
42 Correct 800 ms 61772 KB Output is correct
43 Correct 727 ms 61644 KB Output is correct
44 Correct 730 ms 61820 KB Output is correct
45 Correct 718 ms 61644 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 62092 KB Output is correct
2 Correct 77 ms 628 KB Output is correct
3 Correct 76 ms 636 KB Output is correct
4 Correct 78 ms 692 KB Output is correct
5 Correct 82 ms 672 KB Output is correct
6 Correct 80 ms 728 KB Output is correct
7 Correct 80 ms 572 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 173 ms 62056 KB Output is correct
12 Correct 162 ms 61980 KB Output is correct
13 Correct 159 ms 62264 KB Output is correct
14 Correct 173 ms 62288 KB Output is correct
15 Correct 160 ms 62192 KB Output is correct
16 Correct 168 ms 61860 KB Output is correct
17 Correct 192 ms 62088 KB Output is correct
18 Correct 189 ms 61948 KB Output is correct
19 Correct 29 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 28 ms 468 KB Output is correct
27 Correct 30 ms 468 KB Output is correct
28 Correct 34 ms 468 KB Output is correct
29 Correct 11 ms 468 KB Output is correct
30 Correct 31 ms 468 KB Output is correct
31 Correct 11 ms 540 KB Output is correct
32 Correct 11 ms 540 KB Output is correct
33 Correct 26 ms 468 KB Output is correct
34 Correct 32 ms 524 KB Output is correct
35 Correct 43 ms 528 KB Output is correct
36 Correct 28 ms 524 KB Output is correct
37 Correct 2 ms 212 KB Output is correct
38 Correct 2 ms 212 KB Output is correct
39 Correct 2 ms 212 KB Output is correct
40 Correct 329 ms 62384 KB Output is correct
41 Correct 94 ms 912 KB Output is correct
42 Correct 81 ms 788 KB Output is correct
43 Correct 79 ms 844 KB Output is correct
44 Correct 86 ms 872 KB Output is correct
45 Correct 85 ms 964 KB Output is correct
46 Correct 81 ms 948 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 415 ms 62152 KB Output is correct
51 Correct 327 ms 62412 KB Output is correct
52 Correct 376 ms 62088 KB Output is correct
53 Correct 373 ms 62176 KB Output is correct
54 Correct 301 ms 62308 KB Output is correct
55 Correct 389 ms 62692 KB Output is correct
56 Correct 428 ms 62728 KB Output is correct
57 Correct 382 ms 62792 KB Output is correct
58 Correct 313 ms 62068 KB Output is correct
59 Correct 307 ms 62068 KB Output is correct
60 Correct 315 ms 62048 KB Output is correct
61 Correct 613 ms 61600 KB Output is correct
62 Correct 127 ms 436 KB Output is correct
63 Correct 130 ms 496 KB Output is correct
64 Correct 123 ms 480 KB Output is correct
65 Correct 131 ms 452 KB Output is correct
66 Correct 127 ms 492 KB Output is correct
67 Correct 126 ms 500 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 629 ms 61656 KB Output is correct
72 Correct 597 ms 61636 KB Output is correct
73 Correct 613 ms 61704 KB Output is correct
74 Correct 618 ms 61724 KB Output is correct
75 Correct 556 ms 61644 KB Output is correct
76 Correct 630 ms 61656 KB Output is correct
77 Correct 626 ms 61616 KB Output is correct
78 Correct 673 ms 61796 KB Output is correct
79 Correct 614 ms 61596 KB Output is correct
80 Correct 600 ms 61516 KB Output is correct
81 Correct 595 ms 61640 KB Output is correct
82 Correct 767 ms 61672 KB Output is correct
83 Correct 126 ms 556 KB Output is correct
84 Correct 124 ms 584 KB Output is correct
85 Correct 122 ms 524 KB Output is correct
86 Correct 133 ms 480 KB Output is correct
87 Correct 131 ms 584 KB Output is correct
88 Correct 132 ms 484 KB Output is correct
89 Correct 1 ms 212 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 811 ms 61868 KB Output is correct
93 Correct 738 ms 61656 KB Output is correct
94 Correct 780 ms 61704 KB Output is correct
95 Correct 833 ms 61848 KB Output is correct
96 Correct 635 ms 61940 KB Output is correct
97 Correct 635 ms 61952 KB Output is correct
98 Correct 664 ms 62072 KB Output is correct
99 Correct 749 ms 61800 KB Output is correct
100 Correct 772 ms 61964 KB Output is correct
101 Correct 798 ms 62016 KB Output is correct
102 Correct 800 ms 61772 KB Output is correct
103 Correct 727 ms 61644 KB Output is correct
104 Correct 730 ms 61820 KB Output is correct
105 Correct 718 ms 61644 KB Output is correct
106 Incorrect 929 ms 71860 KB Output isn't correct
107 Halted 0 ms 0 KB -