# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516699 | couplefire | Weirdtree (RMI21_weirdtree) | C++17 | 216 ms | 34672 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;
#define ll long long
const int N = 1<<19;
struct node{
ll sum; int mx, cmx, smx;
node(int x = 0){
sum = mx = x;
smx = 0;
cmx = 1;
}
node(node a, node b){
if(a.mx<b.mx || (a.mx==b.mx && a.smx<b.smx))
swap(a, b);
sum = a.sum+b.sum;
if(a.mx>b.mx){
mx = a.mx;
cmx = a.cmx;
smx = max(a.smx, b.mx);
} else{
mx = a.mx;
cmx = a.cmx+b.cmx;
smx = a.smx;
}
}
} tree[N<<1];
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |