# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914648 | anarch_y | Regions (IOI09_regions) | C++17 | 8102 ms | 68356 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;
using ll = long long;
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
const int MX = 25001;
struct node{
int val;
int l, r;
};
struct pseg{
static const int LIM = 4000000;
node d[LIM];
int nex = 0;
vector<int> loc;
int copy(int cur){
int x = nex++;
d[x] = d[cur];
return x;
}
void push(int x){
d[x].val = d[d[x].l].val + d[d[x].r].val;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |