# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951754 | vjudge1 | Magic Tree (CEOI19_magictree) | C++17 | 2089 ms | 1048576 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 pii pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define int ll
struct node{
ll x = 0, p = 0;
node *l = nullptr, *r = nullptr;
node(){}
};
vector<int> q[200100];
multiset<pii> h[200100];
int n, m, k;
node *d[200100];
int dp[200100][2];
void push(node *v){
if(!v -> l) v -> l = new node();
v -> l -> x += v -> p;
v -> l -> p += v -> p;
if(!v -> r) v -> r = new node();
v -> r -> x += v -> p;
v -> r -> p += v -> p;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |