oj.uz

답안 #701756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701756 2023-02-22T04:18:14 Z shmad Progression (NOI20_progression) C++17
70 / 100
 439 ms 76324 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

int n, q, a[N], d[N];

vt<array<int, 5>> qr;

struct Data {
 	int lst, frst, pref, suf, ans, len;
	Data operator + (Data other) const {
		Data res;
		res.len = len + other.len, res.ans = max(ans, other.ans);
		res.frst = frst, res.lst = other.lst;
		res.pref = pref, res.suf = other.suf;
		res.ans = max(ans, other.ans);
		if (lst == other.frst) {
			if (pref == len) res.pref += other.pref;
			if (other.suf == other.len) res.suf += suf;
			res.ans = max(res.ans, suf + other.pref);
		}
		return res;
	}
}t[4 * N];

void build (int v = 1, int tl = 1, int tr = n + 1) {
	if (tl == tr) {
		t[v] = {d[tl], d[tl], 1, 1, 1, 1};
		return;
	}
	int tm = tl + tr >> 1;
	build(v << 1, tl, tm), build(v << 1 | 1, tm + 1, tr);
	t[v] = t[v << 1] + t[v << 1 | 1];
}

void upd (int pos, int v = 1, int tl = 1, int tr = n + 1) {
	if (tl == tr) {
		t[v] = {d[tl], d[tl], 1, 1, 1, 1};
		return;
	}
	int tm = tl + tr >> 1;
	if (pos <= tm) upd(pos, v << 1, tl, tm);
	else upd(pos, v << 1 | 1, tm + 1, tr);
	t[v] = t[v << 1] + t[v << 1 | 1];
}

Data get (int l, int r, int v = 1, int tl = 1, int tr = n + 1) {
	if (tl > r || tr < l) return {0, 0, 0, 0, 0, 0};
	if (tl >= l && tr <= r) return t[v];
	int tm = tl + tr >> 1;
	return get(l, r, v << 1, tl, tm) + get(l, r, v << 1 | 1, tm + 1, tr);
}

void solve () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i < n; i++) d[i] = a[i + 1] - a[i];
	bool sub1 = 1;
	for (int i = 1; i <= q; i++) {
		int tp, l, r, s = -1, c = -1;
		cin >> tp >> l >> r;
		if (tp < 3) cin >> s >> c;
		qr.pb({tp, l, r, s, c});
	    sub1 &= (l == 1 && r == n);
	}
	if (sub1) {
		int ans = 1, cur = 1, k = a[2] - a[1];
	    for (int i = 1; i < n; i++) {
			if (a[i + 1] - a[i] == k) cur++;
			else {                  	
				k = a[i + 1] - a[i];
				ans = max(ans, cur);
				cur = 2;
			}
	    }
	    ans = max(ans, cur);
		for (auto [tp, l, r, s, c]: qr) {
        	if (tp == 2) ans = n;
        	if (tp == 3) cout << ans << '\n'; 
        }
        return;
	}
	if (max(n, q) <= 1000) {
		for (auto [tp, l, r, s, c]: qr) {
		    if (tp == 1) {
		    	for (int i = l; i <= r; i++) a[i] += (s + (i - l) * c);
		    }
		    if (tp == 2) {
				for (int i = l; i <= r; i++) a[i] = (s + (i - l) * c);
		    }
		    if (tp == 3) {
		    	if (l == r) {
		    		cout << "1\n";
		    		continue;
		    	}
		        int ans = 1, cur = 1, k = a[l + 1] - a[l];
		     	for (int i = l; i < r; i++) {
					if (a[i + 1] - a[i] == k) cur++;
					else {
						k = a[i + 1] - a[i];
						ans = max(ans, cur);
						cur = 2;
					}
		     	}
		     	ans = max(ans, cur);
		     	cout << ans << '\n';
		    }
		}
		return;
	}
	build();
	for (auto [tp, l, r, s, c]: qr) {
		if (tp < 3) {
			if (tp == 1) a[l] += s;
			if (tp == 2) a[l] = s;
			if (l > 1) d[l - 1] = a[l] - a[l - 1], upd(l - 1);
			if (l < n) d[l] = a[l + 1] - a[l], upd(l);
		}
		if (tp == 3) cout << get(l, r - 1).ans + 1 << '\n';
	}
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Compilation message

Progression.cpp: In function 'void build(long long int, long long int, long long int)':
Progression.cpp:51:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |  int tm = tl + tr >> 1;
      |           ~~~^~~~
Progression.cpp: In function 'void upd(long long int, long long int, long long int, long long int)':
Progression.cpp:61:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |  int tm = tl + tr >> 1;
      |           ~~~^~~~
Progression.cpp: In function 'Data get(long long int, long long int, long long int, long long int, long long int)':
Progression.cpp:70:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |  int tm = tl + tr >> 1;
      |           ~~~^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 25604 KB Output is correct
