oj.uz

답안 #616235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616235 2022-08-01T03:45:36 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 59096 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 {
	pi t[N * 4];
	int lz[N * 4];

	pi add(pi a, pi 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]);
	}
	pi 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;
		pi 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, 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);

		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.F > posl) {
				i++;
				continue;
			}
			if(be.F < posr) {
				j++;
				continue;
			}
			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];

	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, int, 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::upd(int, int, int, int)':
fish2.cpp:133:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  133 |   for(auto[l, r]:t[v].bad_seg) {
      |           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 16 ms 31580 KB Output is correct
4 Correct 16 ms 31600 KB Output is correct
5 Correct 21 ms 31688 KB Output is correct
6 Correct 26 ms 31776 KB Output is correct
7 Correct 22 ms 31768 KB Output is correct
8 Correct 27 ms 31700 KB Output is correct
9 Correct 25 ms 31772 KB Output is correct
10 Correct 20 ms 31716 KB Output is correct
11 Correct 20 ms 31668 KB Output is correct
12 Correct 19 ms 31660 KB Output is correct
13 Correct 23 ms 31764 KB Output is correct
14 Correct 21 ms 31668 KB Output is correct
15 Correct 21 ms 31700 KB Output is correct
16 Correct 22 ms 31676 KB Output is correct
17 Correct 19 ms 31648 KB Output is correct
18 Correct 24 ms 31672 KB Output is correct
19 Correct 19 ms 31660 KB Output is correct
20 Correct 21 ms 31700 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 83 ms 50600 KB Output is correct
3 Correct 79 ms 48988 KB Output is correct
4 Correct 81 ms 50536 KB Output is correct
5 Correct 78 ms 48972 KB Output is correct
6 Correct 70 ms 44880 KB Output is correct
7 Correct 61 ms 42968 KB Output is correct
8 Correct 64 ms 44984 KB Output is correct
9 Correct 62 ms 42968 KB Output is correct
10 Correct 69 ms 50040 KB Output is correct
11 Correct 66 ms 46128 KB Output is correct
12 Correct 54 ms 43680 KB Output is correct
13 Correct 62 ms 43692 KB Output is correct
14 Correct 72 ms 46668 KB Output is correct
15 Correct 71 ms 46500 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 16 ms 31580 KB Output is correct
4 Correct 16 ms 31600 KB Output is correct
5 Correct 21 ms 31688 KB Output is correct
6 Correct 26 ms 31776 KB Output is correct
7 Correct 22 ms 31768 KB Output is correct
8 Correct 27 ms 31700 KB Output is correct
9 Correct 25 ms 31772 KB Output is correct
10 Correct 20 ms 31716 KB Output is correct
11 Correct 20 ms 31668 KB Output is correct
12 Correct 19 ms 31660 KB Output is correct
13 Correct 23 ms 31764 KB Output is correct
14 Correct 21 ms 31668 KB Output is correct
15 Correct 21 ms 31700 KB Output is correct
16 Correct 22 ms 31676 KB Output is correct
17 Correct 19 ms 31648 KB Output is correct
18 Correct 24 ms 31672 KB Output is correct
19 Correct 19 ms 31660 KB Output is correct
20 Correct 21 ms 31700 KB Output is correct
21 Correct 18 ms 31572 KB Output is correct
22 Correct 83 ms 50600 KB Output is correct
23 Correct 79 ms 48988 KB Output is correct
24 Correct 81 ms 50536 KB Output is correct
25 Correct 78 ms 48972 KB Output is correct
26 Correct 70 ms 44880 KB Output is correct
27 Correct 61 ms 42968 KB Output is correct
28 Correct 64 ms 44984 KB Output is correct
29 Correct 62 ms 42968 KB Output is correct
30 Correct 69 ms 50040 KB Output is correct
31 Correct 66 ms 46128 KB Output is correct
32 Correct 54 ms 43680 KB Output is correct
33 Correct 62 ms 43692 KB Output is correct
34 Correct 72 ms 46668 KB Output is correct
35 Correct 71 ms 46500 KB Output is correct
36 Correct 122 ms 51196 KB Output is correct
37 Correct 150 ms 49404 KB Output is correct
38 Correct 130 ms 49172 KB Output is correct
39 Correct 107 ms 51028 KB Output is correct
40 Correct 141 ms 49192 KB Output is correct
41 Correct 76 ms 45484 KB Output is correct
42 Correct 77 ms 45428 KB Output is correct
43 Correct 86 ms 43452 KB Output is correct
44 Correct 87 ms 43588 KB Output is correct
45 Correct 125 ms 50652 KB Output is correct
46 Correct 105 ms 50808 KB Output is correct
47 Correct 105 ms 45036 KB Output is correct
48 Correct 79 ms 43856 KB Output is correct
49 Correct 84 ms 44052 KB Output is correct
50 Correct 93 ms 47072 KB Output is correct
51 Correct 90 ms 46924 KB Output is correct
52 Correct 87 ms 46992 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 83 ms 50600 KB Output is correct
3 Correct 79 ms 48988 KB Output is correct
4 Correct 81 ms 50536 KB Output is correct
5 Correct 78 ms 48972 KB Output is correct
6 Correct 70 ms 44880 KB Output is correct
7 Correct 61 ms 42968 KB Output is correct
8 Correct 64 ms 44984 KB Output is correct
9 Correct 62 ms 42968 KB Output is correct
10 Correct 69 ms 50040 KB Output is correct
11 Correct 66 ms 46128 KB Output is correct
12 Correct 54 ms 43680 KB Output is correct
13 Correct 62 ms 43692 KB Output is correct
14 Correct 72 ms 46668 KB Output is correct
15 Correct 71 ms 46500 KB Output is correct
16 Correct 17 ms 31644 KB Output is correct
17 Execution timed out 4073 ms 55600 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 83 ms 50600 KB Output is correct
3 Correct 79 ms 48988 KB Output is correct
4 Correct 81 ms 50536 KB Output is correct
5 Correct 78 ms 48972 KB Output is correct
6 Correct 70 ms 44880 KB Output is correct
7 Correct 61 ms 42968 KB Output is correct
8 Correct 64 ms 44984 KB Output is correct
9 Correct 62 ms 42968 KB Output is correct
10 Correct 69 ms 50040 KB Output is correct
11 Correct 66 ms 46128 KB Output is correct
12 Correct 54 ms 43680 KB Output is correct
13 Correct 62 ms 43692 KB Output is correct
14 Correct 72 ms 46668 KB Output is correct
15 Correct 71 ms 46500 KB Output is correct
16 Correct 18 ms 31692 KB Output is correct
17 Correct 1026 ms 52668 KB Output is correct
18 Correct 831 ms 58600 KB Output is correct
19 Correct 779 ms 50424 KB Output is correct
20 Correct 659 ms 57520 KB Output is correct
21 Correct 947 ms 53000 KB Output is correct
22 Correct 808 ms 58500 KB Output is correct
23 Correct 941 ms 50368 KB Output is correct
24 Correct 761 ms 58152 KB Output is correct
25 Correct 809 ms 50348 KB Output is correct
26 Correct 315 ms 49924 KB Output is correct
27 Correct 452 ms 51044 KB Output is correct
28 Correct 570 ms 51900 KB Output is correct
29 Correct 350 ms 50288 KB Output is correct
30 Correct 431 ms 51052 KB Output is correct
31 Correct 628 ms 52940 KB Output is correct
32 Correct 837 ms 56876 KB Output is correct
33 Correct 505 ms 47604 KB Output is correct
34 Correct 704 ms 59096 KB Output is correct
35 Correct 393 ms 51424 KB Output is correct
36 Correct 672 ms 55304 KB Output is correct
37 Correct 593 ms 50728 KB Output is correct
38 Correct 367 ms 49224 KB Output is correct
39 Correct 398 ms 52104 KB Output is correct
40 Correct 213 ms 49980 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 16 ms 31580 KB Output is correct
4 Correct 16 ms 31600 KB Output is correct
5 Correct 21 ms 31688 KB Output is correct
6 Correct 26 ms 31776 KB Output is correct
7 Correct 22 ms 31768 KB Output is correct
8 Correct 27 ms 31700 KB Output is correct
9 Correct 25 ms 31772 KB Output is correct
10 Correct 20 ms 31716 KB Output is correct
11 Correct 20 ms 31668 KB Output is correct
12 Correct 19 ms 31660 KB Output is correct
13 Correct 23 ms 31764 KB Output is correct
14 Correct 21 ms 31668 KB Output is correct
15 Correct 21 ms 31700 KB Output is correct
16 Correct 22 ms 31676 KB Output is correct
17 Correct 19 ms 31648 KB Output is correct
18 Correct 24 ms 31672 KB Output is correct
19 Correct 19 ms 31660 KB Output is correct
20 Correct 21 ms 31700 KB Output is correct
21 Correct 18 ms 31572 KB Output is correct
22 Correct 83 ms 50600 KB Output is correct
23 Correct 79 ms 48988 KB Output is correct
24 Correct 81 ms 50536 KB Output is correct
25 Correct 78 ms 48972 KB Output is correct
26 Correct 70 ms 44880 KB Output is correct
27 Correct 61 ms 42968 KB Output is correct
28 Correct 64 ms 44984 KB Output is correct
29 Correct 62 ms 42968 KB Output is correct
30 Correct 69 ms 50040 KB Output is correct
31 Correct 66 ms 46128 KB Output is correct
32 Correct 54 ms 43680 KB Output is correct
33 Correct 62 ms 43692 KB Output is correct
34 Correct 72 ms 46668 KB Output is correct
35 Correct 71 ms 46500 KB Output is correct
36 Correct 122 ms 51196 KB Output is correct
37 Correct 150 ms 49404 KB Output is correct
38 Correct 130 ms 49172 KB Output is correct
39 Correct 107 ms 51028 KB Output is correct
40 Correct 141 ms 49192 KB Output is correct
41 Correct 76 ms 45484 KB Output is correct
42 Correct 77 ms 45428 KB Output is correct
43 Correct 86 ms 43452 KB Output is correct
44 Correct 87 ms 43588 KB Output is correct
45 Correct 125 ms 50652 KB Output is correct
46 Correct 105 ms 50808 KB Output is correct
47 Correct 105 ms 45036 KB Output is correct
48 Correct 79 ms 43856 KB Output is correct
49 Correct 84 ms 44052 KB Output is correct
50 Correct 93 ms 47072 KB Output is correct
51 Correct 90 ms 46924 KB Output is correct
52 Correct 87 ms 46992 KB Output is correct
53 Correct 17 ms 31644 KB Output is correct
54 Execution timed out 4073 ms 55600 KB Time limit exceeded
55 Halted 0 ms 0 KB -