# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105890 | IOrtroiii | Election (BOI18_election) | C++14 | 990 ms | 46372 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;
const int N = 500500;
int n;
char s[N];
struct Data {
int sum, suf;
};
Data t[N << 2];
Data mrg(Data l, Data r) {
Data ans;
ans.sum = l.sum + r.sum;
ans.suf = min(r.suf, r.sum + l.suf);
return ans;
}
void upd(int v,int l,int r,int p,int x) {
if (l == r) {
t[v].sum = x;
t[v].suf = min(x, 0);
return;
}
int md = (l + r) >> 1;
if (p <= md) upd(v << 1, l, md, p, x);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |