oj.uz

답안 #615992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615992 2022-07-31T17:25:40 Z cheissmart Fish 2 (JOI22_fish2) C++14
25 / 100
 4000 ms 50996 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7, N = 1e5 + 7;
const ll oo = 1e18;

ll a[N];
int n;

namespace cover {
	pair<char, int> t[N * 4];
	char lz[N * 4];

	pair<char, int> add(pair<char, int> a, pair<char, int> b) {
		if(a.F != b.F) return min(a, b);
		a.S += b.S;
		return a;
	}
	void apply(int v, int x) {
		t[v].F += x;
		lz[v] += x;
	}
	void push(int v) {
		apply(v * 2, lz[v]);
		apply(v * 2 + 1, lz[v]);
		lz[v] = 0;
	}
	void build(int v = 1, int tl = 1, int tr = n + 1) {
		if(tr - tl == 1) {
			t[v] = {0, 1};
			return;
		}
		int tm = (tl + tr) / 2;
		build(v * 2, tl, tm);
		build(v * 2 + 1, tm, tr);
		t[v] = add(t[v * 2], t[v * 2 + 1]);
	}
	void add(int l, int r, int x, int v = 1, int tl = 1, int tr = n + 1) {
		if(l <= tl && tr <= r) {
			apply(v, x);
			return;
		}
		push(v);
		int tm = (tl + tr) / 2;
		if(l < tm) add(l, r, x, v * 2, tl, tm);
		if(r > tm) add(l, r, x, v * 2 + 1, tm, tr);
		t[v] = add(t[v * 2], t[v * 2 + 1]);
	}
	pair<char, int> qry(int l, int r, int v = 1, int tl = 1, int tr = n + 1) {
		if(l <= tl && tr <= r)
			return t[v];
		push(v);
		int tm = (tl + tr) / 2;
		pair<char, int> res = {100, 100};
		if(l < tm) res = add(res, qry(l, r, v * 2, tl, tm));
		if(r > tm) res = add(res, qry(l, r, v * 2 + 1, tm, tr));
		return res;
	}
}

namespace seg {
	struct node {
		V<pair<int, ll>> bad_pref, bad_suff;
		V<pi> bad_seg;
		ll sum;
	} t[N * 4];
	void pull(int v) {
		for(auto p:t[v * 2].bad_pref)
			t[v].bad_pref.PB(p);
		for(auto p:t[v * 2 + 1].bad_suff)
			t[v].bad_suff.PB(p);
		for(auto[pos, sum]:t[v * 2 + 1].bad_pref) if(sum + t[v * 2].sum < a[pos + 1])
			t[v].bad_pref.EB(pos, sum + t[v * 2].sum);
		for(auto[pos, sum]:t[v * 2].bad_suff) if(sum + t[v * 2 + 1].sum < a[pos - 1])
			t[v].bad_suff.EB(pos, sum + t[v * 2 + 1].sum);

		for(int i = 0, j = 0; i < SZ(t[v * 2].bad_suff) && j < SZ(t[v * 2 + 1].bad_pref); ) {
			auto he = t[v * 2].bad_suff[i], be = t[v * 2 + 1].bad_pref[j];
			if(he.S + be.S < min(a[he.F - 1], a[be.F + 1]))
				t[v].bad_seg.EB(he.F, be.F);
			if(a[he.F - 1] < a[be.F + 1])
				i++;
			else
				j++;
		}
		t[v].sum = t[v * 2].sum + t[v * 2 + 1].sum;
	}
	void build(int v = 1, int tl = 1, int tr = n + 1) {
		if(tr - tl == 1) {
			t[v].sum = a[tl];
			if(a[tl] < a[tl + 1])
				t[v].bad_pref.EB(tl, a[tl]);
			if(a[tl] < a[tl - 1])
				t[v].bad_suff.EB(tl, a[tl]);
			if(a[tl] < a[tl + 1] && a[tl] < a[tl - 1])
				t[v].bad_seg.EB(tl, tl);
		} else {
			int tm = (tl + tr) / 2;
			build(v * 2, tl, tm);
			build(v * 2 + 1, tm, tr);
			pull(v);
		}
		for(auto[l, r]:t[v].bad_seg)
			cover::add(l, r + 1, 1);
	}
	void upd(int pos, int v = 1, int tl = 1, int tr = n + 1) {
		for(auto[l, r]:t[v].bad_seg)
			cover::add(l, r + 1, -1);
		t[v].bad_seg.clear(), t[v].bad_pref.clear(), t[v].bad_suff.clear();

		if(tr - tl == 1) {
			t[v].sum = a[tl];
			if(a[tl] < a[tl + 1])
				t[v].bad_pref.EB(tl, a[tl]);
			if(a[tl] < a[tl - 1])
				t[v].bad_suff.EB(tl, a[tl]);
			if(a[tl] < a[tl + 1] && a[tl] < a[tl - 1])
				t[v].bad_seg.EB(tl, tl);
		} else {
			int tm = (tl + tr) / 2;
			if(pos - 1 < tm)
				upd(pos, v * 2, tl, tm);
			if(pos + 1 >= tm)
				upd(pos, v * 2 + 1, tm, tr);
			pull(v);
		}
		for(auto[l, r]:t[v].bad_seg)
			cover::add(l, r + 1, 1);
	}
}

void upd(int pos, ll val) {
	a[pos] = val;
	seg::upd(pos);
}

signed main()
{
	IO_OP;

	cin >> n;
	a[0] = a[n + 1] = oo;
	for(int i = 1; i <= n; i++)
		cin >> a[i];

	cover::build();
	seg::build();

	int q;
	cin >> q;
	while(q--) {
		int op;
		cin >> op;
		if(op == 1) {
			int x, y;
			cin >> x >> y;
			upd(x, y);
		} else {
			int l, r;
			cin >> l >> r;
			ll tl = a[l - 1], tr = a[r + 1];
			if(l - 1 >= 1) upd(l - 1, 1e15);
			if(r + 1 <= n) upd(r + 1, 1e15);

			auto p = cover::qry(l, r + 1);
			cout << p.S << '\n';

			if(l - 1 >= 1) upd(l - 1, tl);
			if(r + 1 <= n) upd(r + 1, tr);
		}
	}

}

Compilation message

fish2.cpp: In function 'void seg::pull(int)':
fish2.cpp:87:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   87 |   for(auto[pos, sum]:t[v * 2 + 1].bad_pref) if(sum + t[v * 2].sum < a[pos + 1])
      |           ^
fish2.cpp:89:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   89 |   for(auto[pos, sum]:t[v * 2].bad_suff) if(sum + t[v * 2 + 1].sum < a[pos - 1])
      |           ^
fish2.cpp: In function 'void seg::build(int, int, int)':
fish2.cpp:118:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  118 |   for(auto[l, r]:t[v].bad_seg)
      |           ^
fish2.cpp: In function 'void seg::upd(int, int, int, int)':
fish2.cpp:122:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  122 |   for(auto[l, r]:t[v].bad_seg)
      |           ^
fish2.cpp:142:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  142 |   for(auto[l, r]:t[v].bad_seg)
      |           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31572 KB Output is correct
