# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131772 | Hectonit | Sličnost (COI23_slicnost) | C++20 | 759 ms | 589824 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;
}
int copy(int i) {
int ni = t.size();
t.push_back(t[i]);
t[ni].ls = -1;
# | 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... |