# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954508 | GrandTiger1729 | Sličnost (COI23_slicnost) | C++17 | 2035 ms | 524288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
struct Data
{
long long maxn = 0, cnt = 0;
Data() = default;
Data(long long maxn_, long long cnt_) : maxn(maxn_), cnt(cnt_) {}
inline friend Data merge(Data a, Data b)
{
if (a.maxn < b.maxn)
{
return b;
}
if (a.maxn > b.maxn)
{
return a;
}
return Data(a.maxn, a.cnt + b.cnt);
}
};
struct SegTree
{
int l, r, mid;
SegTree *lc, *rc;
Data val_;
long long lz = 0;
SegTree(int l_, int r_) : l(l_), r(r_)
{
# | 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... |