2 Correct 20 ms 31588 KB Output is correct
3 Correct 17 ms 31612 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 36 ms 31740 KB Output is correct
6 Correct 61 ms 31744 KB Output is correct
7 Correct 32 ms 31692 KB Output is correct
8 Correct 39 ms 31740 KB Output is correct
9 Correct 56 ms 31728 KB Output is correct
10 Correct 17 ms 31644 KB Output is correct
11 Correct 23 ms 31700 KB Output is correct
12 Correct 19 ms 31748 KB Output is correct
13 Correct 32 ms 31764 KB Output is correct
14 Correct 26 ms 31740 KB Output is correct
15 Correct 28 ms 31704 KB Output is correct
16 Correct 37 ms 31700 KB Output is correct
17 Correct 20 ms 31740 KB Output is correct
18 Correct 35 ms 31724 KB Output is correct
19 Correct 19 ms 31652 KB Output is correct
20 Correct 20 ms 31700 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 101 ms 49952 KB Output is correct
3 Correct 93 ms 48204 KB Output is correct
4 Correct 93 ms 49812 KB Output is correct
5 Correct 88 ms 48360 KB Output is correct
6 Correct 67 ms 43236 KB Output is correct
7 Correct 53 ms 42008 KB Output is correct
8 Correct 65 ms 43192 KB Output is correct
9 Correct 55 ms 42036 KB Output is correct
10 Correct 85 ms 49620 KB Output is correct
11 Correct 79 ms 45348 KB Output is correct
12 Correct 60 ms 42608 KB Output is correct
13 Correct 58 ms 42680 KB Output is correct
14 Correct 88 ms 45332 KB Output is correct
15 Correct 81 ms 45248 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31572 KB Output is correct
2 Correct 20 ms 31588 KB Output is correct
3 Correct 17 ms 31612 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 36 ms 31740 KB Output is correct
6 Correct 61 ms 31744 KB Output is correct
7 Correct 32 ms 31692 KB Output is correct
8 Correct 39 ms 31740 KB Output is correct
9 Correct 56 ms 31728 KB Output is correct
10 Correct 17 ms 31644 KB Output is correct
11 Correct 23 ms 31700 KB Output is correct
12 Correct 19 ms 31748 KB Output is correct
13 Correct 32 ms 31764 KB Output is correct
14 Correct 26 ms 31740 KB Output is correct
15 Correct 28 ms 31704 KB Output is correct
16 Correct 37 ms 31700 KB Output is correct
17 Correct 20 ms 31740 KB Output is correct
18 Correct 35 ms 31724 KB Output is correct
19 Correct 19 ms 31652 KB Output is correct
20 Correct 20 ms 31700 KB Output is correct
21 Correct 15 ms 31572 KB Output is correct
22 Correct 101 ms 49952 KB Output is correct
23 Correct 93 ms 48204 KB Output is correct
24 Correct 93 ms 49812 KB Output is correct
25 Correct 88 ms 48360 KB Output is correct
26 Correct 67 ms 43236 KB Output is correct
27 Correct 53 ms 42008 KB Output is correct
28 Correct 65 ms 43192 KB Output is correct
29 Correct 55 ms 42036 KB Output is correct
30 Correct 85 ms 49620 KB Output is correct
31 Correct 79 ms 45348 KB Output is correct
32 Correct 60 ms 42608 KB Output is correct
33 Correct 58 ms 42680 KB Output is correct
34 Correct 88 ms 45332 KB Output is correct
35 Correct 81 ms 45248 KB Output is correct
36 Correct 447 ms 50448 KB Output is correct
37 Correct 568 ms 48628 KB Output is correct
38 Correct 619 ms 48396 KB Output is correct
39 Correct 335 ms 50364 KB Output is correct
40 Correct 635 ms 48368 KB Output is correct
41 Correct 89 ms 43748 KB Output is correct
42 Correct 89 ms 43756 KB Output is correct
43 Correct 151 ms 42492 KB Output is correct
44 Correct 142 ms 42604 KB Output is correct
45 Correct 371 ms 50112 KB Output is correct
46 Correct 379 ms 50072 KB Output is correct
47 Correct 455 ms 44168 KB Output is correct
48 Correct 102 ms 42936 KB Output is correct
49 Correct 122 ms 43132 KB Output is correct
50 Correct 116 ms 45620 KB Output is correct
51 Correct 123 ms 45584 KB Output is correct
52 Correct 121 ms 45684 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 101 ms 49952 KB Output is correct
3 Correct 93 ms 48204 KB Output is correct
4 Correct 93 ms 49812 KB Output is correct
5 Correct 88 ms 48360 KB Output is correct
6 Correct 67 ms 43236 KB Output is correct
7 Correct 53 ms 42008 KB Output is correct
8 Correct 65 ms 43192 KB Output is correct
9 Correct 55 ms 42036 KB Output is correct
10 Correct 85 ms 49620 KB Output is correct
11 Correct 79 ms 45348 KB Output is correct
12 Correct 60 ms 42608 KB Output is correct
13 Correct 58 ms 42680 KB Output is correct
14 Correct 88 ms 45332 KB Output is correct
15 Correct 81 ms 45248 KB Output is correct
16 Correct 15 ms 31560 KB Output is correct
17 Execution timed out 4057 ms 49220 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 101 ms 49952 KB Output is correct
3 Correct 93 ms 48204 KB Output is correct
4 Correct 93 ms 49812 KB Output is correct
5 Correct 88 ms 48360 KB Output is correct
6 Correct 67 ms 43236 KB Output is correct
7 Correct 53 ms 42008 KB Output is correct
8 Correct 65 ms 43192 KB Output is correct
9 Correct 55 ms 42036 KB Output is correct
10 Correct 85 ms 49620 KB Output is correct
11 Correct 79 ms 45348 KB Output is correct
12 Correct 60 ms 42608 KB Output is correct
13 Correct 58 ms 42680 KB Output is correct
14 Correct 88 ms 45332 KB Output is correct
15 Correct 81 ms 45248 KB Output is correct
16 Correct 19 ms 31572 KB Output is correct
17 Execution timed out 4059 ms 50996 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31572 KB Output is correct
2 Correct 20 ms 31588 KB Output is correct
3 Correct 17 ms 31612 KB Output is correct
4 Correct 15 ms 31572 KB Output is correct
5 Correct 36 ms 31740 KB Output is correct
6 Correct 61 ms 31744 KB Output is correct
7 Correct 32 ms 31692 KB Output is correct
8 Correct 39 ms 31740 KB Output is correct
9 Correct 56 ms 31728 KB Output is correct
10 Correct 17 ms 31644 KB Output is correct
11 Correct 23 ms 31700 KB Output is correct
12 Correct 19 ms 31748 KB Output is correct
13 Correct 32 ms 31764 KB Output is correct
14 Correct 26 ms 31740 KB Output is correct
15 Correct 28 ms 31704 KB Output is correct
16 Correct 37 ms 31700 KB Output is correct
17 Correct 20 ms 31740 KB Output is correct
18 Correct 35 ms 31724 KB Output is correct
19 Correct 19 ms 31652 KB Output is correct
20 Correct 20 ms 31700 KB Output is correct
21 Correct 15 ms 31572 KB Output is correct
22 Correct 101 ms 49952 KB Output is correct
23 Correct 93 ms 48204 KB Output is correct
24 Correct 93 ms 49812 KB Output is correct
25 Correct 88 ms 48360 KB Output is correct
26 Correct 67 ms 43236 KB Output is correct
27 Correct 53 ms 42008 KB Output is correct
28 Correct 65 ms 43192 KB Output is correct
29 Correct 55 ms 42036 KB Output is correct
30 Correct 85 ms 49620 KB Output is correct
31 Correct 79 ms 45348 KB Output is correct
32 Correct 60 ms 42608 KB Output is correct
33 Correct 58 ms 42680 KB Output is correct
34 Correct 88 ms 45332 KB Output is correct
35 Correct 81 ms 45248 KB Output is correct
36 Correct 447 ms 50448 KB Output is correct
37 Correct 568 ms 48628 KB Output is correct
38 Correct 619 ms 48396 KB Output is correct
39 Correct 335 ms 50364 KB Output is correct
40 Correct 635 ms 48368 KB Output is correct
41 Correct 89 ms 43748 KB Output is correct
42 Correct 89 ms 43756 KB Output is correct
43 Correct 151 ms 42492 KB Output is correct
44 Correct 142 ms 42604 KB Output is correct
45 Correct 371 ms 50112 KB Output is correct
46 Correct 379 ms 50072 KB Output is correct
47 Correct 455 ms 44168 KB Output is correct
48 Correct 102 ms 42936 KB Output is correct
49 Correct 122 ms 43132 KB Output is correct
50 Correct 116 ms 45620 KB Output is correct
51 Correct 123 ms 45584 KB Output is correct
52 Correct 121 ms 45684 KB Output is correct
53 Correct 15 ms 31560 KB Output is correct
54 Execution timed out 4057 ms 49220 KB Time limit exceeded
55 Halted 0 ms 0 KB -