# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67953 | aome | Election (BOI18_election) | C++17 | 2387 ms | 129464 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 = 500005;
const int INF = 1e9;
int n, m;
string s;
int sum[N];
struct Data {
int sum, mx, cnt;
Data() { sum = mx = cnt = 0; }
};
struct SegmentTree {
struct Node {
int sum, mx;
vector<int> f;
};
Node T[N << 2];
#define mid ((l + r) >> 1)
void build(int i, int l, int r) {
sum[l - 1] = 0;
for (int j = l; j <= r; ++j) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |