Submission #508480

# Submission time Handle Problem Language Result Execution time Memory
508480 2022-01-13T11:21:18 Z stefantaga Election (BOI18_election) C++14
100 / 100
523 ms 27796 KB
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Node {
	int l_max, r_max, tot, ans;

	Node operator+(Node b) {
		Node ret;
		ret.l_max = max(l_max, b.l_max + tot);
		ret.r_max = max(r_max + b.tot, b.r_max);
		ret.tot = tot + b.tot;
		ret.ans = max(max(ans + b.tot, b.ans + tot), l_max + b.r_max);
		return ret;
	}
};

Node segtree[2000001];
char s[500001];
int n;

void build(int node = 1, int l = 1, int r = n) {
	if (l == r) {
		if (s[l] == 'T') segtree[node] = {1, 1, 1, 1};
		else segtree[node] = {0, 0, -1, 0};
	} else {
		int mid = (l + r) / 2;
		build(node * 2, l, mid);
		build(node * 2 + 1, mid + 1, r);
		segtree[node] = segtree[node * 2] + segtree[node * 2 + 1];
	}
}

Node query(int a, int b, int node = 1, int l = 1, int r = n) {
	if (l > b || r < a) return {0, 0, 0, 0};
	if (l >= a && r <= b) return segtree[node];
	int mid = (l + r) / 2;
	return query(a, b, node * 2, l, mid) + query(a, b, node * 2 + 1, mid + 1, r);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	FOR(i, 1, n + 1) cin >> s[i];
	build();
	int q;
	cin >> q;
	while (q--) {
		int a, b;
		cin >> a >> b;
		cout << query(a, b).ans << '\n';
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 46 ms 5580 KB Output is correct
7 Correct 47 ms 5600 KB Output is correct
8 Correct 45 ms 5528 KB Output is correct
9 Correct 39 ms 5576 KB Output is correct
10 Correct 55 ms 5672 KB Output is correct
11 Correct 48 ms 5704 KB Output is correct
12 Correct 48 ms 5688 KB Output is correct
13 Correct 51 ms 5796 KB Output is correct
14 Correct 54 ms 5644 KB Output is correct
15 Correct 48 ms 5588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 46 ms 5580 KB Output is correct
7 Correct 47 ms 5600 KB Output is correct
8 Correct 45 ms 5528 KB Output is correct
9 Correct 39 ms 5576 KB Output is correct
10 Correct 55 ms 5672 KB Output is correct
11 Correct 48 ms 5704 KB Output is correct
12 Correct 48 ms 5688 KB Output is correct
13 Correct 51 ms 5796 KB Output is correct
14 Correct 54 ms 5644 KB Output is correct
15 Correct 48 ms 5588 KB Output is correct
16 Correct 447 ms 26832 KB Output is correct
17 Correct 423 ms 26380 KB Output is correct
18 Correct 446 ms 26732 KB Output is correct
19 Correct 355 ms 26244 KB Output is correct
20 Correct 468 ms 26044 KB Output is correct
21 Correct 472 ms 27716 KB Output is correct
22 Correct 496 ms 27692 KB Output is correct
23 Correct 436 ms 27796 KB Output is correct
24 Correct 464 ms 27500 KB Output is correct
25 Correct 523 ms 26988 KB Output is correct