oj.uz

답안 #616501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616501 2022-08-01T05:10:30 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 55532 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);
	}
	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);
			cover::add(1, n + 1, -1);
			if(l != 1 || r != n)
				cover::add(l, r + 1, -1);

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

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 16 ms 31640 KB Output is correct
3 Correct 16 ms 31640 KB Output is correct
4 Correct 16 ms 31528 KB Output is correct
5 Correct 20 ms 31700 KB Output is correct
6 Correct 24 ms 31860 KB Output is correct
7 Correct 23 ms 31700 KB Output is correct
8 Correct 24 ms 31820 KB Output is correct
9 Correct 23 ms 31648 KB Output is correct
10 Correct 16 ms 31648 KB Output is correct
11 Correct 21 ms 31700 KB Output is correct
12 Correct 18 ms 31652 KB Output is correct
13 Correct 27 ms 31700 KB Output is correct
14 Correct 18 ms 31700 KB Output is correct
15 Correct 20 ms 31784 KB Output is correct
16 Correct 23 ms 31700 KB Output is correct
17 Correct 19 ms 31644 KB Output is correct
18 Correct 23 ms 31644 KB Output is correct
19 Correct 21 ms 31700 KB Output is correct
20 Correct 22 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 78 ms 48652 KB Output is correct
3 Correct 85 ms 47256 KB Output is correct
4 Correct 81 ms 48552 KB Output is correct
5 Correct 71 ms 47436 KB Output is correct
6 Correct 60 ms 42572 KB Output is correct
7 Correct 47 ms 41420 KB Output is correct
8 Correct 56 ms 42524 KB Output is correct
9 Correct 55 ms 41376 KB Output is correct
10 Correct 76 ms 48156 KB Output is correct
11 Correct 59 ms 44444 KB Output is correct
12 Correct 49 ms 41996 KB Output is correct
13 Correct 50 ms 42100 KB Output is correct
14 Correct 66 ms 44764 KB Output is correct
15 Correct 66 ms 44672 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 16 ms 31640 KB Output is correct
3 Correct 16 ms 31640 KB Output is correct
4 Correct 16 ms 31528 KB Output is correct
5 Correct 20 ms 31700 KB Output is correct
6 Correct 24 ms 31860 KB Output is correct
7 Correct 23 ms 31700 KB Output is correct
8 Correct 24 ms 31820 KB Output is correct
9 Correct 23 ms 31648 KB Output is correct
10 Correct 16 ms 31648 KB Output is correct
11 Correct 21 ms 31700 KB Output is correct
12 Correct 18 ms 31652 KB Output is correct
13 Correct 27 ms 31700 KB Output is correct
14 Correct 18 ms 31700 KB Output is correct
15 Correct 20 ms 31784 KB Output is correct
16 Correct 23 ms 31700 KB Output is correct
17 Correct 19 ms 31644 KB Output is correct
18 Correct 23 ms 31644 KB Output is correct
19 Correct 21 ms 31700 KB Output is correct
20 Correct 22 ms 31700 KB Output is correct
21 Correct 18 ms 31572 KB Output is correct
22 Correct 78 ms 48652 KB Output is correct
23 Correct 85 ms 47256 KB Output is correct
24 Correct 81 ms 48552 KB Output is correct
25 Correct 71 ms 47436 KB Output is correct
26 Correct 60 ms 42572 KB Output is correct
27 Correct 47 ms 41420 KB Output is correct
28 Correct 56 ms 42524 KB Output is correct
29 Correct 55 ms 41376 KB Output is correct
30 Correct 76 ms 48156 KB Output is correct
31 Correct 59 ms 44444 KB Output is correct
32 Correct 49 ms 41996 KB Output is correct
33 Correct 50 ms 42100 KB Output is correct
34 Correct 66 ms 44764 KB Output is correct
35 Correct 66 ms 44672 KB Output is correct
36 Correct 116 ms 49444 KB Output is correct
37 Correct 121 ms 47768 KB Output is correct
38 Correct 123 ms 47616 KB Output is correct
39 Correct 91 ms 49244 KB Output is correct
40 Correct 128 ms 47516 KB Output is correct
41 Correct 70 ms 43264 KB Output is correct
42 Correct 74 ms 43208 KB Output is correct
43 Correct 78 ms 41964 KB Output is correct
44 Correct 78 ms 41972 KB Output is correct
45 Correct 126 ms 48708 KB Output is correct
46 Correct 106 ms 48936 KB Output is correct
47 Correct 94 ms 43424 KB Output is correct
48 Correct 61 ms 42340 KB Output is correct
49 Correct 72 ms 42504 KB Output is correct
50 Correct 78 ms 45172 KB Output is correct
51 Correct 84 ms 45020 KB Output is correct
52 Correct 78 ms 45132 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 31572 KB Output is correct
2 Correct 78 ms 48652 KB Output is correct
3 Correct 85 ms 47256 KB Output is correct
4 Correct 81 ms 48552 KB Output is correct
5 Correct 71 ms 47436 KB Output is correct
6 Correct 60 ms 42572 KB Output is correct
7 Correct 47 ms 41420 KB Output is correct
8 Correct 56 ms 42524 KB Output is correct
9 Correct 55 ms 41376 KB Output is correct
10 Correct 76 ms 48156 KB Output is correct
11 Correct 59 ms 44444 KB Output is correct
12 Correct 49 ms 41996 KB Output is correct
13 Correct 50 ms 42100 KB Output is correct
14 Correct 66 ms 44764 KB Output is correct
15 Correct 66 ms 44672 KB Output is correct
16 Correct 15 ms 31612 KB Output is correct
17 Execution timed out 4030 ms 53292 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 78 ms 48652 KB Output is correct
3 Correct 85 ms 47256 KB Output is correct
4 Correct 81 ms 48552 KB Output is correct
5 Correct 71 ms 47436 KB Output is correct
6 Correct 60 ms 42572 KB Output is correct
7 Correct 47 ms 41420 KB Output is correct
8 Correct 56 ms 42524 KB Output is correct
9 Correct 55 ms 41376 KB Output is correct
10 Correct 76 ms 48156 KB Output is correct
11 Correct 59 ms 44444 KB Output is correct
12 Correct 49 ms 41996 KB Output is correct
13 Correct 50 ms 42100 KB Output is correct
14 Correct 66 ms 44764 KB Output is correct
15 Correct 66 ms 44672 KB Output is correct
16 Correct 17 ms 31640 KB Output is correct
17 Correct 892 ms 49832 KB Output is correct
18 Correct 798 ms 55376 KB Output is correct
19 Correct 680 ms 47692 KB Output is correct
20 Correct 658 ms 54304 KB Output is correct
21 Correct 982 ms 50088 KB Output is correct
22 Correct 795 ms 55256 KB Output is correct
23 Correct 907 ms 47960 KB Output is correct
24 Correct 786 ms 55108 KB Output is correct
25 Correct 733 ms 47804 KB Output is correct
26 Correct 287 ms 46048 KB Output is correct
27 Correct 414 ms 46988 KB Output is correct
28 Correct 475 ms 49024 KB Output is correct
29 Correct 321 ms 46328 KB Output is correct
30 Correct 485 ms 46892 KB Output is correct
31 Correct 635 ms 49884 KB Output is correct
32 Correct 683 ms 53704 KB Output is correct
33 Correct 441 ms 44800 KB Output is correct
34 Correct 635 ms 55532 KB Output is correct
35 Correct 345 ms 48424 KB Output is correct
36 Correct 626 ms 52216 KB Output is correct
37 Correct 552 ms 48076 KB Output is correct
38 Correct 327 ms 46428 KB Output is correct
39 Correct 385 ms 48620 KB Output is correct
40 Correct 217 ms 46940 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31572 KB Output is correct
2 Correct 16 ms 31640 KB Output is correct
3 Correct 16 ms 31640 KB Output is correct
4 Correct 16 ms 31528 KB Output is correct
5 Correct 20 ms 31700 KB Output is correct
6 Correct 24 ms 31860 KB Output is correct
7 Correct 23 ms 31700 KB Output is correct
8 Correct 24 ms 31820 KB Output is correct
9 Correct 23 ms 31648 KB Output is correct
10 Correct 16 ms 31648 KB Output is correct
11 Correct 21 ms 31700 KB Output is correct
12 Correct 18 ms 31652 KB Output is correct
13 Correct 27 ms 31700 KB Output is correct
14 Correct 18 ms 31700 KB Output is correct
15 Correct 20 ms 31784 KB Output is correct
16 Correct 23 ms 31700 KB Output is correct
17 Correct 19 ms 31644 KB Output is correct
18 Correct 23 ms 31644 KB Output is correct
19 Correct 21 ms 31700 KB Output is correct
20 Correct 22 ms 31700 KB Output is correct
21 Correct 18 ms 31572 KB Output is correct
22 Correct 78 ms 48652 KB Output is correct
23 Correct 85 ms 47256 KB Output is correct
24 Correct 81 ms 48552 KB Output is correct
25 Correct 71 ms 47436 KB Output is correct
26 Correct 60 ms 42572 KB Output is correct
27 Correct 47 ms 41420 KB Output is correct
28 Correct 56 ms 42524 KB Output is correct
29 Correct 55 ms 41376 KB Output is correct
30 Correct 76 ms 48156 KB Output is correct
31 Correct 59 ms 44444 KB Output is correct
32 Correct 49 ms 41996 KB Output is correct
33 Correct 50 ms 42100 KB Output is correct
34 Correct 66 ms 44764 KB Output is correct
35 Correct 66 ms 44672 KB Output is correct
36 Correct 116 ms 49444 KB Output is correct
37 Correct 121 ms 47768 KB Output is correct
38 Correct 123 ms 47616 KB Output is correct
39 Correct 91 ms 49244 KB Output is correct
40 Correct 128 ms 47516 KB Output is correct
41 Correct 70 ms 43264 KB Output is correct
42 Correct 74 ms 43208 KB Output is correct
43 Correct 78 ms 41964 KB Output is correct
44 Correct 78 ms 41972 KB Output is correct
45 Correct 126 ms 48708 KB Output is correct
46 Correct 106 ms 48936 KB Output is correct
47 Correct 94 ms 43424 KB Output is correct
48 Correct 61 ms 42340 KB Output is correct
49 Correct 72 ms 42504 KB Output is correct
50 Correct 78 ms 45172 KB Output is correct
51 Correct 84 ms 45020 KB Output is correct
52 Correct 78 ms 45132 KB Output is correct
53 Correct 15 ms 31612 KB Output is correct
54 Execution timed out 4030 ms 53292 KB Time limit exceeded
55 Halted 0 ms 0 KB -