# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705285 | penguinhacker | Election (BOI18_election) | C++17 | 561 ms | 43660 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 ll long long
#define ar array
const int mxN=5e5;
int n, q, ans[mxN];
string s;
ar<int, 2> st[1<<20];
vector<ar<int, 2>> queries[mxN];
vector<int> stk;
ar<int, 2> cmb(ar<int, 2> a, ar<int, 2> b) {
return {a[0]+b[0], min(a[1], a[0]+b[1])};
}
void upd(int i, int x, int u=1, int l=0, int r=n-1) {
if (l==r) {
st[u][0]=x;
st[u][1]=min(0, st[u][0]);
return;
}
int mid=(l+r)/2;
i<=mid?upd(i, x, 2*u, l, mid):upd(i, x, 2*u+1, mid+1, r);
st[u]=cmb(st[2*u], st[2*u+1]);
}
ar<int, 2> qry(int ql, int qr, int u=1, int l=0, int r=n-1) {
if (l>qr||r<ql)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |