Submission #617288

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
617288	2022-08-01T10:30:47 Z	cheissmart	Fish 2 (JOI22_fish2)	C++14	60 / 100	4000 ms	236952 KB

fish2

// 花啊啊啊啊啊啊啊啊啊啊啊啊
#include <iostream>
#include <cstring>
#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 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> struct DS {
		pair<A, B> a[29];
		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; }
	};
	void cpy(DS<int, ll>& a, DS<int, ll>& b) {
		a.sz = b.sz;
		memcpy(a.a, b.a, a.sz * sizeof (a.a[0]));
	}
	struct node {
		DS<int, ll> bad_pref, bad_suff;
		DS<int, int> 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) {
		cpy(t[v].bad_pref, t[lc].bad_pref);
		cpy(t[v].bad_suff, t[rc].bad_suff);
		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;
}


#define pc(x) putchar_unlocked(x);
inline void writeInt (int n) {
    int N = n, rev, count = 0;
    rev = N;
    if (N == 0) { pc('0'); return ;}
    while ((rev % 10) == 0) { count++; rev /= 10;}
    rev = 0;
    while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;}
    while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}
    while (count--) pc('0');
}

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);

			writeInt(r - l + 1 - cover::qry(l, r + 1));
			pc('\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::cpy(seg::DS<int, long long int>&, seg::DS<int, long long int>&)':
fish2.cpp:71:42: warning: 'void* memcpy(void*, const void*, size_t)' writing to an object of type 'struct std::pair<int, long long int>' with no trivial copy-assignment; use copy-assignment or copy-initialization instead [-Wclass-memaccess]
   71 |   memcpy(a.a, b.a, a.sz * sizeof (a.a[0]));
      |                                          ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/ostream:38,
                 from /usr/include/c++/10/iostream:39,
                 from fish2.cpp:2:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, long long int>' declared here
  211 |     struct pair
      |            ^~~~
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	94 ms	233568 KB	Output is correct
2	Correct	93 ms	233512 KB	Output is correct
3	Correct	101 ms	233584 KB	Output is correct
4	Correct	93 ms	233484 KB	Output is correct
5	Correct	99 ms	233552 KB	Output is correct
6	Correct	101 ms	233600 KB	Output is correct
7	Correct	111 ms	233560 KB	Output is correct
8	Correct	108 ms	233480 KB	Output is correct
9	Correct	107 ms	233528 KB	Output is correct
10	Correct	100 ms	233548 KB	Output is correct
11	Correct	113 ms	233588 KB	Output is correct
12	Correct	111 ms	233544 KB	Output is correct
13	Correct	113 ms	233596 KB	Output is correct
14	Correct	97 ms	233584 KB	Output is correct
15	Correct	97 ms	233504 KB	Output is correct
16	Correct	105 ms	233488 KB	Output is correct
17	Correct	97 ms	233520 KB	Output is correct
18	Correct	105 ms	233636 KB	Output is correct
19	Correct	101 ms	233544 KB	Output is correct
20	Correct	98 ms	233584 KB	Output is correct

Subtask #2

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	93 ms	233596 KB	Output is correct
2	Correct	126 ms	234832 KB	Output is correct
3	Correct	123 ms	234908 KB	Output is correct
4	Correct	141 ms	234868 KB	Output is correct
5	Correct	124 ms	234864 KB	Output is correct
6	Correct	118 ms	234900 KB	Output is correct
7	Correct	126 ms	234932 KB	Output is correct
8	Correct	115 ms	234904 KB	Output is correct
9	Correct	112 ms	234952 KB	Output is correct
10	Correct	117 ms	234880 KB	Output is correct
11	Correct	123 ms	234948 KB	Output is correct
12	Correct	122 ms	234956 KB	Output is correct
13	Correct	113 ms	234892 KB	Output is correct
14	Correct	130 ms	234952 KB	Output is correct
15	Correct	119 ms	234896 KB	Output is correct

Subtask #3

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	233568 KB	Output is correct
2	Correct	93 ms	233512 KB	Output is correct
3	Correct	101 ms	233584 KB	Output is correct
4	Correct	93 ms	233484 KB	Output is correct
5	Correct	99 ms	233552 KB	Output is correct
6	Correct	101 ms	233600 KB	Output is correct
7	Correct	111 ms	233560 KB	Output is correct
8	Correct	108 ms	233480 KB	Output is correct
9	Correct	107 ms	233528 KB	Output is correct
10	Correct	100 ms	233548 KB	Output is correct
11	Correct	113 ms	233588 KB	Output is correct
12	Correct	111 ms	233544 KB	Output is correct
13	Correct	113 ms	233596 KB	Output is correct
14	Correct	97 ms	233584 KB	Output is correct
15	Correct	97 ms	233504 KB	Output is correct
16	Correct	105 ms	233488 KB	Output is correct
17	Correct	97 ms	233520 KB	Output is correct
18	Correct	105 ms	233636 KB	Output is correct
19	Correct	101 ms	233544 KB	Output is correct
20	Correct	98 ms	233584 KB	Output is correct
21	Correct	93 ms	233596 KB	Output is correct
22	Correct	126 ms	234832 KB	Output is correct
23	Correct	123 ms	234908 KB	Output is correct
24	Correct	141 ms	234868 KB	Output is correct
25	Correct	124 ms	234864 KB	Output is correct
26	Correct	118 ms	234900 KB	Output is correct
27	Correct	126 ms	234932 KB	Output is correct
28	Correct	115 ms	234904 KB	Output is correct
29	Correct	112 ms	234952 KB	Output is correct
30	Correct	117 ms	234880 KB	Output is correct
31	Correct	123 ms	234948 KB	Output is correct
32	Correct	122 ms	234956 KB	Output is correct
33	Correct	113 ms	234892 KB	Output is correct
34	Correct	130 ms	234952 KB	Output is correct
35	Correct	119 ms	234896 KB	Output is correct
36	Correct	152 ms	234888 KB	Output is correct
37	Correct	172 ms	234828 KB	Output is correct
38	Correct	154 ms	234956 KB	Output is correct
39	Correct	149 ms	234952 KB	Output is correct
40	Correct	164 ms	234876 KB	Output is correct
41	Correct	121 ms	234900 KB	Output is correct
42	Correct	134 ms	234996 KB	Output is correct
43	Correct	127 ms	234920 KB	Output is correct
44	Correct	139 ms	234956 KB	Output is correct
45	Correct	158 ms	234920 KB	Output is correct
46	Correct	156 ms	234964 KB	Output is correct
47	Correct	180 ms	234932 KB	Output is correct
48	Correct	120 ms	234956 KB	Output is correct
49	Correct	131 ms	234956 KB	Output is correct
50	Correct	130 ms	234900 KB	Output is correct
51	Correct	133 ms	234992 KB	Output is correct
52	Correct	141 ms	235004 KB	Output is correct

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	93 ms	233596 KB	Output is correct
2	Correct	126 ms	234832 KB	Output is correct
3	Correct	123 ms	234908 KB	Output is correct
4	Correct	141 ms	234868 KB	Output is correct
5	Correct	124 ms	234864 KB	Output is correct
6	Correct	118 ms	234900 KB	Output is correct
7	Correct	126 ms	234932 KB	Output is correct
8	Correct	115 ms	234904 KB	Output is correct
9	Correct	112 ms	234952 KB	Output is correct
10	Correct	117 ms	234880 KB	Output is correct
11	Correct	123 ms	234948 KB	Output is correct
12	Correct	122 ms	234956 KB	Output is correct
13	Correct	113 ms	234892 KB	Output is correct
14	Correct	130 ms	234952 KB	Output is correct
15	Correct	119 ms	234896 KB	Output is correct
16	Correct	102 ms	233536 KB	Output is correct
17	Correct	3838 ms	235388 KB	Output is correct
18	Correct	3608 ms	235408 KB	Output is correct
19	Correct	3715 ms	235532 KB	Output is correct
20	Execution timed out	4003 ms	236952 KB	Time limit exceeded
21	Halted	0 ms	0 KB	-

Subtask #5

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	93 ms	233596 KB	Output is correct
2	Correct	126 ms	234832 KB	Output is correct
3	Correct	123 ms	234908 KB	Output is correct
4	Correct	141 ms	234868 KB	Output is correct
5	Correct	124 ms	234864 KB	Output is correct
6	Correct	118 ms	234900 KB	Output is correct
7	Correct	126 ms	234932 KB	Output is correct
8	Correct	115 ms	234904 KB	Output is correct
9	Correct	112 ms	234952 KB	Output is correct
10	Correct	117 ms	234880 KB	Output is correct
11	Correct	123 ms	234948 KB	Output is correct
12	Correct	122 ms	234956 KB	Output is correct
13	Correct	113 ms	234892 KB	Output is correct
14	Correct	130 ms	234952 KB	Output is correct
15	Correct	119 ms	234896 KB	Output is correct
16	Correct	96 ms	233548 KB	Output is correct
17	Correct	628 ms	234956 KB	Output is correct
18	Correct	686 ms	234996 KB	Output is correct
19	Correct	484 ms	235112 KB	Output is correct
20	Correct	508 ms	235172 KB	Output is correct
21	Correct	538 ms	235080 KB	Output is correct
22	Correct	552 ms	234980 KB	Output is correct
23	Correct	541 ms	235048 KB	Output is correct
24	Correct	504 ms	235120 KB	Output is correct
25	Correct	466 ms	235060 KB	Output is correct
26	Correct	263 ms	235084 KB	Output is correct
27	Correct	347 ms	235116 KB	Output is correct
28	Correct	414 ms	235072 KB	Output is correct
29	Correct	306 ms	235200 KB	Output is correct
30	Correct	309 ms	234968 KB	Output is correct
31	Correct	445 ms	235228 KB	Output is correct
32	Correct	498 ms	234956 KB	Output is correct
33	Correct	331 ms	235036 KB	Output is correct
34	Correct	501 ms	234996 KB	Output is correct
35	Correct	310 ms	235160 KB	Output is correct
36	Correct	509 ms	235120 KB	Output is correct
37	Correct	409 ms	235156 KB	Output is correct
38	Correct	285 ms	235144 KB	Output is correct
39	Correct	333 ms	235244 KB	Output is correct
40	Correct	208 ms	235404 KB	Output is correct

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	233568 KB	Output is correct
2	Correct	93 ms	233512 KB	Output is correct
3	Correct	101 ms	233584 KB	Output is correct
4	Correct	93 ms	233484 KB	Output is correct
5	Correct	99 ms	233552 KB	Output is correct
6	Correct	101 ms	233600 KB	Output is correct
7	Correct	111 ms	233560 KB	Output is correct
8	Correct	108 ms	233480 KB	Output is correct
9	Correct	107 ms	233528 KB	Output is correct
10	Correct	100 ms	233548 KB	Output is correct
11	Correct	113 ms	233588 KB	Output is correct
12	Correct	111 ms	233544 KB	Output is correct
13	Correct	113 ms	233596 KB	Output is correct
14	Correct	97 ms	233584 KB	Output is correct
15	Correct	97 ms	233504 KB	Output is correct
16	Correct	105 ms	233488 KB	Output is correct
17	Correct	97 ms	233520 KB	Output is correct
18	Correct	105 ms	233636 KB	Output is correct
19	Correct	101 ms	233544 KB	Output is correct
20	Correct	98 ms	233584 KB	Output is correct
21	Correct	93 ms	233596 KB	Output is correct
22	Correct	126 ms	234832 KB	Output is correct
23	Correct	123 ms	234908 KB	Output is correct
24	Correct	141 ms	234868 KB	Output is correct
25	Correct	124 ms	234864 KB	Output is correct
26	Correct	118 ms	234900 KB	Output is correct
27	Correct	126 ms	234932 KB	Output is correct
28	Correct	115 ms	234904 KB	Output is correct
29	Correct	112 ms	234952 KB	Output is correct
30	Correct	117 ms	234880 KB	Output is correct
31	Correct	123 ms	234948 KB	Output is correct
32	Correct	122 ms	234956 KB	Output is correct
33	Correct	113 ms	234892 KB	Output is correct
34	Correct	130 ms	234952 KB	Output is correct
35	Correct	119 ms	234896 KB	Output is correct
36	Correct	152 ms	234888 KB	Output is correct
37	Correct	172 ms	234828 KB	Output is correct
38	Correct	154 ms	234956 KB	Output is correct
39	Correct	149 ms	234952 KB	Output is correct
40	Correct	164 ms	234876 KB	Output is correct
41	Correct	121 ms	234900 KB	Output is correct
42	Correct	134 ms	234996 KB	Output is correct
43	Correct	127 ms	234920 KB	Output is correct
44	Correct	139 ms	234956 KB	Output is correct
45	Correct	158 ms	234920 KB	Output is correct
46	Correct	156 ms	234964 KB	Output is correct
47	Correct	180 ms	234932 KB	Output is correct
48	Correct	120 ms	234956 KB	Output is correct
49	Correct	131 ms	234956 KB	Output is correct
50	Correct	130 ms	234900 KB	Output is correct
51	Correct	133 ms	234992 KB	Output is correct
52	Correct	141 ms	235004 KB	Output is correct
53	Correct	102 ms	233536 KB	Output is correct
54	Correct	3838 ms	235388 KB	Output is correct
55	Correct	3608 ms	235408 KB	Output is correct
56	Correct	3715 ms	235532 KB	Output is correct
57	Execution timed out	4003 ms	236952 KB	Time limit exceeded
58	Halted	0 ms	0 KB	-