# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488593 | JovanB | Magic Tree (CEOI19_magictree) | C++17 | 239 ms | 36188 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;
using ld = long double;
const int N = 100000;
map <int, ll> q[N+5];
int gde[N+5];
int t[N+5], val[N+5];
vector <int> graf[N+5];
void dfs(int v){
int mx = 0;
for(auto c : graf[v]){
dfs(c);
if(!mx || q[gde[c]].size() > q[gde[mx]].size()) mx = c;
}
if(!mx){
gde[v] = v;
if(val[v]) q[v][t[v]] += val[v];
return;
}
gde[v] = gde[mx];
for(auto c : graf[v]){
if(c == mx) continue;
for(auto h : q[gde[c]]) q[gde[v]][h.first] += h.second;
}
# | 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... |