# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1130282 | gyg | Sličnost (COI23_slicnost) | C++20 | 752 ms | 589824 KiB |
#include <bits/stdc++.h>
using namespace std;
#define arr array
#define pii pair<int, int>
#define fir first
#define sec second
#define lint long long
const int N = 1e5 + 5;
int n, k, q;
arr<int, N> a, b;
struct Sg {
struct Nd {
int mx, nm, lzy;
Nd *lf, *rg;
Nd(int x, int y, int z = 0, Nd *l = nullptr, Nd *r = nullptr) {
mx = x, nm = y, lzy = z, lf = l, rg = r;
}
Nd(Nd *l, Nd *r) {
mx = max(l->mx, r->mx);
nm = ((l->mx == mx) ? l->nm : 0) + ((r->mx == mx) ? r->nm : 0);
lzy = 0, lf = l, rg = r;
}
};
arr<Nd*, N> rt;
void prp(Nd *u, int lw, int hg) {
int md = (lw + hg) / 2;
if (!u->lf)
u->lf = new Nd(0, md - lw + 1), u->rg = new Nd(0, hg - md);
# | 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... |