| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 564471 | keta_tsimakuridze | Election (BOI18_election) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 5e5 + 5, mod = 1e9 + 7; //!
int t[N], t2[N], p[N], tree[4 * N], lazy[4 * N], ans[N];
vector<pair<int,int> > x[N];
void push(int u ,int l,int r) {
tree[u] += lazy[u];
if(l != r) lazy[2 * u] += lazy[u], lazy[2 * u + 1] += lazy[u];
lazy[u] = 0;
return;
}
void upd(int u, int st, int en, int l,int r,int v) {
if(lazy[u]) push(u, l, r);
if(l > en || r < st) return;
if(st <= l && r <= en) {
lazy[u] = v;
push(u, l, r);
return;
}
int mid = (l + r) / 2;
upd(2 * u, st, en, l, mid, v); upd(2 * u + 1, st, en, mid + 1, r, v);
tree[u] = max(tree[2 * u], tree[2 * u + 1]);
}
int get(int u, int st,int en, int l,int r) {
if(lazy[u]) push(u, l, r);
if(l > en || r < st) return -N;
if(st <= l && r <= en) return tree[u];
int mid = (l + r) / 2;
return max(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
}
void upd(int id, int val) {
for(id; id >= 1; id -= id & (-id)) t[id] += val;
} int n;
int get(int id) {
int ans = 0;
for(id; id <= n; id += id & (-id)) ans += t[id];
return ans;
}
void UPD(int id, int val) {
for(id; id >= 1; id -= id & (-id)) t2[id] += val;
}
int GET(int id) {
int ans = 0;
for(id; id <= n; id += id & (-id)) ans += t2[id];
return ans;
}
main() {
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
char c; cin >> c;
p[i] = p[i - 1] + (c == 'T' ? 1 : -1);
upd(1, 1, i, 1, n, p[i] - p[i - 1]);
upd(i, p[i] - p[i - 1]);
}
int q; cin >> q;
for(int i = 1; i <= q; i++) {
int l, r;
cin >> l >> r;
x[l].push_back({i, r});
}
vector<int> v;
int l = 0;
for(int i = n; i >= 1; i--) {
while(v.size() && p[v.back()] <= p[i]) {
if(l == v.size()) {
l--;
upd(v.back(), 1);
UPD(v.back(), -1);
upd(1,1, v.back(), 1, n, 1);
}
v.pop_back();
}
v.push_back(i);
while(l < v.size() && p[v[l]] - p[i - 1] > 0) upd(1, 1, v[l], 1, n, -1), upd(v[l], -1), UPD(v[l], 1), ++l;
while(l > 0 && p[v[l - 1]] - p[i - 1] <= 0) upd(1, 1, v[l - 1], 1, n, 1), upd(v[l - 1], 1), UPD(v[l - 1], -1), --l;
if(x[i].size()) {
} else continue;
for(int j = 0; j < x[i].size(); j++) {
ans[x[i][j].f] = max(0ll, get(1, i, x[i][j].s, 1, n) - get(x[i][j].s + 1)) + GET(i) - GET(x[i][j].s + 1);
}
}
for(int i = 1; i <= q; i++) cout << ans[i] << endl;
}