oj.uz

답안 #538192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538192 2022-03-16T07:45:09 Z blue Progression (NOI20_progression) C++17
100 / 100
 1209 ms 66976 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);
			
			v = combine(left->v, right->v);

		}
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 178 ms 62012 KB Output is correct
2 Correct 85 ms 528 KB Output is correct
3 Correct 91 ms 548 KB Output is correct
4 Correct 79 ms 596 KB Output is correct
5 Correct 90 ms 756 KB Output is correct
6 Correct 80 ms 640 KB Output is correct
7 Correct 79 ms 600 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 166 ms 62020 KB Output is correct
12 Correct 179 ms 61924 KB Output is correct
13 Correct 169 ms 62316 KB Output is correct
14 Correct 175 ms 62212 KB Output is correct
15 Correct 183 ms 62240 KB Output is correct
16 Correct 166 ms 61932 KB Output is correct
17 Correct 162 ms 61908 KB Output is correct
18 Correct 173 ms 61876 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 548 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 556 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 2 ms 456 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 62384 KB Output is correct
2 Correct 91 ms 956 KB Output is correct
3 Correct 84 ms 1020 KB Output is correct
4 Correct 91 ms 1008 KB Output is correct
5 Correct 84 ms 1128 KB Output is correct
6 Correct 101 ms 1172 KB Output is correct
7 Correct 106 ms 1076 KB Output is correct
8 Correct 1 ms 240 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 419 ms 62388 KB Output is correct
12 Correct 335 ms 62536 KB Output is correct
13 Correct 438 ms 62320 KB Output is correct
14 Correct 419 ms 62232 KB Output is correct
15 Correct 357 ms 62460 KB Output is correct
16 Correct 416 ms 62800 KB Output is correct
17 Correct 467 ms 62856 KB Output is correct
18 Correct 450 ms 62836 KB Output is correct
19 Correct 346 ms 62232 KB Output is correct
20 Correct 358 ms 62136 KB Output is correct
21 Correct 339 ms 62056 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 677 ms 61620 KB Output is correct
2 Correct 142 ms 712 KB Output is correct
3 Correct 139 ms 620 KB Output is correct
4 Correct 146 ms 556 KB Output is correct
5 Correct 133 ms 604 KB Output is correct
6 Correct 134 ms 652 KB Output is correct
7 Correct 152 ms 604 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 714 ms 61660 KB Output is correct
12 Correct 684 ms 61772 KB Output is correct
13 Correct 688 ms 61644 KB Output is correct
14 Correct 702 ms 61692 KB Output is correct
15 Correct 698 ms 61460 KB Output is correct
16 Correct 746 ms 61636 KB Output is correct
17 Correct 729 ms 61684 KB Output is correct
18 Correct 755 ms 61856 KB Output is correct
19 Correct 688 ms 61700 KB Output is correct
20 Correct 704 ms 61556 KB Output is correct
21 Correct 713 ms 61500 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 62384 KB Output is correct
2 Correct 91 ms 956 KB Output is correct
3 Correct 84 ms 1020 KB Output is correct
4 Correct 91 ms 1008 KB Output is correct
5 Correct 84 ms 1128 KB Output is correct
6 Correct 101 ms 1172 KB Output is correct
7 Correct 106 ms 1076 KB Output is correct
8 Correct 1 ms 240 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 419 ms 62388 KB Output is correct
12 Correct 335 ms 62536 KB Output is correct
13 Correct 438 ms 62320 KB Output is correct
14 Correct 419 ms 62232 KB Output is correct
15 Correct 357 ms 62460 KB Output is correct
16 Correct 416 ms 62800 KB Output is correct
17 Correct 467 ms 62856 KB Output is correct
18 Correct 450 ms 62836 KB Output is correct
19 Correct 346 ms 62232 KB Output is correct
20 Correct 358 ms 62136 KB Output is correct
21 Correct 339 ms 62056 KB Output is correct
22 Correct 855 ms 61660 KB Output is correct
23 Correct 139 ms 492 KB Output is correct
24 Correct 129 ms 488 KB Output is correct
25 Correct 125 ms 588 KB Output is correct
26 Correct 134 ms 500 KB Output is correct
27 Correct 140 ms 584 KB Output is correct
28 Correct 133 ms 588 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 871 ms 61776 KB Output is correct
33 Correct 809 ms 61732 KB Output is correct
34 Correct 833 ms 61736 KB Output is correct
35 Correct 835 ms 61984 KB Output is correct
36 Correct 673 ms 62012 KB Output is correct
37 Correct 691 ms 62000 KB Output is correct
38 Correct 727 ms 62140 KB Output is correct
39 Correct 868 ms 61856 KB Output is correct
40 Correct 973 ms 61784 KB Output is correct
41 Correct 863 ms 61804 KB Output is correct
42 Correct 965 ms 61816 KB Output is correct
43 Correct 747 ms 61808 KB Output is correct
44 Correct 873 ms 61772 KB Output is correct
45 Correct 730 ms 61644 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 178 ms 62012 KB Output is correct
2 Correct 85 ms 528 KB Output is correct
3 Correct 91 ms 548 KB Output is correct
4 Correct 79 ms 596 KB Output is correct
5 Correct 90 ms 756 KB Output is correct
6 Correct 80 ms 640 KB Output is correct
7 Correct 79 ms 600 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 166 ms 62020 KB Output is correct
12 Correct 179 ms 61924 KB Output is correct
13 Correct 169 ms 62316 KB Output is correct
14 Correct 175 ms 62212 KB Output is correct
15 Correct 183 ms 62240 KB Output is correct
16 Correct 166 ms 61932 KB Output is correct
17 Correct 162 ms 61908 KB Output is correct
18 Correct 173 ms 61876 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 548 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 3 ms 556 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 456 KB Output is correct
37 Correct 2 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 372 ms 62384 KB Output is correct
41 Correct 91 ms 956 KB Output is correct
42 Correct 84 ms 1020 KB Output is correct
43 Correct 91 ms 1008 KB Output is correct
44 Correct 84 ms 1128 KB Output is correct
45 Correct 101 ms 1172 KB Output is correct
46 Correct 106 ms 1076 KB Output is correct
47 Correct 1 ms 240 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 419 ms 62388 KB Output is correct
51 Correct 335 ms 62536 KB Output is correct
52 Correct 438 ms 62320 KB Output is correct
53 Correct 419 ms 62232 KB Output is correct
54 Correct 357 ms 62460 KB Output is correct
55 Correct 416 ms 62800 KB Output is correct
56 Correct 467 ms 62856 KB Output is correct
57 Correct 450 ms 62836 KB Output is correct
58 Correct 346 ms 62232 KB Output is correct
59 Correct 358 ms 62136 KB Output is correct
60 Correct 339 ms 62056 KB Output is correct
61 Correct 677 ms 61620 KB Output is correct
62 Correct 142 ms 712 KB Output is correct
63 Correct 139 ms 620 KB Output is correct
64 Correct 146 ms 556 KB Output is correct
65 Correct 133 ms 604 KB Output is correct
66 Correct 134 ms 652 KB Output is correct
67 Correct 152 ms 604 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 714 ms 61660 KB Output is correct
72 Correct 684 ms 61772 KB Output is correct
73 Correct 688 ms 61644 KB Output is correct
74 Correct 702 ms 61692 KB Output is correct
75 Correct 698 ms 61460 KB Output is correct
76 Correct 746 ms 61636 KB Output is correct
77 Correct 729 ms 61684 KB Output is correct
78 Correct 755 ms 61856 KB Output is correct
79 Correct 688 ms 61700 KB Output is correct
80 Correct 704 ms 61556 KB Output is correct
81 Correct 713 ms 61500 KB Output is correct
82 Correct 855 ms 61660 KB Output is correct
83 Correct 139 ms 492 KB Output is correct
84 Correct 129 ms 488 KB Output is correct
85 Correct 125 ms 588 KB Output is correct
86 Correct 134 ms 500 KB Output is correct
87 Correct 140 ms 584 KB Output is correct
88 Correct 133 ms 588 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 871 ms 61776 KB Output is correct
93 Correct 809 ms 61732 KB Output is correct
94 Correct 833 ms 61736 KB Output is correct
95 Correct 835 ms 61984 KB Output is correct
96 Correct 673 ms 62012 KB Output is correct
97 Correct 691 ms 62000 KB Output is correct
98 Correct 727 ms 62140 KB Output is correct
99 Correct 868 ms 61856 KB Output is correct
100 Correct 973 ms 61784 KB Output is correct
101 Correct 863 ms 61804 KB Output is correct
102 Correct 965 ms 61816 KB Output is correct
103 Correct 747 ms 61808 KB Output is correct
104 Correct 873 ms 61772 KB Output is correct
105 Correct 730 ms 61644 KB Output is correct
106 Correct 1098 ms 62072 KB Output is correct
107 Correct 168 ms 3644 KB Output is correct
108 Correct 166 ms 3764 KB Output is correct
109 Correct 171 ms 3732 KB Output is correct
110 Correct 1 ms 328 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 1 ms 332 KB Output is correct
113 Correct 783 ms 65852 KB Output is correct
114 Correct 812 ms 65912 KB Output is correct
115 Correct 788 ms 65804 KB Output is correct
116 Correct 763 ms 65740 KB Output is correct
117 Correct 995 ms 66384 KB Output is correct
118 Correct 736 ms 65904 KB Output is correct
119 Correct 749 ms 65756 KB Output is correct
120 Correct 392 ms 66904 KB Output is correct
121 Correct 415 ms 66976 KB Output is correct
122 Correct 399 ms 66920 KB Output is correct
123 Correct 331 ms 66140 KB Output is correct
124 Correct 311 ms 66128 KB Output is correct
125 Correct 314 ms 65992 KB Output is correct
126 Correct 993 ms 65700 KB Output is correct
127 Correct 972 ms 65728 KB Output is correct
128 Correct 1004 ms 65280 KB Output is correct
129 Correct 963 ms 64832 KB Output is correct
130 Correct 717 ms 65332 KB Output is correct
131 Correct 760 ms 64828 KB Output is correct
132 Correct 770 ms 64660 KB Output is correct
133 Correct 1149 ms 63872 KB Output is correct
134 Correct 1133 ms 63332 KB Output is correct
135 Correct 1209 ms 63132 KB Output is correct
136 Correct 185 ms 1588 KB Output is correct
137 Correct 176 ms 1584 KB Output is correct
138 Correct 174 ms 1612 KB Output is correct