2 Correct 85 ms 21036 KB Output is correct
3 Correct 80 ms 20908 KB Output is correct
4 Correct 79 ms 20964 KB Output is correct
5 Correct 82 ms 20956 KB Output is correct
6 Correct 81 ms 20876 KB Output is correct
7 Correct 83 ms 20892 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 121 ms 25652 KB Output is correct
12 Correct 120 ms 25636 KB Output is correct
13 Correct 125 ms 25684 KB Output is correct
14 Correct 120 ms 25632 KB Output is correct
15 Correct 118 ms 25648 KB Output is correct
16 Correct 125 ms 25644 KB Output is correct
17 Correct 128 ms 25620 KB Output is correct
18 Correct 121 ms 25632 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 67092 KB Output is correct
2 Correct 94 ms 20908 KB Output is correct
3 Correct 93 ms 20972 KB Output is correct
4 Correct 85 ms 20976 KB Output is correct
5 Correct 94 ms 20896 KB Output is correct
6 Correct 96 ms 21008 KB Output is correct
7 Correct 99 ms 20896 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 255 ms 66952 KB Output is correct
12 Correct 249 ms 67204 KB Output is correct
13 Correct 258 ms 66884 KB Output is correct
14 Correct 260 ms 66868 KB Output is correct
15 Correct 246 ms 67188 KB Output is correct
16 Correct 258 ms 67460 KB Output is correct
17 Correct 271 ms 67500 KB Output is correct
18 Correct 261 ms 67592 KB Output is correct
19 Correct 241 ms 66852 KB Output is correct
20 Correct 241 ms 66816 KB Output is correct
21 Correct 239 ms 66832 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 401 ms 66428 KB Output is correct
2 Correct 127 ms 21748 KB Output is correct
3 Correct 128 ms 21708 KB Output is correct
4 Correct 122 ms 21732 KB Output is correct
5 Correct 118 ms 21652 KB Output is correct
6 Correct 118 ms 21692 KB Output is correct
7 Correct 119 ms 21652 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 406 ms 68420 KB Output is correct
12 Correct 439 ms 76068 KB Output is correct
13 Correct 399 ms 72752 KB Output is correct
14 Correct 412 ms 72700 KB Output is correct
15 Correct 384 ms 75904 KB Output is correct
16 Correct 422 ms 76152 KB Output is correct
17 Correct 415 ms 76100 KB Output is correct
18 Correct 412 ms 76168 KB Output is correct
19 Correct 403 ms 76324 KB Output is correct
20 Correct 405 ms 75984 KB Output is correct
21 Correct 415 ms 76192 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 67092 KB Output is correct
2 Correct 94 ms 20908 KB Output is correct
3 Correct 93 ms 20972 KB Output is correct
4 Correct 85 ms 20976 KB Output is correct
5 Correct 94 ms 20896 KB Output is correct
6 Correct 96 ms 21008 KB Output is correct
7 Correct 99 ms 20896 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 255 ms 66952 KB Output is correct
12 Correct 249 ms 67204 KB Output is correct
13 Correct 258 ms 66884 KB Output is correct
14 Correct 260 ms 66868 KB Output is correct
15 Correct 246 ms 67188 KB Output is correct
16 Correct 258 ms 67460 KB Output is correct
17 Correct 271 ms 67500 KB Output is correct
18 Correct 261 ms 67592 KB Output is correct
19 Correct 241 ms 66852 KB Output is correct
20 Correct 241 ms 66816 KB Output is correct
21 Correct 239 ms 66832 KB Output is correct
22 Incorrect 384 ms 66568 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 25604 KB Output is correct
2 Correct 85 ms 21036 KB Output is correct
3 Correct 80 ms 20908 KB Output is correct
4 Correct 79 ms 20964 KB Output is correct
5 Correct 82 ms 20956 KB Output is correct
6 Correct 81 ms 20876 KB Output is correct
7 Correct 83 ms 20892 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 121 ms 25652 KB Output is correct
12 Correct 120 ms 25636 KB Output is correct
13 Correct 125 ms 25684 KB Output is correct
14 Correct 120 ms 25632 KB Output is correct
15 Correct 118 ms 25648 KB Output is correct
16 Correct 125 ms 25644 KB Output is correct
17 Correct 128 ms 25620 KB Output is correct
18 Correct 121 ms 25632 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 246 ms 67092 KB Output is correct
41 Correct 94 ms 20908 KB Output is correct
42 Correct 93 ms 20972 KB Output is correct
43 Correct 85 ms 20976 KB Output is correct
44 Correct 94 ms 20896 KB Output is correct
45 Correct 96 ms 21008 KB Output is correct
46 Correct 99 ms 20896 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 255 ms 66952 KB Output is correct
51 Correct 249 ms 67204 KB Output is correct
52 Correct 258 ms 66884 KB Output is correct
53 Correct 260 ms 66868 KB Output is correct
54 Correct 246 ms 67188 KB Output is correct
55 Correct 258 ms 67460 KB Output is correct
56 Correct 271 ms 67500 KB Output is correct
57 Correct 261 ms 67592 KB Output is correct
58 Correct 241 ms 66852 KB Output is correct
59 Correct 241 ms 66816 KB Output is correct
60 Correct 239 ms 66832 KB Output is correct
61 Correct 401 ms 66428 KB Output is correct
62 Correct 127 ms 21748 KB Output is correct
63 Correct 128 ms 21708 KB Output is correct
64 Correct 122 ms 21732 KB Output is correct
65 Correct 118 ms 21652 KB Output is correct
66 Correct 118 ms 21692 KB Output is correct
67 Correct 119 ms 21652 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 352 KB Output is correct
71 Correct 406 ms 68420 KB Output is correct
72 Correct 439 ms 76068 KB Output is correct
73 Correct 399 ms 72752 KB Output is correct
74 Correct 412 ms 72700 KB Output is correct
75 Correct 384 ms 75904 KB Output is correct
76 Correct 422 ms 76152 KB Output is correct
77 Correct 415 ms 76100 KB Output is correct
78 Correct 412 ms 76168 KB Output is correct
79 Correct 403 ms 76324 KB Output is correct
80 Correct 405 ms 75984 KB Output is correct
81 Correct 415 ms 76192 KB Output is correct
82 Incorrect 384 ms 66568 KB Output isn't correct
83 Halted 0 ms 0 KB -