oj.uz

답안 #616513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616513 2022-08-01T05:13:45 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 55352 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 {
	int t[N * 4], tag[N * 4];
	int sum(int v, int len) {
		return tag[v] ? len : t[v];
	}
	void _add(int l, int r, int x, int v = 1, int tl = 1, int tr = n + 1) {
		if(l <= tl && tr <= r) {
			tag[v] += x;
			return;
		}
		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] = sum(v * 2, tm - tl) + sum(v * 2 + 1, tr - tm);
	}
	void add(int l, int r, int x) {
		if(l == 1 && r == n + 1) return;
		_add(l, r, x);
	}
	int qry(int l, int r, int v = 1, int tl = 1, int tr = n + 1) {
		if(l <= tl && tr <= r)
			return sum(v, tr - tl);
		int tm = (tl + tr) / 2, res = 0;
		if(l < tm) res += qry(l, r, v * 2, tl, tm);
		if(r > tm) 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, int posl = INF, int posr = 0) {
		t[v].bad_pref = t[v * 2].bad_pref;
		t[v].bad_suff = t[v * 2 + 1].bad_suff;

		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);

		int szi = SZ(t[v * 2].bad_suff);
		int szj = SZ(t[v * 2 + 1].bad_pref);
		int i = 0, j = 0;
		while(i < szi && t[v * 2].bad_suff[i].F > posl)
			i++;
		while(j < szj && t[v * 2 + 1].bad_pref[j].F < posr)
			j++;
		while(i < szi && j < szj) {
			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);
				cover::add(he.F, be.F + 1, 1);
			}
			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);
				cover::add(tl, tl + 1, 1);
			}
		} else {
			int tm = (tl + tr) / 2;
			build(v * 2, tl, tm);
			build(v * 2 + 1, tm, tr);
			pull(v);
		}
	}
	void upd(int pos, int v = 1, int tl = 1, int tr = n + 1) {
		V<pi> tt;
		for(auto[l, r]:t[v].bad_seg) {
			if(r < pos - 1 || l > pos + 1) {
				tt.EB(l, r);
				continue;
			}
			cover::add(l, r + 1, -1);
		}
		t[v].bad_seg = tt, 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);
				cover::add(tl, tl + 1, 1);
			}
		} 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, pos + 1, pos - 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];

	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);
			if(l != 1 || r != n)
				cover::add(l, r + 1, -1);

			cout << r - l + 1 - cover::qry(l, r + 1) << '\n';

			if(l != 1 || r != n)
				cover::add(l, r + 1, 1);

			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, int, int)':
fish2.cpp:65:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   65 |   for(auto[pos, sum]:t[v * 2 + 1].bad_pref) if(sum + t[v * 2].sum < a[pos + 1])
      |           ^
fish2.cpp:67:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   67 |   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::upd(int, int, int, int)':
fish2.cpp:110:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  110 |   for(auto[l, r]:t[v].bad_seg) {
      |           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31636 KB Output is correct
2 Correct 19 ms 31564 KB Output is correct
3 Correct 21 ms 31616 KB Output is correct
4 Correct 21 ms 31608 KB Output is correct
5 Correct 22 ms 31760 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31664 KB Output is correct
8 Correct 26 ms 31700 KB Output is correct
9 Correct 26 ms 31736 KB Output is correct
10 Correct 20 ms 31720 KB Output is correct
11 Correct 24 ms 31676 KB Output is correct
12 Correct 22 ms 31688 KB Output is correct
13 Correct 23 ms 31700 KB Output is correct
14 Correct 21 ms 31688 KB Output is correct
15 Correct 23 ms 31700 KB Output is correct
16 Correct 22 ms 31700 KB Output is correct
17 Correct 19 ms 31728 KB Output is correct
18 Correct 22 ms 31732 KB Output is correct
19 Correct 19 ms 31636 KB Output is correct
20 Correct 25 ms 31732 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31536 KB Output is correct
2 Correct 88 ms 48400 KB Output is correct
3 Correct 83 ms 47032 KB Output is correct
4 Correct 92 ms 48248 KB Output is correct
5 Correct 81 ms 47152 KB Output is correct
6 Correct 61 ms 42272 KB Output is correct
7 Correct 70 ms 41216 KB Output is correct
8 Correct 57 ms 42260 KB Output is correct
9 Correct 56 ms 41252 KB Output is correct
10 Correct 70 ms 47876 KB Output is correct
11 Correct 84 ms 44228 KB Output is correct
12 Correct 75 ms 41772 KB Output is correct
13 Correct 56 ms 41860 KB Output is correct
14 Correct 68 ms 44476 KB Output is correct
15 Correct 71 ms 44364 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31636 KB Output is correct
2 Correct 19 ms 31564 KB Output is correct
3 Correct 21 ms 31616 KB Output is correct
4 Correct 21 ms 31608 KB Output is correct
5 Correct 22 ms 31760 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31664 KB Output is correct
8 Correct 26 ms 31700 KB Output is correct
9 Correct 26 ms 31736 KB Output is correct
10 Correct 20 ms 31720 KB Output is correct
11 Correct 24 ms 31676 KB Output is correct
12 Correct 22 ms 31688 KB Output is correct
13 Correct 23 ms 31700 KB Output is correct
14 Correct 21 ms 31688 KB Output is correct
15 Correct 23 ms 31700 KB Output is correct
16 Correct 22 ms 31700 KB Output is correct
17 Correct 19 ms 31728 KB Output is correct
18 Correct 22 ms 31732 KB Output is correct
19 Correct 19 ms 31636 KB Output is correct
20 Correct 25 ms 31732 KB Output is correct
21 Correct 21 ms 31536 KB Output is correct
22 Correct 88 ms 48400 KB Output is correct
23 Correct 83 ms 47032 KB Output is correct
24 Correct 92 ms 48248 KB Output is correct
25 Correct 81 ms 47152 KB Output is correct
26 Correct 61 ms 42272 KB Output is correct
27 Correct 70 ms 41216 KB Output is correct
28 Correct 57 ms 42260 KB Output is correct
29 Correct 56 ms 41252 KB Output is correct
30 Correct 70 ms 47876 KB Output is correct
31 Correct 84 ms 44228 KB Output is correct
32 Correct 75 ms 41772 KB Output is correct
33 Correct 56 ms 41860 KB Output is correct
34 Correct 68 ms 44476 KB Output is correct
35 Correct 71 ms 44364 KB Output is correct
36 Correct 105 ms 49180 KB Output is correct
37 Correct 169 ms 47572 KB Output is correct
38 Correct 158 ms 47360 KB Output is correct
39 Correct 108 ms 48984 KB Output is correct
40 Correct 129 ms 47316 KB Output is correct
41 Correct 93 ms 42908 KB Output is correct
42 Correct 105 ms 42904 KB Output is correct
43 Correct 94 ms 41672 KB Output is correct
44 Correct 83 ms 41792 KB Output is correct
45 Correct 117 ms 48500 KB Output is correct
46 Correct 97 ms 48552 KB Output is correct
47 Correct 105 ms 43256 KB Output is correct
48 Correct 75 ms 42064 KB Output is correct
49 Correct 78 ms 42252 KB Output is correct
50 Correct 94 ms 44840 KB Output is correct
51 Correct 82 ms 44748 KB Output is correct
52 Correct 95 ms 44840 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31536 KB Output is correct
2 Correct 88 ms 48400 KB Output is correct
3 Correct 83 ms 47032 KB Output is correct
4 Correct 92 ms 48248 KB Output is correct
5 Correct 81 ms 47152 KB Output is correct
6 Correct 61 ms 42272 KB Output is correct
7 Correct 70 ms 41216 KB Output is correct
8 Correct 57 ms 42260 KB Output is correct
9 Correct 56 ms 41252 KB Output is correct
10 Correct 70 ms 47876 KB Output is correct
11 Correct 84 ms 44228 KB Output is correct
12 Correct 75 ms 41772 KB Output is correct
13 Correct 56 ms 41860 KB Output is correct
14 Correct 68 ms 44476 KB Output is correct
15 Correct 71 ms 44364 KB Output is correct
16 Correct 18 ms 31648 KB Output is correct
17 Execution timed out 4034 ms 52856 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31536 KB Output is correct
2 Correct 88 ms 48400 KB Output is correct
3 Correct 83 ms 47032 KB Output is correct
4 Correct 92 ms 48248 KB Output is correct
5 Correct 81 ms 47152 KB Output is correct
6 Correct 61 ms 42272 KB Output is correct
7 Correct 70 ms 41216 KB Output is correct
8 Correct 57 ms 42260 KB Output is correct
9 Correct 56 ms 41252 KB Output is correct
10 Correct 70 ms 47876 KB Output is correct
11 Correct 84 ms 44228 KB Output is correct
12 Correct 75 ms 41772 KB Output is correct
13 Correct 56 ms 41860 KB Output is correct
14 Correct 68 ms 44476 KB Output is correct
15 Correct 71 ms 44364 KB Output is correct
16 Correct 15 ms 31572 KB Output is correct
17 Correct 946 ms 49580 KB Output is correct
18 Correct 878 ms 55168 KB Output is correct
19 Correct 705 ms 47448 KB Output is correct
20 Correct 661 ms 54040 KB Output is correct
21 Correct 855 ms 49820 KB Output is correct
22 Correct 841 ms 55032 KB Output is correct
23 Correct 1029 ms 47488 KB Output is correct
24 Correct 736 ms 54724 KB Output is correct
25 Correct 751 ms 47372 KB Output is correct
26 Correct 297 ms 45692 KB Output is correct
27 Correct 430 ms 46712 KB Output is correct
28 Correct 539 ms 48804 KB Output is correct
29 Correct 370 ms 46096 KB Output is correct
30 Correct 422 ms 46764 KB Output is correct
31 Correct 616 ms 49644 KB Output is correct
32 Correct 687 ms 53640 KB Output is correct
33 Correct 427 ms 44532 KB Output is correct
34 Correct 673 ms 55352 KB Output is correct
35 Correct 353 ms 48128 KB Output is correct
36 Correct 702 ms 51832 KB Output is correct
37 Correct 557 ms 47744 KB Output is correct
38 Correct 329 ms 46244 KB Output is correct
39 Correct 372 ms 48340 KB Output is correct
40 Correct 189 ms 46652 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31636 KB Output is correct
2 Correct 19 ms 31564 KB Output is correct
3 Correct 21 ms 31616 KB Output is correct
4 Correct 21 ms 31608 KB Output is correct
5 Correct 22 ms 31760 KB Output is correct
6 Correct 26 ms 31744 KB Output is correct
7 Correct 28 ms 31664 KB Output is correct
8 Correct 26 ms 31700 KB Output is correct
9 Correct 26 ms 31736 KB Output is correct
10 Correct 20 ms 31720 KB Output is correct
11 Correct 24 ms 31676 KB Output is correct
12 Correct 22 ms 31688 KB Output is correct
13 Correct 23 ms 31700 KB Output is correct
14 Correct 21 ms 31688 KB Output is correct
15 Correct 23 ms 31700 KB Output is correct
16 Correct 22 ms 31700 KB Output is correct
17 Correct 19 ms 31728 KB Output is correct
18 Correct 22 ms 31732 KB Output is correct
19 Correct 19 ms 31636 KB Output is correct
20 Correct 25 ms 31732 KB Output is correct
21 Correct 21 ms 31536 KB Output is correct
22 Correct 88 ms 48400 KB Output is correct
23 Correct 83 ms 47032 KB Output is correct
24 Correct 92 ms 48248 KB Output is correct
25 Correct 81 ms 47152 KB Output is correct
26 Correct 61 ms 42272 KB Output is correct
27 Correct 70 ms 41216 KB Output is correct
28 Correct 57 ms 42260 KB Output is correct
29 Correct 56 ms 41252 KB Output is correct
30 Correct 70 ms 47876 KB Output is correct
31 Correct 84 ms 44228 KB Output is correct
32 Correct 75 ms 41772 KB Output is correct
33 Correct 56 ms 41860 KB Output is correct
34 Correct 68 ms 44476 KB Output is correct
35 Correct 71 ms 44364 KB Output is correct
36 Correct 105 ms 49180 KB Output is correct
37 Correct 169 ms 47572 KB Output is correct
38 Correct 158 ms 47360 KB Output is correct
39 Correct 108 ms 48984 KB Output is correct
40 Correct 129 ms 47316 KB Output is correct
41 Correct 93 ms 42908 KB Output is correct
42 Correct 105 ms 42904 KB Output is correct
43 Correct 94 ms 41672 KB Output is correct
44 Correct 83 ms 41792 KB Output is correct
45 Correct 117 ms 48500 KB Output is correct
46 Correct 97 ms 48552 KB Output is correct
47 Correct 105 ms 43256 KB Output is correct
48 Correct 75 ms 42064 KB Output is correct
49 Correct 78 ms 42252 KB Output is correct
50 Correct 94 ms 44840 KB Output is correct
51 Correct 82 ms 44748 KB Output is correct
52 Correct 95 ms 44840 KB Output is correct
53 Correct 18 ms 31648 KB Output is correct
54 Execution timed out 4034 ms 52856 KB Time limit exceeded
55 Halted 0 ms 0 KB -