oj.uz

답안 #615984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615984 2022-07-31T17:16:02 Z cheissmart Fish 2 (JOI22_fish2) C++14
25 / 100
 4000 ms 58888 KB 
#include <bits/stdc++.h>
#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 = {INF, INF};
		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);

			pi 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: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::build(int, int, int)':
fish2.cpp:117:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  117 |   for(auto[l, r]:t[v].bad_seg)
      |           ^
fish2.cpp: In function 'void seg::upd(int, int, int, int)':
fish2.cpp:121:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  121 |   for(auto[l, r]:t[v].bad_seg)
      |           ^
fish2.cpp:141:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  141 |   for(auto[l, r]:t[v].bad_seg)
      |           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31588 KB Output is correct
2 Correct 17 ms 31644 KB Output is correct
3 Correct 17 ms 31632 KB Output is correct
4 Correct 16 ms 31572 KB Output is correct
5 Correct 29 ms 31688 KB Output is correct
6 Correct 47 ms 31744 KB Output is correct
7 Correct 29 ms 31828 KB Output is correct
8 Correct 35 ms 31780 KB Output is correct
9 Correct 40 ms 31700 KB Output is correct
10 Correct 19 ms 31700 KB Output is correct
11 Correct 20 ms 31664 KB Output is correct
12 Correct 20 ms 31772 KB Output is correct
13 Correct 30 ms 31700 KB Output is correct
14 Correct 23 ms 31636 KB Output is correct
15 Correct 26 ms 31772 KB Output is correct
16 Correct 36 ms 31732 KB Output is correct
17 Correct 22 ms 31656 KB Output is correct
18 Correct 31 ms 31740 KB Output is correct
19 Correct 24 ms 31668 KB Output is correct
20 Correct 20 ms 31692 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 89 ms 50716 KB Output is correct
3 Correct 79 ms 49276 KB Output is correct
4 Correct 86 ms 51224 KB Output is correct
5 Correct 80 ms 49500 KB Output is correct
6 Correct 63 ms 44896 KB Output is correct
7 Correct 53 ms 42980 KB Output is correct
8 Correct 72 ms 44976 KB Output is correct
9 Correct 54 ms 43024 KB Output is correct
10 Correct 78 ms 51048 KB Output is correct
11 Correct 67 ms 46508 KB Output is correct
12 Correct 56 ms 43688 KB Output is correct
13 Correct 55 ms 43596 KB Output is correct
14 Correct 70 ms 46692 KB Output is correct
15 Correct 73 ms 46668 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31588 KB Output is correct
2 Correct 17 ms 31644 KB Output is correct
3 Correct 17 ms 31632 KB Output is correct
4 Correct 16 ms 31572 KB Output is correct
5 Correct 29 ms 31688 KB Output is correct
6 Correct 47 ms 31744 KB Output is correct
7 Correct 29 ms 31828 KB Output is correct
8 Correct 35 ms 31780 KB Output is correct
9 Correct 40 ms 31700 KB Output is correct
10 Correct 19 ms 31700 KB Output is correct
11 Correct 20 ms 31664 KB Output is correct
12 Correct 20 ms 31772 KB Output is correct
13 Correct 30 ms 31700 KB Output is correct
14 Correct 23 ms 31636 KB Output is correct
15 Correct 26 ms 31772 KB Output is correct
16 Correct 36 ms 31732 KB Output is correct
17 Correct 22 ms 31656 KB Output is correct
18 Correct 31 ms 31740 KB Output is correct
19 Correct 24 ms 31668 KB Output is correct
20 Correct 20 ms 31692 KB Output is correct
21 Correct 16 ms 31572 KB Output is correct
22 Correct 89 ms 50716 KB Output is correct
23 Correct 79 ms 49276 KB Output is correct
24 Correct 86 ms 51224 KB Output is correct
25 Correct 80 ms 49500 KB Output is correct
26 Correct 63 ms 44896 KB Output is correct
27 Correct 53 ms 42980 KB Output is correct
28 Correct 72 ms 44976 KB Output is correct
29 Correct 54 ms 43024 KB Output is correct
30 Correct 78 ms 51048 KB Output is correct
31 Correct 67 ms 46508 KB Output is correct
32 Correct 56 ms 43688 KB Output is correct
33 Correct 55 ms 43596 KB Output is correct
34 Correct 70 ms 46692 KB Output is correct
35 Correct 73 ms 46668 KB Output is correct
36 Correct 292 ms 51860 KB Output is correct
37 Correct 397 ms 49740 KB Output is correct
38 Correct 417 ms 49396 KB Output is correct
39 Correct 223 ms 52016 KB Output is correct
40 Correct 423 ms 49496 KB Output is correct
41 Correct 78 ms 45396 KB Output is correct
42 Correct 88 ms 45420 KB Output is correct
43 Correct 127 ms 43468 KB Output is correct
44 Correct 124 ms 43532 KB Output is correct
45 Correct 261 ms 51308 KB Output is correct
46 Correct 251 ms 51364 KB Output is correct
47 Correct 254 ms 45132 KB Output is correct
48 Correct 96 ms 44116 KB Output is correct
49 Correct 101 ms 43972 KB Output is correct
50 Correct 96 ms 47000 KB Output is correct
51 Correct 103 ms 46892 KB Output is correct
52 Correct 124 ms 47088 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 89 ms 50716 KB Output is correct
3 Correct 79 ms 49276 KB Output is correct
4 Correct 86 ms 51224 KB Output is correct
5 Correct 80 ms 49500 KB Output is correct
6 Correct 63 ms 44896 KB Output is correct
7 Correct 53 ms 42980 KB Output is correct
8 Correct 72 ms 44976 KB Output is correct
9 Correct 54 ms 43024 KB Output is correct
10 Correct 78 ms 51048 KB Output is correct
11 Correct 67 ms 46508 KB Output is correct
12 Correct 56 ms 43688 KB Output is correct
13 Correct 55 ms 43596 KB Output is correct
14 Correct 70 ms 46692 KB Output is correct
15 Correct 73 ms 46668 KB Output is correct
16 Correct 17 ms 31644 KB Output is correct
17 Execution timed out 4094 ms 51040 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 89 ms 50716 KB Output is correct
3 Correct 79 ms 49276 KB Output is correct
4 Correct 86 ms 51224 KB Output is correct
5 Correct 80 ms 49500 KB Output is correct
6 Correct 63 ms 44896 KB Output is correct
7 Correct 53 ms 42980 KB Output is correct
8 Correct 72 ms 44976 KB Output is correct
9 Correct 54 ms 43024 KB Output is correct
10 Correct 78 ms 51048 KB Output is correct
11 Correct 67 ms 46508 KB Output is correct
12 Correct 56 ms 43688 KB Output is correct
13 Correct 55 ms 43596 KB Output is correct
14 Correct 70 ms 46692 KB Output is correct
15 Correct 73 ms 46668 KB Output is correct
16 Correct 16 ms 31532 KB Output is correct
17 Correct 3603 ms 53548 KB Output is correct
18 Correct 2181 ms 58888 KB Output is correct
19 Execution timed out 4061 ms 50988 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31588 KB Output is correct
2 Correct 17 ms 31644 KB Output is correct
3 Correct 17 ms 31632 KB Output is correct
4 Correct 16 ms 31572 KB Output is correct
5 Correct 29 ms 31688 KB Output is correct
6 Correct 47 ms 31744 KB Output is correct
7 Correct 29 ms 31828 KB Output is correct
8 Correct 35 ms 31780 KB Output is correct
9 Correct 40 ms 31700 KB Output is correct
10 Correct 19 ms 31700 KB Output is correct
11 Correct 20 ms 31664 KB Output is correct
12 Correct 20 ms 31772 KB Output is correct
13 Correct 30 ms 31700 KB Output is correct
14 Correct 23 ms 31636 KB Output is correct
15 Correct 26 ms 31772 KB Output is correct
16 Correct 36 ms 31732 KB Output is correct
17 Correct 22 ms 31656 KB Output is correct
18 Correct 31 ms 31740 KB Output is correct
19 Correct 24 ms 31668 KB Output is correct
20 Correct 20 ms 31692 KB Output is correct
21 Correct 16 ms 31572 KB Output is correct
22 Correct 89 ms 50716 KB Output is correct
23 Correct 79 ms 49276 KB Output is correct
24 Correct 86 ms 51224 KB Output is correct
25 Correct 80 ms 49500 KB Output is correct
26 Correct 63 ms 44896 KB Output is correct
27 Correct 53 ms 42980 KB Output is correct
28 Correct 72 ms 44976 KB Output is correct
29 Correct 54 ms 43024 KB Output is correct
30 Correct 78 ms 51048 KB Output is correct
31 Correct 67 ms 46508 KB Output is correct
32 Correct 56 ms 43688 KB Output is correct
33 Correct 55 ms 43596 KB Output is correct
34 Correct 70 ms 46692 KB Output is correct
35 Correct 73 ms 46668 KB Output is correct
36 Correct 292 ms 51860 KB Output is correct
37 Correct 397 ms 49740 KB Output is correct
38 Correct 417 ms 49396 KB Output is correct
39 Correct 223 ms 52016 KB Output is correct
40 Correct 423 ms 49496 KB Output is correct
41 Correct 78 ms 45396 KB Output is correct
42 Correct 88 ms 45420 KB Output is correct
43 Correct 127 ms 43468 KB Output is correct
44 Correct 124 ms 43532 KB Output is correct
45 Correct 261 ms 51308 KB Output is correct
46 Correct 251 ms 51364 KB Output is correct
47 Correct 254 ms 45132 KB Output is correct
48 Correct 96 ms 44116 KB Output is correct
49 Correct 101 ms 43972 KB Output is correct
50 Correct 96 ms 47000 KB Output is correct
51 Correct 103 ms 46892 KB Output is correct
52 Correct 124 ms 47088 KB Output is correct
53 Correct 17 ms 31644 KB Output is correct
54 Execution timed out 4094 ms 51040 KB Time limit exceeded
55 Halted 0 ms 0 KB -