# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774483 | m_bezrutchka | Sterilizing Spray (JOI15_sterilizing) | C++14 | 172 ms | 7708 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 <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 112345;
int n, K;
int v[MAXN];
struct seg {
ll sum;
int max_val;
seg () {}
seg(ll a, int b) {
sum = a; max_val = b;
}
};
seg node[4 * MAXN];
void build(int i, int l, int r) {
if (l == r) {
node[i] = seg((ll) v[l], v[l]);
return;
}
int m = (l + r) / 2;
build(2 * i, l, m);
build(2 * i + 1, m + 1, r);
node[i].sum = node[2 * i].sum + node[2 * i + 1].sum;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |