답안 #617256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
617256	2022-08-01T10:08:02 Z	cheissmart	Fish 2 (JOI22_fish2)	C++14	60 / 100	4000 ms	235420 KB

fish2

// 花啊啊啊啊啊啊啊啊啊啊啊啊
#include <iostream>
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#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; }
	};

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

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233512 KB	Output is correct
2	Correct	107 ms	233588 KB	Output is correct
3	Correct	110 ms	233504 KB	Output is correct
4	Correct	99 ms	233584 KB	Output is correct
5	Correct	108 ms	233568 KB	Output is correct
6	Correct	111 ms	233596 KB	Output is correct
7	Correct	100 ms	233508 KB	Output is correct
8	Correct	104 ms	233584 KB	Output is correct
9	Correct	108 ms	233708 KB	Output is correct
10	Correct	102 ms	233584 KB	Output is correct
11	Correct	100 ms	233516 KB	Output is correct
12	Correct	101 ms	233472 KB	Output is correct
13	Correct	108 ms	233472 KB	Output is correct
14	Correct	117 ms	233548 KB	Output is correct
15	Correct	108 ms	233604 KB	Output is correct
16	Correct	110 ms	233528 KB	Output is correct
17	Correct	107 ms	233592 KB	Output is correct
18	Correct	121 ms	233576 KB	Output is correct
19	Correct	101 ms	233524 KB	Output is correct
20	Correct	103 ms	233580 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233548 KB	Output is correct
2	Correct	161 ms	234872 KB	Output is correct
3	Correct	143 ms	234924 KB	Output is correct
4	Correct	148 ms	234920 KB	Output is correct
5	Correct	142 ms	234900 KB	Output is correct
6	Correct	125 ms	234852 KB	Output is correct
7	Correct	130 ms	234940 KB	Output is correct
8	Correct	143 ms	234868 KB	Output is correct
9	Correct	125 ms	234840 KB	Output is correct
10	Correct	138 ms	234936 KB	Output is correct
11	Correct	126 ms	234948 KB	Output is correct
12	Correct	123 ms	234916 KB	Output is correct
13	Correct	124 ms	234840 KB	Output is correct
14	Correct	132 ms	234828 KB	Output is correct
15	Correct	132 ms	234852 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233512 KB	Output is correct
2	Correct	107 ms	233588 KB	Output is correct
3	Correct	110 ms	233504 KB	Output is correct
4	Correct	99 ms	233584 KB	Output is correct
5	Correct	108 ms	233568 KB	Output is correct
6	Correct	111 ms	233596 KB	Output is correct
7	Correct	100 ms	233508 KB	Output is correct
8	Correct	104 ms	233584 KB	Output is correct
9	Correct	108 ms	233708 KB	Output is correct
10	Correct	102 ms	233584 KB	Output is correct
11	Correct	100 ms	233516 KB	Output is correct
12	Correct	101 ms	233472 KB	Output is correct
13	Correct	108 ms	233472 KB	Output is correct
14	Correct	117 ms	233548 KB	Output is correct
15	Correct	108 ms	233604 KB	Output is correct
16	Correct	110 ms	233528 KB	Output is correct
17	Correct	107 ms	233592 KB	Output is correct
18	Correct	121 ms	233576 KB	Output is correct
19	Correct	101 ms	233524 KB	Output is correct
20	Correct	103 ms	233580 KB	Output is correct
21	Correct	103 ms	233548 KB	Output is correct
22	Correct	161 ms	234872 KB	Output is correct
23	Correct	143 ms	234924 KB	Output is correct
24	Correct	148 ms	234920 KB	Output is correct
25	Correct	142 ms	234900 KB	Output is correct
26	Correct	125 ms	234852 KB	Output is correct
27	Correct	130 ms	234940 KB	Output is correct
28	Correct	143 ms	234868 KB	Output is correct
29	Correct	125 ms	234840 KB	Output is correct
30	Correct	138 ms	234936 KB	Output is correct
31	Correct	126 ms	234948 KB	Output is correct
32	Correct	123 ms	234916 KB	Output is correct
33	Correct	124 ms	234840 KB	Output is correct
34	Correct	132 ms	234828 KB	Output is correct
35	Correct	132 ms	234852 KB	Output is correct
36	Correct	175 ms	234944 KB	Output is correct
37	Correct	177 ms	234908 KB	Output is correct
38	Correct	185 ms	234948 KB	Output is correct
39	Correct	157 ms	234868 KB	Output is correct
40	Correct	188 ms	234944 KB	Output is correct
41	Correct	132 ms	234880 KB	Output is correct
42	Correct	135 ms	234832 KB	Output is correct
43	Correct	151 ms	234956 KB	Output is correct
44	Correct	157 ms	234940 KB	Output is correct
45	Correct	186 ms	234952 KB	Output is correct
46	Correct	156 ms	234956 KB	Output is correct
47	Correct	169 ms	234868 KB	Output is correct
48	Correct	144 ms	234876 KB	Output is correct
49	Correct	141 ms	234904 KB	Output is correct
50	Correct	149 ms	234964 KB	Output is correct
51	Correct	153 ms	234848 KB	Output is correct
52	Correct	145 ms	234888 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233548 KB	Output is correct
2	Correct	161 ms	234872 KB	Output is correct
3	Correct	143 ms	234924 KB	Output is correct
4	Correct	148 ms	234920 KB	Output is correct
5	Correct	142 ms	234900 KB	Output is correct
6	Correct	125 ms	234852 KB	Output is correct
7	Correct	130 ms	234940 KB	Output is correct
8	Correct	143 ms	234868 KB	Output is correct
9	Correct	125 ms	234840 KB	Output is correct
10	Correct	138 ms	234936 KB	Output is correct
11	Correct	126 ms	234948 KB	Output is correct
12	Correct	123 ms	234916 KB	Output is correct
13	Correct	124 ms	234840 KB	Output is correct
14	Correct	132 ms	234828 KB	Output is correct
15	Correct	132 ms	234852 KB	Output is correct
16	Correct	103 ms	233576 KB	Output is correct
17	Execution timed out	4073 ms	235168 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233548 KB	Output is correct
2	Correct	161 ms	234872 KB	Output is correct
3	Correct	143 ms	234924 KB	Output is correct
4	Correct	148 ms	234920 KB	Output is correct
5	Correct	142 ms	234900 KB	Output is correct
6	Correct	125 ms	234852 KB	Output is correct
7	Correct	130 ms	234940 KB	Output is correct
8	Correct	143 ms	234868 KB	Output is correct
9	Correct	125 ms	234840 KB	Output is correct
10	Correct	138 ms	234936 KB	Output is correct
11	Correct	126 ms	234948 KB	Output is correct
12	Correct	123 ms	234916 KB	Output is correct
13	Correct	124 ms	234840 KB	Output is correct
14	Correct	132 ms	234828 KB	Output is correct
15	Correct	132 ms	234852 KB	Output is correct
16	Correct	100 ms	233580 KB	Output is correct
17	Correct	873 ms	235008 KB	Output is correct
18	Correct	612 ms	234996 KB	Output is correct
19	Correct	662 ms	235084 KB	Output is correct
20	Correct	568 ms	235180 KB	Output is correct
21	Correct	806 ms	235072 KB	Output is correct
22	Correct	603 ms	234956 KB	Output is correct
23	Correct	740 ms	234976 KB	Output is correct
24	Correct	638 ms	235056 KB	Output is correct
25	Correct	688 ms	235104 KB	Output is correct
26	Correct	296 ms	235176 KB	Output is correct
27	Correct	337 ms	234928 KB	Output is correct
28	Correct	413 ms	235060 KB	Output is correct
29	Correct	314 ms	235228 KB	Output is correct
30	Correct	321 ms	234960 KB	Output is correct
31	Correct	474 ms	235024 KB	Output is correct
32	Correct	586 ms	235000 KB	Output is correct
33	Correct	395 ms	235080 KB	Output is correct
34	Correct	551 ms	235020 KB	Output is correct
35	Correct	363 ms	235020 KB	Output is correct
36	Correct	512 ms	235088 KB	Output is correct
37	Correct	500 ms	235108 KB	Output is correct
38	Correct	327 ms	235160 KB	Output is correct
39	Correct	352 ms	235160 KB	Output is correct
40	Correct	226 ms	235420 KB	Output is correct

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	103 ms	233512 KB	Output is correct
2	Correct	107 ms	233588 KB	Output is correct
3	Correct	110 ms	233504 KB	Output is correct
4	Correct	99 ms	233584 KB	Output is correct
5	Correct	108 ms	233568 KB	Output is correct
6	Correct	111 ms	233596 KB	Output is correct
7	Correct	100 ms	233508 KB	Output is correct
8	Correct	104 ms	233584 KB	Output is correct
9	Correct	108 ms	233708 KB	Output is correct
10	Correct	102 ms	233584 KB	Output is correct
11	Correct	100 ms	233516 KB	Output is correct
12	Correct	101 ms	233472 KB	Output is correct
13	Correct	108 ms	233472 KB	Output is correct
14	Correct	117 ms	233548 KB	Output is correct
15	Correct	108 ms	233604 KB	Output is correct
16	Correct	110 ms	233528 KB	Output is correct
17	Correct	107 ms	233592 KB	Output is correct
18	Correct	121 ms	233576 KB	Output is correct
19	Correct	101 ms	233524 KB	Output is correct
20	Correct	103 ms	233580 KB	Output is correct
21	Correct	103 ms	233548 KB	Output is correct
22	Correct	161 ms	234872 KB	Output is correct
23	Correct	143 ms	234924 KB	Output is correct
24	Correct	148 ms	234920 KB	Output is correct
25	Correct	142 ms	234900 KB	Output is correct
26	Correct	125 ms	234852 KB	Output is correct
27	Correct	130 ms	234940 KB	Output is correct
28	Correct	143 ms	234868 KB	Output is correct
29	Correct	125 ms	234840 KB	Output is correct
30	Correct	138 ms	234936 KB	Output is correct
31	Correct	126 ms	234948 KB	Output is correct
32	Correct	123 ms	234916 KB	Output is correct
33	Correct	124 ms	234840 KB	Output is correct
34	Correct	132 ms	234828 KB	Output is correct
35	Correct	132 ms	234852 KB	Output is correct
36	Correct	175 ms	234944 KB	Output is correct
37	Correct	177 ms	234908 KB	Output is correct
38	Correct	185 ms	234948 KB	Output is correct
39	Correct	157 ms	234868 KB	Output is correct
40	Correct	188 ms	234944 KB	Output is correct
41	Correct	132 ms	234880 KB	Output is correct
42	Correct	135 ms	234832 KB	Output is correct
43	Correct	151 ms	234956 KB	Output is correct
44	Correct	157 ms	234940 KB	Output is correct
45	Correct	186 ms	234952 KB	Output is correct
46	Correct	156 ms	234956 KB	Output is correct
47	Correct	169 ms	234868 KB	Output is correct
48	Correct	144 ms	234876 KB	Output is correct
49	Correct	141 ms	234904 KB	Output is correct
50	Correct	149 ms	234964 KB	Output is correct
51	Correct	153 ms	234848 KB	Output is correct
52	Correct	145 ms	234888 KB	Output is correct
53	Correct	103 ms	233576 KB	Output is correct
54	Execution timed out	4073 ms	235168 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

답안 #617256

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 8.0 / 8.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 23.0

Subtask #5 35.0 / 35.0

Subtask #6 0 / 17.0

Subtask #1
5.0 / 5.0

Subtask #2
8.0 / 8.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 17.0