oj.uz

답안 #701740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701740 2023-02-22T03:15:58 Z shmad Progression (NOI20_progression) C++17
24 / 100
 3000 ms 30832 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];

vt<array<int, 5>> qr;

void solve () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> 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;
	}
	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';
	    }
	}
	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();
	}
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 28060 KB Output is correct
2 Correct 83 ms 23708 KB Output is correct
3 Correct 83 ms 23696 KB Output is correct
4 Correct 83 ms 23684 KB Output is correct
5 Correct 89 ms 23816 KB Output is correct
6 Correct 86 ms 23740 KB Output is correct
7 Correct 83 ms 23768 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 122 ms 30752 KB Output is correct
12 Correct 132 ms 30700 KB Output is correct
13 Correct 130 ms 30832 KB Output is correct
14 Correct 125 ms 30820 KB Output is correct
15 Correct 123 ms 30588 KB Output is correct
16 Correct 131 ms 30788 KB Output is correct
17 Correct 123 ms 30752 KB Output is correct
18 Correct 133 ms 30708 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 2 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 420 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
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 23436 KB Output is correct
2 Correct 77 ms 20896 KB Output is correct
3 Correct 77 ms 20912 KB Output is correct
4 Correct 68 ms 20904 KB Output is correct
5 Correct 83 ms 20964 KB Output is correct
6 Correct 78 ms 20908 KB Output is correct
7 Correct 77 ms 20860 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 3056 ms 26692 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 23368 KB Output is correct
2 Correct 86 ms 20872 KB Output is correct
3 Correct 92 ms 20896 KB Output is correct
4 Correct 87 ms 20900 KB Output is correct
5 Correct 92 ms 20896 KB Output is correct
6 Correct 88 ms 20868 KB Output is correct
7 Correct 94 ms 20952 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 Execution timed out 3061 ms 26828 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 23436 KB Output is correct
2 Correct 77 ms 20896 KB Output is correct
3 Correct 77 ms 20912 KB Output is correct
4 Correct 68 ms 20904 KB Output is correct
5 Correct 83 ms 20964 KB Output is correct
6 Correct 78 ms 20908 KB Output is correct
7 Correct 77 ms 20860 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Execution timed out 3056 ms 26692 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 28060 KB Output is correct
2 Correct 83 ms 23708 KB Output is correct
3 Correct 83 ms 23696 KB Output is correct
4 Correct 83 ms 23684 KB Output is correct
5 Correct 89 ms 23816 KB Output is correct
6 Correct 86 ms 23740 KB Output is correct
7 Correct 83 ms 23768 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 122 ms 30752 KB Output is correct
12 Correct 132 ms 30700 KB Output is correct
13 Correct 130 ms 30832 KB Output is correct
14 Correct 125 ms 30820 KB Output is correct
15 Correct 123 ms 30588 KB Output is correct
16 Correct 131 ms 30788 KB Output is correct
17 Correct 123 ms 30752 KB Output is correct
18 Correct 133 ms 30708 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 2 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 420 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 173 ms 23436 KB Output is correct
41 Correct 77 ms 20896 KB Output is correct
42 Correct 77 ms 20912 KB Output is correct
43 Correct 68 ms 20904 KB Output is correct
44 Correct 83 ms 20964 KB Output is correct
45 Correct 78 ms 20908 KB Output is correct
46 Correct 77 ms 20860 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Execution timed out 3056 ms 26692 KB Time limit exceeded
51 Halted 0 ms 0 KB -