oj.uz

Submission #616236

# Submission time Handle Problem Language Result Execution time Memory
616236 2022-08-01T03:47:09 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 56856 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);
		
		int szi = SZ(t[v * 2].bad_suff);
		int szj = SZ(t[v * 2 + 1].bad_pref);
		for(int i = 0, j = 0; i < szi && j < szj; ) {
			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:135:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  135 |   for(auto[l, r]:t[v].bad_seg) {
      |           ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 15 ms 31628 KB Output is correct
3 Correct 20 ms 31572 KB Output is correct
4 Correct 16 ms 31632 KB Output is correct
5 Correct 22 ms 31708 KB Output is correct
6 Correct 26 ms 31700 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 27 ms 31872 KB Output is correct
9 Correct 25 ms 31828 KB Output is correct
10 Correct 19 ms 31672 KB Output is correct
11 Correct 22 ms 31828 KB Output is correct
12 Correct 19 ms 31700 KB Output is correct
13 Correct 24 ms 31748 KB Output is correct
14 Correct 19 ms 31756 KB Output is correct
15 Correct 21 ms 31704 KB Output is correct
16 Correct 22 ms 31744 KB Output is correct
17 Correct 20 ms 31708 KB Output is correct
18 Correct 27 ms 31744 KB Output is correct
19 Correct 19 ms 31744 KB Output is correct
20 Correct 23 ms 31628 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31616 KB Output is correct
2 Correct 82 ms 49916 KB Output is correct
3 Correct 82 ms 48676 KB Output is correct
4 Correct 86 ms 49848 KB Output is correct
5 Correct 84 ms 48716 KB Output is correct
6 Correct 61 ms 43984 KB Output is correct
7 Correct 67 ms 42716 KB Output is correct
8 Correct 63 ms 44016 KB Output is correct
9 Correct 58 ms 42708 KB Output is correct
10 Correct 78 ms 49476 KB Output is correct
11 Correct 69 ms 45836 KB Output is correct
12 Correct 68 ms 43340 KB Output is correct
13 Correct 54 ms 43388 KB Output is correct
14 Correct 73 ms 46012 KB Output is correct
15 Correct 70 ms 45960 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 15 ms 31628 KB Output is correct
3 Correct 20 ms 31572 KB Output is correct
4 Correct 16 ms 31632 KB Output is correct
5 Correct 22 ms 31708 KB Output is correct
6 Correct 26 ms 31700 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 27 ms 31872 KB Output is correct
9 Correct 25 ms 31828 KB Output is correct
10 Correct 19 ms 31672 KB Output is correct
11 Correct 22 ms 31828 KB Output is correct
12 Correct 19 ms 31700 KB Output is correct
13 Correct 24 ms 31748 KB Output is correct
14 Correct 19 ms 31756 KB Output is correct
15 Correct 21 ms 31704 KB Output is correct
16 Correct 22 ms 31744 KB Output is correct
17 Correct 20 ms 31708 KB Output is correct
18 Correct 27 ms 31744 KB Output is correct
19 Correct 19 ms 31744 KB Output is correct
20 Correct 23 ms 31628 KB Output is correct
21 Correct 19 ms 31616 KB Output is correct
22 Correct 82 ms 49916 KB Output is correct
23 Correct 82 ms 48676 KB Output is correct
24 Correct 86 ms 49848 KB Output is correct
25 Correct 84 ms 48716 KB Output is correct
26 Correct 61 ms 43984 KB Output is correct
27 Correct 67 ms 42716 KB Output is correct
28 Correct 63 ms 44016 KB Output is correct
29 Correct 58 ms 42708 KB Output is correct
30 Correct 78 ms 49476 KB Output is correct
31 Correct 69 ms 45836 KB Output is correct
32 Correct 68 ms 43340 KB Output is correct
33 Correct 54 ms 43388 KB Output is correct
34 Correct 73 ms 46012 KB Output is correct
35 Correct 70 ms 45960 KB Output is correct
36 Correct 119 ms 50684 KB Output is correct
37 Correct 139 ms 49116 KB Output is correct
38 Correct 134 ms 48844 KB Output is correct
39 Correct 120 ms 50496 KB Output is correct
40 Correct 148 ms 48856 KB Output is correct
41 Correct 81 ms 44456 KB Output is correct
42 Correct 75 ms 44496 KB Output is correct
43 Correct 84 ms 43360 KB Output is correct
44 Correct 97 ms 43332 KB Output is correct
45 Correct 124 ms 49940 KB Output is correct
46 Correct 101 ms 50136 KB Output is correct
47 Correct 98 ms 44888 KB Output is correct
48 Correct 70 ms 43636 KB Output is correct
49 Correct 81 ms 43776 KB Output is correct
50 Correct 85 ms 46436 KB Output is correct
51 Correct 87 ms 46280 KB Output is correct
52 Correct 89 ms 46628 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31616 KB Output is correct
2 Correct 82 ms 49916 KB Output is correct
3 Correct 82 ms 48676 KB Output is correct
4 Correct 86 ms 49848 KB Output is correct
5 Correct 84 ms 48716 KB Output is correct
6 Correct 61 ms 43984 KB Output is correct
7 Correct 67 ms 42716 KB Output is correct
8 Correct 63 ms 44016 KB Output is correct
9 Correct 58 ms 42708 KB Output is correct
10 Correct 78 ms 49476 KB Output is correct
11 Correct 69 ms 45836 KB Output is correct
12 Correct 68 ms 43340 KB Output is correct
13 Correct 54 ms 43388 KB Output is correct
14 Correct 73 ms 46012 KB Output is correct
15 Correct 70 ms 45960 KB Output is correct
16 Correct 16 ms 31572 KB Output is correct
17 Execution timed out 4091 ms 54200 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31616 KB Output is correct
2 Correct 82 ms 49916 KB Output is correct
3 Correct 82 ms 48676 KB Output is correct
4 Correct 86 ms 49848 KB Output is correct
5 Correct 84 ms 48716 KB Output is correct
6 Correct 61 ms 43984 KB Output is correct
7 Correct 67 ms 42716 KB Output is correct
8 Correct 63 ms 44016 KB Output is correct
9 Correct 58 ms 42708 KB Output is correct
10 Correct 78 ms 49476 KB Output is correct
11 Correct 69 ms 45836 KB Output is correct
12 Correct 68 ms 43340 KB Output is correct
13 Correct 54 ms 43388 KB Output is correct
14 Correct 73 ms 46012 KB Output is correct
15 Correct 70 ms 45960 KB Output is correct
16 Correct 17 ms 31572 KB Output is correct
17 Correct 1029 ms 51080 KB Output is correct
18 Correct 832 ms 56772 KB Output is correct
19 Correct 744 ms 49092 KB Output is correct
20 Correct 675 ms 55636 KB Output is correct
21 Correct 1033 ms 51624 KB Output is correct
22 Correct 874 ms 56468 KB Output is correct
23 Correct 913 ms 49192 KB Output is correct
24 Correct 778 ms 56140 KB Output is correct
25 Correct 842 ms 49132 KB Output is correct
26 Correct 311 ms 47436 KB Output is correct
27 Correct 419 ms 48404 KB Output is correct
28 Correct 517 ms 50244 KB Output is correct
29 Correct 364 ms 47808 KB Output is correct
30 Correct 450 ms 48288 KB Output is correct
31 Correct 630 ms 51208 KB Output is correct
32 Correct 773 ms 54896 KB Output is correct
33 Correct 513 ms 46064 KB Output is correct
34 Correct 715 ms 56856 KB Output is correct
35 Correct 407 ms 49636 KB Output is correct
36 Correct 680 ms 53480 KB Output is correct
37 Correct 653 ms 49264 KB Output is correct
38 Correct 399 ms 47940 KB Output is correct
39 Correct 414 ms 49992 KB Output is correct
40 Correct 200 ms 48212 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 15 ms 31628 KB Output is correct
3 Correct 20 ms 31572 KB Output is correct
4 Correct 16 ms 31632 KB Output is correct
5 Correct 22 ms 31708 KB Output is correct
6 Correct 26 ms 31700 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 27 ms 31872 KB Output is correct
9 Correct 25 ms 31828 KB Output is correct
10 Correct 19 ms 31672 KB Output is correct
11 Correct 22 ms 31828 KB Output is correct
12 Correct 19 ms 31700 KB Output is correct
13 Correct 24 ms 31748 KB Output is correct
14 Correct 19 ms 31756 KB Output is correct
15 Correct 21 ms 31704 KB Output is correct
16 Correct 22 ms 31744 KB Output is correct
17 Correct 20 ms 31708 KB Output is correct
18 Correct 27 ms 31744 KB Output is correct
19 Correct 19 ms 31744 KB Output is correct
20 Correct 23 ms 31628 KB Output is correct
21 Correct 19 ms 31616 KB Output is correct
22 Correct 82 ms 49916 KB Output is correct
23 Correct 82 ms 48676 KB Output is correct
24 Correct 86 ms 49848 KB Output is correct
25 Correct 84 ms 48716 KB Output is correct
26 Correct 61 ms 43984 KB Output is correct
27 Correct 67 ms 42716 KB Output is correct
28 Correct 63 ms 44016 KB Output is correct
29 Correct 58 ms 42708 KB Output is correct
30 Correct 78 ms 49476 KB Output is correct
31 Correct 69 ms 45836 KB Output is correct
32 Correct 68 ms 43340 KB Output is correct
33 Correct 54 ms 43388 KB Output is correct
34 Correct 73 ms 46012 KB Output is correct
35 Correct 70 ms 45960 KB Output is correct
36 Correct 119 ms 50684 KB Output is correct
37 Correct 139 ms 49116 KB Output is correct
38 Correct 134 ms 48844 KB Output is correct
39 Correct 120 ms 50496 KB Output is correct
40 Correct 148 ms 48856 KB Output is correct
41 Correct 81 ms 44456 KB Output is correct
42 Correct 75 ms 44496 KB Output is correct
43 Correct 84 ms 43360 KB Output is correct
44 Correct 97 ms 43332 KB Output is correct
45 Correct 124 ms 49940 KB Output is correct
46 Correct 101 ms 50136 KB Output is correct
47 Correct 98 ms 44888 KB Output is correct
48 Correct 70 ms 43636 KB Output is correct
49 Correct 81 ms 43776 KB Output is correct
50 Correct 85 ms 46436 KB Output is correct
51 Correct 87 ms 46280 KB Output is correct
52 Correct 89 ms 46628 KB Output is correct
53 Correct 16 ms 31572 KB Output is correct
54 Execution timed out 4091 ms 54200 KB Time limit exceeded
55 Halted 0 ms 0 KB -