oj.uz

답안 #585116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585116 2022-06-28T10:13:23 Z keta_tsimakuridze Progression (NOI20_progression) C++14
15 / 100
 25 ms 6764 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t, d[N], a[N];
main() {
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int n, q;
	cin >> n >> q;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		if(i > 1) {
			d[i - 1] = a[i] - a[i - 1];
		}
	}
	// ai - a(i - 1) - (a(i - 1) - a(i - 2)) = ai - 2*a(i-1) + a(i-2)

	for(int i = 1; i <= q; i++) {
		int t;
		cin >> t;
		if(t < 3) {
			int l, r, s, c;
			cin >> l >> r >> s >> c;
			if(t == 1)  {
				
				for(int j = l; j <= r; j++) a[j] += (j - l) * c + s;
				
				d[l - 1] += s;
				for(int j = l ; j <= r - 1; j++) {
					d[j] += c;
				}
				d[r] -= s + (r - l) * c;
			}
			else {
				for(int j = l; j <= r; j++) a[j] = (j - l) * c + s;
				for(int j = l ; j <= r - 1; j++) {
					d[j] = c;
				}
				d[l - 1] = a[l] - a[l - 1];
				d[r] = a[r + 1] - a[r];
				
			}
			continue; 
		}
		int l, r;
		cin >> l >> r;
		int ans = 2;
		ans = min(ans, r - l + 1);
		r -= 1;
		for(int k = l; k <= r; k++) { 
			int j = k - 1;
			while(j < r  && d[k] == d[j + 1]) ++j;
			ans = max(ans, j - k + 2);
			k = j;
		}
		cout << ans << endl;
	}
}

Compilation message

Progression.cpp:10:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   10 | main() {
      | ^~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 24 ms 6740 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

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 2 ms 340 KB Output is correct
15 Correct 2 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
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 6736 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 25 ms 6764 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 6736 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 24 ms 6740 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -