oj.uz

답안 #585205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585205 2022-06-28T12:26:02 Z keta_tsimakuridze Progression (NOI20_progression) C++14
15 / 100
 116 ms 133712 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, inf = 1e18; //!
int t, d[N], a[N];
struct node {
	int L, R, len;
	pii suf, pref;
	int k, b, ans;
} tree[4 * N];
struct z {
	int k, b, t;
} lazy[N];
bool eq(int a, int b) {
	return (a == -inf || b == -inf ? 1 : a == b);
}
node merge(node a, node b) {
	node c;
	c.len = a.len + b.len;
	c.L = a.L; c.R = b.R;
	c.ans = max(a.ans, b.ans);
//	cout << eq(a.suf.f, b.suf.f) << endl;
	if(eq(a.suf.f, b.pref.f) && eq(a.suf.f, b.L - a.R) && eq(b.pref.f, b.L - a.R)) {
		c.ans = max(c.ans, a.suf.s + b.pref.s);
	}
	if(eq(a.suf.f, b.L - a.R)) {
		c.ans = max(c.ans, a.suf.s + 1);
	}
	if(eq(b.pref.f, b.L - a.R)) {
		c.ans = max(c.ans, b.pref.s + 1);
	}
	c.suf = b.suf;
	if(b.suf.s == b.len && eq(a.suf.f, b.pref.f) && eq(a.suf.f, b.L - a.R) && eq(b.suf.f, b.L - a.R)) {
		c.suf.s += a.suf.s;
	} else if(b.suf.s == b.len && eq(b.suf.f, b.L - a.R)) {
		c.suf.s++;
	}
	c.pref = a.pref;
	if(a.pref.s == a.len && eq(a.pref.f, b.pref.f)&& eq(a.pref.f, b.L - a.R) && eq(b.pref.f, b.L - a.R)) {
		c.pref.s += b.pref.s;
	} else if(a.pref.s == a.len && eq(a.pref.f, b.L - a.R)) c.pref.s++;
	
	if(b.len == 1) {
		c.suf.f = b.L - a.R;
	}
	if(a.len == 1) {
		c.pref.f = b.L - a.R;
	}
	return c;
		
}
void build(int u,int l,int r) {
	if(l == r) {
		tree[u].L = tree[u].R = a[l];
		tree[u].b = a[l];
		tree[u].ans = 1;
		tree[u].pref = {-inf, 1};
		tree[u].suf = {-inf, 1};
		tree[u].len = 1;
		return;
	}
	int mid = (l + r) / 2;
	build(2 * u, l, mid); build(2 * u + 1, mid + 1, r);
	tree[u] = merge(tree[2 * u], tree[2 * u + 1]);
//	cout << l << " " << r << " " << tree[u].ans << " " << tree[u].R << " " << tree[u].suf.f << " " << tree[u].suf.s <<endl;

}
void push(int u,int l,int r) {
	if(lazy[u].t) {
		tree[u].k = tree[u].b = 0;
	}
	tree[u].k +=  lazy[u].k;
	tree[u].b += lazy[u].b;
	if(l != r && lazy[u].t) {
		lazy[2 * u].t = lazy[2 * u + 1].t = 1;
		lazy[2 * u].k = lazy[2 * u + 1].k = lazy[2 * u].b = lazy[2 * u + 1].b = 0;
	}
	
	if(l != r) {
		lazy[2 * u].k += lazy[u].k;
		lazy[2 * u + 1].k += lazy[u].k;
		
		lazy[2 * u].b += lazy[u].b;
		lazy[2 * u + 1].b += lazy[u].b;
	}
	else {
		tree[u].L = tree[u].R = tree[u].k * r + tree[u].b;
	}
	lazy[u].k = lazy[u].b = lazy[u].t = 0;
}
void upd(int u,int st,int en,int l,int r,int k,int b,int t) {
	push(u, l, r);
	if(l > en || r < st) return;
	if(st <= l && r <= en) {			
		lazy[u].k += k;
		lazy[u].b += b;
		lazy[u].t = (t == 2);
		push(u, l, r);
		return;
	}
	int mid = (l + r) / 2;
	upd(2 * u, st, en, l, mid, k, b, t);
	upd(2 * u + 1, st, en, mid + 1, r, k, b, t);
}
node get(int u,int st,int en, int l,int r) {
	if(st <= l && r <= en) return tree[u];
	int mid = (l + r) / 2;
	if(mid + 1 > en) return get(2 * u, st, en, l, mid);
	if(mid < st) return get(2 * u + 1, st, en, mid + 1, r);
	return merge(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
}
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];
	}
	build(1, 1, n);
	// 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; 
			for(int j = l; j <= r; j++) {
				a[j] = (t == 1 ? a[j] + (j - l) * c + s : (j - l) * c + s);
			}
			/*
			if(t == 1)  {
				upd(1, l, r - 1, 1, n, c, s - l * c, 1);
			}
			else {
				upd(1, l, r - 1, 1, n, c, s - l * c, 2);
				
			} */
			continue; 
		}
		int l, r;
		cin >> l >> r;
		build(1, 1, n);
		cout << get(1, l, r, 1, n).ans << endl;
	}
}

Compilation message

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

Subtask #1
0 / 9.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62848 KB Output is correct
2 Correct 25 ms 62932 KB Output is correct
3 Correct 30 ms 62916 KB Output is correct
4 Correct 27 ms 62868 KB Output is correct
5 Correct 25 ms 62932 KB Output is correct
6 Correct 33 ms 62924 KB Output is correct
7 Correct 23 ms 62844 KB Output is correct
8 Correct 36 ms 62860 KB Output is correct
9 Correct 37 ms 62904 KB Output is correct
10 Correct 37 ms 62968 KB Output is correct
11 Correct 57 ms 62948 KB Output is correct
12 Correct 37 ms 62924 KB Output is correct
13 Correct 53 ms 62932 KB Output is correct
14 Correct 51 ms 62908 KB Output is correct
15 Correct 38 ms 62856 KB Output is correct
16 Correct 36 ms 62944 KB Output is correct
17 Correct 36 ms 62876 KB Output is correct
18 Correct 38 ms 62896 KB Output is correct
19 Correct 26 ms 62852 KB Output is correct
20 Correct 26 ms 62932 KB Output is correct
21 Correct 25 ms 62932 KB Output is correct

Subtask #3
0 / 35.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 17.0

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