# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575915 | eecs | Superpozicija (COCI22_superpozicija) | C++17 | 85 ms | 6600 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 maxn = 200010;
int T, n, m, ans[maxn], lnk[maxn], id[maxn];
char str[maxn];
#define mid ((l + r) >> 1)
#define ls (p << 1)
#define rs (p << 1 | 1)
struct node { int tag, val; } t[maxn << 2];
void pushdown(int p) {
t[ls].tag += t[p].tag, t[rs].tag += t[p].tag;
t[ls].val += t[p].tag, t[rs].val += t[p].tag, t[p].tag = 0;
}
void clear(int p, int l, int r) {
t[p].tag = t[p].val = 0;
if (l == r) return;
clear(ls, l, mid), clear(rs, mid + 1, r);
}
void modify(int p, int l, int r, int ql, int qr, int val) {
if (ql <= l && r <= qr) { t[p].tag += val, t[p].val += val; return; }
pushdown(p);
if (ql <= mid) modify(ls, l, mid, ql, qr, val);
if (mid < qr) modify(rs, mid + 1, r, ql, qr, val);
t[p].val = min(t[ls].val, t[rs].val);
}
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... |