oj.uz

Submission #617177

# Submission time Handle Problem Language Result Execution time Memory
617177 2022-08-01T09:21:09 Z cheissmart Fish 2 (JOI22_fish2) C++14
60 / 100
 4000 ms 251080 KB 
// 花啊啊啊啊啊啊啊啊啊啊啊啊
#include <iostream>
#pragma GCC optimize("Ofast")
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#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;

const int INF = 1e9 + 7, N = 1e5 + 2;
const ll oo = 1e16;

ll a[N];
int pw2[20];
int n;

namespace cover {
	int t[N * 2];
	char tag[N * 2];
	int sum(int v, int h) { return tag[v] ? (1 << h) : t[v]; }
	void pull(int p) {
		int h = 0;
	    while(p > 1) {
	        t[p >> 1] = sum(p, h) + sum(p ^ 1, h);
	        p >>= 1;
	        h++;
	    }
	}
	void add(int l, int r, int x) {
		if(l == 1 && r == n + 1) return;
		l--, r--;
		int tl = l, tr = r;
	    for(l += n, r += n; l < r; l >>= 1, r >>= 1) {
	    	if(l & 1) tag[l++] += x;
	    	if(r & 1) tag[--r] += x;
	    }
	    pull(tl + n), pull(tr - 1 + n);
	}
	int qry(int l, int r) {
		l--, r--; 
	    int res = 0, h = 0;
	    for(l += n, r += n; l < r; l >>= 1, r >>= 1, h++) {
	        if(l & 1) res += sum(l++, h);
	        if(r & 1) res += sum(--r, h);
	    }
	    return res;
	}
}

namespace seg {
	template<class A, class B, int SZ> struct DS {
		pair<A, B> a[SZ];
		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; }
		pair<A, B>& operator[](int i) { return a[i]; }
		void resize(int s) { sz = s; }
	};

	struct node {
		DS<int, ll, 31> bad_pref, bad_suff;
		DS<int, int, 31> bad_seg;
		ll sum;
	} t[N * 2];

	int id(int tl, int tr) {
		tl--, tr -= 2;
	    return (tl + tr) | (tl != tr);
	}

	void pull(int v, int tl, int tr, int lc, int rc, int posl = INF, int posr = 0) {
		for(int i = 0; i < t[lc].bad_pref.sz; i++)
			t[v].bad_pref.PB(t[lc].bad_pref[i]);
		for(int i = 0; i < t[rc].bad_suff.sz; i++)
			t[v].bad_suff.PB(t[rc].bad_suff[i]);

		for(int i = 0; i < t[rc].bad_pref.sz; i++) {
			ll sum1 = t[rc].bad_pref[i].S + t[lc].sum;
			int pos1 = t[rc].bad_pref[i].F;
			if(sum1 + a[tl - 1] < a[pos1 + 1])
				t[v].bad_pref.EB(pos1, sum1);
		}
		for(int i = 0; i < t[lc].bad_suff.sz; i++) {
			ll sum1 = t[lc].bad_suff[i].S + t[rc].sum;
			int pos1 = t[lc].bad_suff[i].F;
			if(sum1 + a[tr] < a[pos1 - 1])
				t[v].bad_suff.EB(pos1, sum1);
		}

		int szi = t[lc].bad_suff.sz;
		int szj = t[rc].bad_pref.sz;
		int i = 0, j = 0;
		while(i < szi && t[lc].bad_suff[i].F > posl)
			i++;
		while(j < szj && t[rc].bad_pref[j].F < posr)
			j++;
		while(i < szi && j < szj) {
			auto& he = t[lc].bad_suff[i], be = t[rc].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[lc].sum + t[rc].sum;
	}
	void build( int tl = 1, int tr = n + 1) {
		int v = id(tl, tr);
		if(tr - tl == 1) {
			t[v].sum = a[tl];
			if(a[tl] + a[tl - 1] < a[tl + 1])
				t[v].bad_pref.EB(tl, a[tl]);
			if(a[tl] + a[tl + 1] < 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 + 1) / 2;
			build(tl, tm);
			build(tm, tr);
			pull(v, tl, tr, id(tl, tm), id(tm, tr));
		}
	}
	void upd(int pos, int tl = 1, int tr = n + 1) {
		int v = id(tl, tr);
		int j = 0;
		for(int i = 0; i < t[v].bad_seg.sz; 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] < a[tl + 1])
				t[v].bad_pref.EB(tl, a[tl]);
			if(a[tl] + a[tl + 1] < 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 + 1) / 2;
			if(pos - 1 < tm)
				upd(pos, tl, tm);
			if(pos + 1 >= tm)
				upd(pos, tm, tr);
			pull(v, tl, tr, id(tl, tm), id(tm, tr), pos + 1, pos - 1);
		}
	}
}

void upd(int pos, ll val) {
	a[pos] = val;
	seg::upd(pos);
}

#define gc getchar_unlocked
inline int readInt () {
	int c = gc();
	while(!isdigit(c)) c = gc();
	int res = c - '0';
	while(isdigit(c = gc())) res = res * 10 + c - '0';
	return res;
}

signed main()
{
	IO_OP;

	n = readInt();
	a[0] = a[n + 1] = oo;
	for(int i = 1; i <= n; i++)
		a[i] = readInt();

	seg::build();

	int q = readInt();
	while(q--) {
		int op = readInt();
		if(op == 1) {
			int x = readInt(), y = readInt();
			upd(x, y);
		} else {
			int l = readInt(), r = readInt();
			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) << ' ';

			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::upd(int, int, int)':
fish2.cpp:143:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  143 |    auto [l, r] = t[v].bad_seg[i];
      |         ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 249140 KB Output is correct
2 Correct 115 ms 249192 KB Output is correct
3 Correct 113 ms 249124 KB Output is correct
4 Correct 107 ms 249244 KB Output is correct
5 Correct 111 ms 249236 KB Output is correct
6 Correct 123 ms 249212 KB Output is correct
7 Correct 119 ms 249184 KB Output is correct
8 Correct 132 ms 249256 KB Output is correct
9 Correct 130 ms 249200 KB Output is correct
10 Correct 117 ms 249156 KB Output is correct
11 Correct 123 ms 249236 KB Output is correct
12 Correct 118 ms 249272 KB Output is correct
13 Correct 127 ms 249256 KB Output is correct
14 Correct 114 ms 249208 KB Output is correct
15 Correct 115 ms 249244 KB Output is correct
16 Correct 111 ms 249164 KB Output is correct
17 Correct 113 ms 249148 KB Output is correct
18 Correct 111 ms 249144 KB Output is correct
19 Correct 115 ms 249304 KB Output is correct
20 Correct 113 ms 249232 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 249132 KB Output is correct
2 Correct 153 ms 250592 KB Output is correct
3 Correct 151 ms 250556 KB Output is correct
4 Correct 139 ms 250480 KB Output is correct
5 Correct 135 ms 250576 KB Output is correct
6 Correct 179 ms 250480 KB Output is correct
7 Correct 145 ms 250588 KB Output is correct
8 Correct 141 ms 250476 KB Output is correct
9 Correct 146 ms 250532 KB Output is correct
10 Correct 143 ms 250548 KB Output is correct
11 Correct 158 ms 250520 KB Output is correct
12 Correct 145 ms 250528 KB Output is correct
13 Correct 132 ms 250504 KB Output is correct
14 Correct 161 ms 250484 KB Output is correct
15 Correct 152 ms 250508 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 249140 KB Output is correct
2 Correct 115 ms 249192 KB Output is correct
3 Correct 113 ms 249124 KB Output is correct
4 Correct 107 ms 249244 KB Output is correct
5 Correct 111 ms 249236 KB Output is correct
6 Correct 123 ms 249212 KB Output is correct
7 Correct 119 ms 249184 KB Output is correct
8 Correct 132 ms 249256 KB Output is correct
9 Correct 130 ms 249200 KB Output is correct
10 Correct 117 ms 249156 KB Output is correct
11 Correct 123 ms 249236 KB Output is correct
12 Correct 118 ms 249272 KB Output is correct
13 Correct 127 ms 249256 KB Output is correct
14 Correct 114 ms 249208 KB Output is correct
15 Correct 115 ms 249244 KB Output is correct
16 Correct 111 ms 249164 KB Output is correct
17 Correct 113 ms 249148 KB Output is correct
18 Correct 111 ms 249144 KB Output is correct
19 Correct 115 ms 249304 KB Output is correct
20 Correct 113 ms 249232 KB Output is correct
21 Correct 109 ms 249132 KB Output is correct
22 Correct 153 ms 250592 KB Output is correct
23 Correct 151 ms 250556 KB Output is correct
24 Correct 139 ms 250480 KB Output is correct
25 Correct 135 ms 250576 KB Output is correct
26 Correct 179 ms 250480 KB Output is correct
27 Correct 145 ms 250588 KB Output is correct
28 Correct 141 ms 250476 KB Output is correct
29 Correct 146 ms 250532 KB Output is correct
30 Correct 143 ms 250548 KB Output is correct
31 Correct 158 ms 250520 KB Output is correct
32 Correct 145 ms 250528 KB Output is correct
33 Correct 132 ms 250504 KB Output is correct
34 Correct 161 ms 250484 KB Output is correct
35 Correct 152 ms 250508 KB Output is correct
36 Correct 251 ms 250608 KB Output is correct
37 Correct 267 ms 250564 KB Output is correct
38 Correct 202 ms 250608 KB Output is correct
39 Correct 183 ms 250588 KB Output is correct
40 Correct 226 ms 250604 KB Output is correct
41 Correct 159 ms 250488 KB Output is correct
42 Correct 167 ms 250516 KB Output is correct
43 Correct 189 ms 250556 KB Output is correct
44 Correct 189 ms 250524 KB Output is correct
45 Correct 188 ms 250552 KB Output is correct
46 Correct 229 ms 250580 KB Output is correct
47 Correct 234 ms 250592 KB Output is correct
48 Correct 171 ms 250580 KB Output is correct
49 Correct 196 ms 250596 KB Output is correct
50 Correct 192 ms 250608 KB Output is correct
51 Correct 212 ms 250520 KB Output is correct
52 Correct 189 ms 250500 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 249132 KB Output is correct
2 Correct 153 ms 250592 KB Output is correct
3 Correct 151 ms 250556 KB Output is correct
4 Correct 139 ms 250480 KB Output is correct
5 Correct 135 ms 250576 KB Output is correct
6 Correct 179 ms 250480 KB Output is correct
7 Correct 145 ms 250588 KB Output is correct
8 Correct 141 ms 250476 KB Output is correct
9 Correct 146 ms 250532 KB Output is correct
10 Correct 143 ms 250548 KB Output is correct
11 Correct 158 ms 250520 KB Output is correct
12 Correct 145 ms 250528 KB Output is correct
13 Correct 132 ms 250504 KB Output is correct
14 Correct 161 ms 250484 KB Output is correct
15 Correct 152 ms 250508 KB Output is correct
16 Correct 128 ms 249196 KB Output is correct
17 Execution timed out 4069 ms 250840 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 249132 KB Output is correct
2 Correct 153 ms 250592 KB Output is correct
3 Correct 151 ms 250556 KB Output is correct
4 Correct 139 ms 250480 KB Output is correct
5 Correct 135 ms 250576 KB Output is correct
6 Correct 179 ms 250480 KB Output is correct
7 Correct 145 ms 250588 KB Output is correct
8 Correct 141 ms 250476 KB Output is correct
9 Correct 146 ms 250532 KB Output is correct
10 Correct 143 ms 250548 KB Output is correct
11 Correct 158 ms 250520 KB Output is correct
12 Correct 145 ms 250528 KB Output is correct
13 Correct 132 ms 250504 KB Output is correct
14 Correct 161 ms 250484 KB Output is correct
15 Correct 152 ms 250508 KB Output is correct
16 Correct 150 ms 249220 KB Output is correct
17 Correct 921 ms 250656 KB Output is correct
18 Correct 649 ms 250648 KB Output is correct
19 Correct 538 ms 250828 KB Output is correct
20 Correct 515 ms 250832 KB Output is correct
21 Correct 676 ms 250644 KB Output is correct
22 Correct 609 ms 250636 KB Output is correct
23 Correct 680 ms 250692 KB Output is correct
24 Correct 699 ms 250720 KB Output is correct
25 Correct 584 ms 250840 KB Output is correct
26 Correct 387 ms 250780 KB Output is correct
27 Correct 339 ms 250540 KB Output is correct
28 Correct 429 ms 250848 KB Output is correct
29 Correct 295 ms 250708 KB Output is correct
30 Correct 376 ms 250708 KB Output is correct
31 Correct 529 ms 250744 KB Output is correct
32 Correct 643 ms 250644 KB Output is correct
33 Correct 365 ms 250576 KB Output is correct
34 Correct 594 ms 250736 KB Output is correct
35 Correct 357 ms 250676 KB Output is correct
36 Correct 526 ms 250740 KB Output is correct
37 Correct 409 ms 250768 KB Output is correct
38 Correct 385 ms 250876 KB Output is correct
39 Correct 396 ms 250848 KB Output is correct
40 Correct 244 ms 251080 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 249140 KB Output is correct
2 Correct 115 ms 249192 KB Output is correct
3 Correct 113 ms 249124 KB Output is correct
4 Correct 107 ms 249244 KB Output is correct
5 Correct 111 ms 249236 KB Output is correct
6 Correct 123 ms 249212 KB Output is correct
7 Correct 119 ms 249184 KB Output is correct
8 Correct 132 ms 249256 KB Output is correct
9 Correct 130 ms 249200 KB Output is correct
10 Correct 117 ms 249156 KB Output is correct
11 Correct 123 ms 249236 KB Output is correct
12 Correct 118 ms 249272 KB Output is correct
13 Correct 127 ms 249256 KB Output is correct
14 Correct 114 ms 249208 KB Output is correct
15 Correct 115 ms 249244 KB Output is correct
16 Correct 111 ms 249164 KB Output is correct
17 Correct 113 ms 249148 KB Output is correct
18 Correct 111 ms 249144 KB Output is correct
19 Correct 115 ms 249304 KB Output is correct
20 Correct 113 ms 249232 KB Output is correct
21 Correct 109 ms 249132 KB Output is correct
22 Correct 153 ms 250592 KB Output is correct
23 Correct 151 ms 250556 KB Output is correct
24 Correct 139 ms 250480 KB Output is correct
25 Correct 135 ms 250576 KB Output is correct
26 Correct 179 ms 250480 KB Output is correct
27 Correct 145 ms 250588 KB Output is correct
28 Correct 141 ms 250476 KB Output is correct
29 Correct 146 ms 250532 KB Output is correct
30 Correct 143 ms 250548 KB Output is correct
31 Correct 158 ms 250520 KB Output is correct
32 Correct 145 ms 250528 KB Output is correct
33 Correct 132 ms 250504 KB Output is correct
34 Correct 161 ms 250484 KB Output is correct
35 Correct 152 ms 250508 KB Output is correct
36 Correct 251 ms 250608 KB Output is correct
37 Correct 267 ms 250564 KB Output is correct
38 Correct 202 ms 250608 KB Output is correct
39 Correct 183 ms 250588 KB Output is correct
40 Correct 226 ms 250604 KB Output is correct
41 Correct 159 ms 250488 KB Output is correct
42 Correct 167 ms 250516 KB Output is correct
43 Correct 189 ms 250556 KB Output is correct
44 Correct 189 ms 250524 KB Output is correct
45 Correct 188 ms 250552 KB Output is correct
46 Correct 229 ms 250580 KB Output is correct
47 Correct 234 ms 250592 KB Output is correct
48 Correct 171 ms 250580 KB Output is correct
49 Correct 196 ms 250596 KB Output is correct
50 Correct 192 ms 250608 KB Output is correct
51 Correct 212 ms 250520 KB Output is correct
52 Correct 189 ms 250500 KB Output is correct
53 Correct 128 ms 249196 KB Output is correct
54 Execution timed out 4069 ms 250840 KB Time limit exceeded
55 Halted 0 ms 0 KB -