oj.uz

Submission #616008

# Submission time Handle Problem Language Result Execution time Memory
616008 2022-07-31T18:03:19 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 56792 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.S + be.S < min(a[he.F - 1], a[be.F + 1])) {
				if(he.F <= posl && be.F >= posr) {
					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:86:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |   for(auto[pos, sum]:t[v * 2 + 1].bad_pref) if(sum + t[v * 2].sum < a[pos + 1])
      |           ^
fish2.cpp:88:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   88 |   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:126:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  126 |   for(auto[l, r]:t[v].bad_seg) {
      |           ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31536 KB Output is correct
2 Correct 15 ms 31648 KB Output is correct
3 Correct 16 ms 31556 KB Output is correct
4 Correct 15 ms 31600 KB Output is correct
5 Correct 21 ms 31728 KB Output is correct
6 Correct 26 ms 31740 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 34 ms 31772 KB Output is correct
9 Correct 26 ms 31672 KB Output is correct
10 Correct 21 ms 31652 KB Output is correct
11 Correct 20 ms 31700 KB Output is correct
12 Correct 19 ms 31640 KB Output is correct
13 Correct 23 ms 31716 KB Output is correct
14 Correct 21 ms 31744 KB Output is correct
15 Correct 20 ms 31736 KB Output is correct
16 Correct 24 ms 31716 KB Output is correct
17 Correct 23 ms 31732 KB Output is correct
18 Correct 22 ms 31700 KB Output is correct
19 Correct 18 ms 31688 KB Output is correct
20 Correct 19 ms 31700 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31608 KB Output is correct
2 Correct 78 ms 49872 KB Output is correct
3 Correct 76 ms 48524 KB Output is correct
4 Correct 81 ms 49852 KB Output is correct
5 Correct 82 ms 48700 KB Output is correct
6 Correct 60 ms 43936 KB Output is correct
7 Correct 50 ms 42728 KB Output is correct
8 Correct 60 ms 43984 KB Output is correct
9 Correct 66 ms 42884 KB Output is correct
10 Correct 70 ms 49412 KB Output is correct
11 Correct 70 ms 45836 KB Output is correct
12 Correct 53 ms 43336 KB Output is correct
13 Correct 53 ms 43388 KB Output is correct
14 Correct 71 ms 46100 KB Output is correct
15 Correct 71 ms 45956 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31536 KB Output is correct
2 Correct 15 ms 31648 KB Output is correct
3 Correct 16 ms 31556 KB Output is correct
4 Correct 15 ms 31600 KB Output is correct
5 Correct 21 ms 31728 KB Output is correct
6 Correct 26 ms 31740 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 34 ms 31772 KB Output is correct
9 Correct 26 ms 31672 KB Output is correct
10 Correct 21 ms 31652 KB Output is correct
11 Correct 20 ms 31700 KB Output is correct
12 Correct 19 ms 31640 KB Output is correct
13 Correct 23 ms 31716 KB Output is correct
14 Correct 21 ms 31744 KB Output is correct
15 Correct 20 ms 31736 KB Output is correct
16 Correct 24 ms 31716 KB Output is correct
17 Correct 23 ms 31732 KB Output is correct
18 Correct 22 ms 31700 KB Output is correct
19 Correct 18 ms 31688 KB Output is correct
20 Correct 19 ms 31700 KB Output is correct
21 Correct 15 ms 31608 KB Output is correct
22 Correct 78 ms 49872 KB Output is correct
23 Correct 76 ms 48524 KB Output is correct
24 Correct 81 ms 49852 KB Output is correct
25 Correct 82 ms 48700 KB Output is correct
26 Correct 60 ms 43936 KB Output is correct
27 Correct 50 ms 42728 KB Output is correct
28 Correct 60 ms 43984 KB Output is correct
29 Correct 66 ms 42884 KB Output is correct
30 Correct 70 ms 49412 KB Output is correct
31 Correct 70 ms 45836 KB Output is correct
32 Correct 53 ms 43336 KB Output is correct
33 Correct 53 ms 43388 KB Output is correct
34 Correct 71 ms 46100 KB Output is correct
35 Correct 71 ms 45956 KB Output is correct
36 Correct 135 ms 50688 KB Output is correct
37 Correct 162 ms 49100 KB Output is correct
38 Correct 133 ms 48872 KB Output is correct
39 Correct 112 ms 50484 KB Output is correct
40 Correct 133 ms 48908 KB Output is correct
41 Correct 83 ms 44488 KB Output is correct
42 Correct 83 ms 44544 KB Output is correct
43 Correct 92 ms 43216 KB Output is correct
44 Correct 86 ms 43316 KB Output is correct
45 Correct 121 ms 50104 KB Output is correct
46 Correct 102 ms 50108 KB Output is correct
47 Correct 129 ms 44772 KB Output is correct
48 Correct 70 ms 43700 KB Output is correct
49 Correct 83 ms 43712 KB Output is correct
50 Correct 96 ms 46432 KB Output is correct
51 Correct 89 ms 46200 KB Output is correct
52 Correct 87 ms 46412 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31608 KB Output is correct
2 Correct 78 ms 49872 KB Output is correct
3 Correct 76 ms 48524 KB Output is correct
4 Correct 81 ms 49852 KB Output is correct
5 Correct 82 ms 48700 KB Output is correct
6 Correct 60 ms 43936 KB Output is correct
7 Correct 50 ms 42728 KB Output is correct
8 Correct 60 ms 43984 KB Output is correct
9 Correct 66 ms 42884 KB Output is correct
10 Correct 70 ms 49412 KB Output is correct
11 Correct 70 ms 45836 KB Output is correct
12 Correct 53 ms 43336 KB Output is correct
13 Correct 53 ms 43388 KB Output is correct
14 Correct 71 ms 46100 KB Output is correct
15 Correct 71 ms 45956 KB Output is correct
16 Correct 18 ms 31572 KB Output is correct
17 Execution timed out 4027 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 15 ms 31608 KB Output is correct
2 Correct 78 ms 49872 KB Output is correct
3 Correct 76 ms 48524 KB Output is correct
4 Correct 81 ms 49852 KB Output is correct
5 Correct 82 ms 48700 KB Output is correct
6 Correct 60 ms 43936 KB Output is correct
7 Correct 50 ms 42728 KB Output is correct
8 Correct 60 ms 43984 KB Output is correct
9 Correct 66 ms 42884 KB Output is correct
10 Correct 70 ms 49412 KB Output is correct
11 Correct 70 ms 45836 KB Output is correct
12 Correct 53 ms 43336 KB Output is correct
13 Correct 53 ms 43388 KB Output is correct
14 Correct 71 ms 46100 KB Output is correct
15 Correct 71 ms 45956 KB Output is correct
16 Correct 15 ms 31572 KB Output is correct
17 Correct 1022 ms 51160 KB Output is correct
18 Correct 855 ms 56780 KB Output is correct
19 Correct 825 ms 49016 KB Output is correct
20 Correct 665 ms 55604 KB Output is correct
21 Correct 985 ms 51424 KB Output is correct
22 Correct 850 ms 56504 KB Output is correct
23 Correct 933 ms 49128 KB Output is correct
24 Correct 782 ms 56260 KB Output is correct
25 Correct 876 ms 49120 KB Output is correct
26 Correct 305 ms 47428 KB Output is correct
27 Correct 430 ms 48356 KB Output is correct
28 Correct 542 ms 50336 KB Output is correct
29 Correct 349 ms 47720 KB Output is correct
30 Correct 409 ms 48376 KB Output is correct
31 Correct 662 ms 51180 KB Output is correct
32 Correct 832 ms 55016 KB Output is correct
33 Correct 519 ms 46028 KB Output is correct
34 Correct 758 ms 56792 KB Output is correct
35 Correct 440 ms 49664 KB Output is correct
36 Correct 717 ms 53412 KB Output is correct
37 Correct 562 ms 49292 KB Output is correct
38 Correct 379 ms 47668 KB Output is correct
39 Correct 423 ms 49968 KB Output is correct
40 Correct 204 ms 48372 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31536 KB Output is correct
2 Correct 15 ms 31648 KB Output is correct
3 Correct 16 ms 31556 KB Output is correct
4 Correct 15 ms 31600 KB Output is correct
5 Correct 21 ms 31728 KB Output is correct
6 Correct 26 ms 31740 KB Output is correct
7 Correct 20 ms 31700 KB Output is correct
8 Correct 34 ms 31772 KB Output is correct
9 Correct 26 ms 31672 KB Output is correct
10 Correct 21 ms 31652 KB Output is correct
11 Correct 20 ms 31700 KB Output is correct
12 Correct 19 ms 31640 KB Output is correct
13 Correct 23 ms 31716 KB Output is correct
14 Correct 21 ms 31744 KB Output is correct
15 Correct 20 ms 31736 KB Output is correct
16 Correct 24 ms 31716 KB Output is correct
17 Correct 23 ms 31732 KB Output is correct
18 Correct 22 ms 31700 KB Output is correct
19 Correct 18 ms 31688 KB Output is correct
20 Correct 19 ms 31700 KB Output is correct
21 Correct 15 ms 31608 KB Output is correct
22 Correct 78 ms 49872 KB Output is correct
23 Correct 76 ms 48524 KB Output is correct
24 Correct 81 ms 49852 KB Output is correct
25 Correct 82 ms 48700 KB Output is correct
26 Correct 60 ms 43936 KB Output is correct
27 Correct 50 ms 42728 KB Output is correct
28 Correct 60 ms 43984 KB Output is correct
29 Correct 66 ms 42884 KB Output is correct
30 Correct 70 ms 49412 KB Output is correct
31 Correct 70 ms 45836 KB Output is correct
32 Correct 53 ms 43336 KB Output is correct
33 Correct 53 ms 43388 KB Output is correct
34 Correct 71 ms 46100 KB Output is correct
35 Correct 71 ms 45956 KB Output is correct
36 Correct 135 ms 50688 KB Output is correct
37 Correct 162 ms 49100 KB Output is correct
38 Correct 133 ms 48872 KB Output is correct
39 Correct 112 ms 50484 KB Output is correct
40 Correct 133 ms 48908 KB Output is correct
41 Correct 83 ms 44488 KB Output is correct
42 Correct 83 ms 44544 KB Output is correct
43 Correct 92 ms 43216 KB Output is correct
44 Correct 86 ms 43316 KB Output is correct
45 Correct 121 ms 50104 KB Output is correct
46 Correct 102 ms 50108 KB Output is correct
47 Correct 129 ms 44772 KB Output is correct
48 Correct 70 ms 43700 KB Output is correct
49 Correct 83 ms 43712 KB Output is correct
50 Correct 96 ms 46432 KB Output is correct
51 Correct 89 ms 46200 KB Output is correct
52 Correct 87 ms 46412 KB Output is correct
53 Correct 18 ms 31572 KB Output is correct
54 Execution timed out 4027 ms 54200 KB Time limit exceeded
55 Halted 0 ms 0 KB -