# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144037 | Hectonit | Sličnost (COI23_slicnost) | C++20 | 600 ms | 29948 KiB |
#ifdef DEBUG
#include <bits/stdc++_deb.h>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
using ll = long long;
using ld = long double;
const int inf = 1e9 + 10;
struct SegTree {
struct Node {
int mx = 0, cnt = 0, tp = 0;
};
Node merge(Node a, Node b) {
Node res;
res.mx = max(a.mx, b.mx);
if (res.mx == a.mx) {
res.cnt += a.cnt;
}
if (res.mx == b.mx) {
res.cnt += b.cnt;
}
return res;
}
# | 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... |