oj.uz

답안 #616777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616777 2022-08-01T06:43:01 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 516360 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];
	char 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);
	}
	void add(int l, int r, int x) {
		if(l == 1 && r == n + 1) return;
		_add(l, r, x);
	}
	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 {
	template<class A, class B> struct DS {
		pair<A, B> a[32];
		int sz;
		DS() { sz = 0; }
		void clear() { sz = 0; }
		void EB(A x, B y) { a[sz++] = {x, y}; }
		void PB(pair<A, B> p) { a[sz++] = p; }
		int size() { return sz; }
		pair<A, B>& operator[](int i) { return a[i]; }
		void resize(int s) { sz = s; }
	};

	struct node {
		DS<int, ll> bad_pref, bad_suff;
		DS<int, int> bad_seg;
		ll sum;
	} t[N * 4];
	void pull(int v, int posl = INF, int posr = 0) {
		for(int i = 0; i < t[v * 2].bad_pref.sz; i++)
			t[v].bad_pref.PB(t[v * 2].bad_pref[i]);
		for(int i = 0; i < t[v * 2 + 1].bad_suff.sz; i++)
			t[v].bad_suff.PB(t[v * 2 + 1].bad_suff[i]);

		for(int i = 0; i < t[v * 2 + 1].bad_pref.sz; i++) {
			auto[pos, sum] = t[v * 2 + 1].bad_pref[i];
			if(sum + t[v * 2].sum < a[pos + 1])
				t[v].bad_pref.EB(pos, sum + t[v * 2].sum);
		}
		for(int i = 0; i < t[v * 2].bad_suff.sz; i++) {
			auto[pos, sum] = t[v * 2].bad_suff[i];
			if(sum + t[v * 2 + 1].sum < a[pos - 1])
				t[v].bad_suff.EB(pos, sum + t[v * 2 + 1].sum);
		}

		int szi = t[v * 2].bad_suff.sz;
		int szj = t[v * 2 + 1].bad_pref.sz;
		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) {
		int j = 0;
		for(int i = 0; i < SZ(t[v].bad_seg); i++) {
			auto [l, r] = t[v].bad_seg[i];
			if(r < pos - 1 || l > pos + 1) {
				t[v].bad_seg[j++] = t[v].bad_seg[i];
			} else {
				cover::add(l, r + 1, -1);
			}
		}
		t[v].bad_seg.resize(j);

		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);
			if(l != 1 || r != n)
				cover::add(l, r + 1, -1);

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

			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:81:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   81 |    auto[pos, sum] = t[v * 2 + 1].bad_pref[i];
      |        ^
fish2.cpp:86:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |    auto[pos, sum] = t[v * 2].bad_suff[i];
      |        ^
fish2.cpp: In function 'void seg::upd(int, int, int, int)':
fish2.cpp:132:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  132 |    auto [l, r] = t[v].bad_seg[i];
      |         ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 513852 KB Output is correct
2 Correct 277 ms 513780 KB Output is correct
3 Correct 250 ms 513860 KB Output is correct
4 Correct 239 ms 513840 KB Output is correct
5 Correct 276 ms 513808 KB Output is correct
6 Correct 250 ms 513848 KB Output is correct
7 Correct 253 ms 513836 KB Output is correct
8 Correct 251 ms 513856 KB Output is correct
9 Correct 263 ms 513868 KB Output is correct
10 Correct 339 ms 513764 KB Output is correct
11 Correct 281 ms 513868 KB Output is correct
12 Correct 259 ms 513836 KB Output is correct
13 Correct 302 ms 513896 KB Output is correct
14 Correct 257 ms 513800 KB Output is correct
15 Correct 274 ms 513860 KB Output is correct
16 Correct 253 ms 513808 KB Output is correct
17 Correct 260 ms 513848 KB Output is correct
18 Correct 251 ms 513784 KB Output is correct
19 Correct 241 ms 513852 KB Output is correct
20 Correct 254 ms 513836 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 513740 KB Output is correct
2 Correct 292 ms 515468 KB Output is correct
3 Correct 286 ms 515448 KB Output is correct
4 Correct 301 ms 515604 KB Output is correct
5 Correct 304 ms 515440 KB Output is correct
6 Correct 276 ms 515500 KB Output is correct
7 Correct 271 ms 515532 KB Output is correct
8 Correct 282 ms 515484 KB Output is correct
9 Correct 272 ms 515436 KB Output is correct
10 Correct 287 ms 515528 KB Output is correct
11 Correct 285 ms 515500 KB Output is correct
12 Correct 300 ms 515448 KB Output is correct
13 Correct 282 ms 515444 KB Output is correct
14 Correct 296 ms 515488 KB Output is correct
15 Correct 292 ms 515676 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 513852 KB Output is correct
2 Correct 277 ms 513780 KB Output is correct
3 Correct 250 ms 513860 KB Output is correct
4 Correct 239 ms 513840 KB Output is correct
5 Correct 276 ms 513808 KB Output is correct
6 Correct 250 ms 513848 KB Output is correct
7 Correct 253 ms 513836 KB Output is correct
8 Correct 251 ms 513856 KB Output is correct
9 Correct 263 ms 513868 KB Output is correct
10 Correct 339 ms 513764 KB Output is correct
11 Correct 281 ms 513868 KB Output is correct
12 Correct 259 ms 513836 KB Output is correct
13 Correct 302 ms 513896 KB Output is correct
14 Correct 257 ms 513800 KB Output is correct
15 Correct 274 ms 513860 KB Output is correct
16 Correct 253 ms 513808 KB Output is correct
17 Correct 260 ms 513848 KB Output is correct
18 Correct 251 ms 513784 KB Output is correct
19 Correct 241 ms 513852 KB Output is correct
20 Correct 254 ms 513836 KB Output is correct
21 Correct 277 ms 513740 KB Output is correct
22 Correct 292 ms 515468 KB Output is correct
23 Correct 286 ms 515448 KB Output is correct
24 Correct 301 ms 515604 KB Output is correct
25 Correct 304 ms 515440 KB Output is correct
26 Correct 276 ms 515500 KB Output is correct
27 Correct 271 ms 515532 KB Output is correct
28 Correct 282 ms 515484 KB Output is correct
29 Correct 272 ms 515436 KB Output is correct
30 Correct 287 ms 515528 KB Output is correct
31 Correct 285 ms 515500 KB Output is correct
32 Correct 300 ms 515448 KB Output is correct
33 Correct 282 ms 515444 KB Output is correct
34 Correct 296 ms 515488 KB Output is correct
35 Correct 292 ms 515676 KB Output is correct
36 Correct 315 ms 515416 KB Output is correct
37 Correct 344 ms 515788 KB Output is correct
38 Correct 338 ms 515768 KB Output is correct
39 Correct 301 ms 515912 KB Output is correct
40 Correct 352 ms 515668 KB Output is correct
41 Correct 290 ms 516296 KB Output is correct
42 Correct 293 ms 516360 KB Output is correct
43 Correct 318 ms 515568 KB Output is correct
44 Correct 304 ms 515580 KB Output is correct
45 Correct 345 ms 515968 KB Output is correct
46 Correct 328 ms 515972 KB Output is correct
47 Correct 332 ms 515816 KB Output is correct
48 Correct 287 ms 515668 KB Output is correct
49 Correct 315 ms 515660 KB Output is correct
50 Correct 308 ms 516136 KB Output is correct
51 Correct 312 ms 515948 KB Output is correct
52 Correct 306 ms 516024 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 513740 KB Output is correct
2 Correct 292 ms 515468 KB Output is correct
3 Correct 286 ms 515448 KB Output is correct
4 Correct 301 ms 515604 KB Output is correct
5 Correct 304 ms 515440 KB Output is correct
6 Correct 276 ms 515500 KB Output is correct
7 Correct 271 ms 515532 KB Output is correct
8 Correct 282 ms 515484 KB Output is correct
9 Correct 272 ms 515436 KB Output is correct
10 Correct 287 ms 515528 KB Output is correct
11 Correct 285 ms 515500 KB Output is correct
12 Correct 300 ms 515448 KB Output is correct
13 Correct 282 ms 515444 KB Output is correct
14 Correct 296 ms 515488 KB Output is correct
15 Correct 292 ms 515676 KB Output is correct
16 Correct 258 ms 513792 KB Output is correct
17 Execution timed out 4083 ms 515860 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 513740 KB Output is correct
2 Correct 292 ms 515468 KB Output is correct
3 Correct 286 ms 515448 KB Output is correct
4 Correct 301 ms 515604 KB Output is correct
5 Correct 304 ms 515440 KB Output is correct
6 Correct 276 ms 515500 KB Output is correct
7 Correct 271 ms 515532 KB Output is correct
8 Correct 282 ms 515484 KB Output is correct
9 Correct 272 ms 515436 KB Output is correct
10 Correct 287 ms 515528 KB Output is correct
11 Correct 285 ms 515500 KB Output is correct
12 Correct 300 ms 515448 KB Output is correct
13 Correct 282 ms 515444 KB Output is correct
14 Correct 296 ms 515488 KB Output is correct
15 Correct 292 ms 515676 KB Output is correct
16 Correct 259 ms 513808 KB Output is correct
17 Correct 950 ms 515672 KB Output is correct
18 Correct 764 ms 515584 KB Output is correct
19 Correct 782 ms 515776 KB Output is correct
20 Correct 709 ms 515700 KB Output is correct
21 Correct 929 ms 515588 KB Output is correct
22 Correct 847 ms 515692 KB Output is correct
23 Correct 975 ms 515624 KB Output is correct
24 Correct 821 ms 515560 KB Output is correct
25 Correct 865 ms 515724 KB Output is correct
26 Correct 524 ms 516012 KB Output is correct
27 Correct 641 ms 515848 KB Output is correct
28 Correct 616 ms 515708 KB Output is correct
29 Correct 544 ms 515976 KB Output is correct
30 Correct 575 ms 515884 KB Output is correct
31 Correct 664 ms 515824 KB Output is correct
32 Correct 786 ms 515960 KB Output is correct
33 Correct 581 ms 515624 KB Output is correct
34 Correct 708 ms 515992 KB Output is correct
35 Correct 536 ms 515920 KB Output is correct
36 Correct 717 ms 515952 KB Output is correct
37 Correct 689 ms 515880 KB Output is correct
38 Correct 493 ms 515964 KB Output is correct
39 Correct 568 ms 516184 KB Output is correct
40 Correct 401 ms 516288 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 513852 KB Output is correct
2 Correct 277 ms 513780 KB Output is correct
3 Correct 250 ms 513860 KB Output is correct
4 Correct 239 ms 513840 KB Output is correct
5 Correct 276 ms 513808 KB Output is correct
6 Correct 250 ms 513848 KB Output is correct
7 Correct 253 ms 513836 KB Output is correct
8 Correct 251 ms 513856 KB Output is correct
9 Correct 263 ms 513868 KB Output is correct
10 Correct 339 ms 513764 KB Output is correct
11 Correct 281 ms 513868 KB Output is correct
12 Correct 259 ms 513836 KB Output is correct
13 Correct 302 ms 513896 KB Output is correct
14 Correct 257 ms 513800 KB Output is correct
15 Correct 274 ms 513860 KB Output is correct
16 Correct 253 ms 513808 KB Output is correct
17 Correct 260 ms 513848 KB Output is correct
18 Correct 251 ms 513784 KB Output is correct
19 Correct 241 ms 513852 KB Output is correct
20 Correct 254 ms 513836 KB Output is correct
21 Correct 277 ms 513740 KB Output is correct
22 Correct 292 ms 515468 KB Output is correct
23 Correct 286 ms 515448 KB Output is correct
24 Correct 301 ms 515604 KB Output is correct
25 Correct 304 ms 515440 KB Output is correct
26 Correct 276 ms 515500 KB Output is correct
27 Correct 271 ms 515532 KB Output is correct
28 Correct 282 ms 515484 KB Output is correct
29 Correct 272 ms 515436 KB Output is correct
30 Correct 287 ms 515528 KB Output is correct
31 Correct 285 ms 515500 KB Output is correct
32 Correct 300 ms 515448 KB Output is correct
33 Correct 282 ms 515444 KB Output is correct
34 Correct 296 ms 515488 KB Output is correct
35 Correct 292 ms 515676 KB Output is correct
36 Correct 315 ms 515416 KB Output is correct
37 Correct 344 ms 515788 KB Output is correct
38 Correct 338 ms 515768 KB Output is correct
39 Correct 301 ms 515912 KB Output is correct
40 Correct 352 ms 515668 KB Output is correct
41 Correct 290 ms 516296 KB Output is correct
42 Correct 293 ms 516360 KB Output is correct
43 Correct 318 ms 515568 KB Output is correct
44 Correct 304 ms 515580 KB Output is correct
45 Correct 345 ms 515968 KB Output is correct
46 Correct 328 ms 515972 KB Output is correct
47 Correct 332 ms 515816 KB Output is correct
48 Correct 287 ms 515668 KB Output is correct
49 Correct 315 ms 515660 KB Output is correct
50 Correct 308 ms 516136 KB Output is correct
51 Correct 312 ms 515948 KB Output is correct
52 Correct 306 ms 516024 KB Output is correct
53 Correct 258 ms 513792 KB Output is correct
54 Execution timed out 4083 ms 515860 KB Time limit exceeded
55 Halted 0 ms 0 KB -