# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131789 | Hectonit | Sličnost (COI23_slicnost) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct SegTree {
vector<int> ls, rs, cmx, mx, tp, cpr;
int nw(int lb, int rb) {
ls.push_back(-1);
rs.push_back(-1);
cmx.push_back(rb - lb);
mx.push_back(0);
tp.push_back(0);
cpr.push_back(0);
return (int)ls.size() - 1;
}
SegTree(int n) {
nw(0, n);
}
void apply(int i, int tpn) {
mx[i] += tpn;
tp[i] += tpn;
}
int copy(int i) {
int ni = ls.size();
# | 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... |