oj.uz

답안 #701737

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

void solve () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	while (q--) {
	    int tp, l, r, s, c;
	    cin >> tp >> l >> r;
	    if (tp == 1) {
	    	cin >> s >> c;
	    	for (int i = l; i <= r; i++) a[i] += (s + (i - l) * c);
	    }
	    if (tp == 2) {
	    	cin >> s >> c;
			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
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3063 ms 2672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 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 344 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 336 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 3588 KB Output is correct
2 Correct 62 ms 3020 KB Output is correct
3 Correct 60 ms 2884 KB Output is correct
4 Correct 56 ms 2936 KB Output is correct
5 Correct 62 ms 3092 KB Output is correct
6 Correct 63 ms 3236 KB Output is correct
7 Correct 61 ms 3160 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 3058 ms 3848 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 239 ms 2836 KB Output is correct
2 Correct 73 ms 3548 KB Output is correct
3 Correct 73 ms 3552 KB Output is correct
4 Correct 72 ms 3660 KB Output is correct
5 Correct 72 ms 3680 KB Output is correct
6 Correct 73 ms 3568 KB Output is correct
7 Correct 76 ms 3584 KB Output is correct
8 Correct 1 ms 336 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 3064 ms 4812 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 3588 KB Output is correct
2 Correct 62 ms 3020 KB Output is correct
3 Correct 60 ms 2884 KB Output is correct
4 Correct 56 ms 2936 KB Output is correct
5 Correct 62 ms 3092 KB Output is correct
6 Correct 63 ms 3236 KB Output is correct
7 Correct 61 ms 3160 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 3058 ms 3848 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3063 ms 2672 KB Time limit exceeded
2 Halted 0 ms 0 KB -