# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131700 | Hectonit | Sličnost (COI23_slicnost) | C++20 | 650 ms | 396096 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct SegTree {
struct Node {
int ls = -1, rs = -1, cmx = 0, mx = 0, tp = 0, cpr = -1;
Node(int lb, int rb) {
cmx = rb - lb;
}
};
vector<Node> t;
SegTree(int n) {
t.push_back(Node(0, n));
}
void apply(int i, int tp) {
t[i].mx += tp;
t[i].tp += tp;
}
void push(int i, int l, int r) {
if (t[i].ls == -1) {
while (t[i].cpr != -1 && t[t[i].cpr].ls == -1) {
t[i].cpr = t[t[i].cpr].cpr;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |