# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539405 | noedit | Race (IOI11_race) | C++17 | 995 ms | 91652 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>
#include "race.h"
using namespace std;
typedef long long ll;
const int MAXN = 2e5;
const int MAXK = 1e6 + 1;
vector<pair<ll, ll> > g[MAXN];
vector<ll>* vec[MAXN];
ll sz[MAXN], big[MAXN];
//map<ll, ll> cnt[MAXK];
map<ll, map<ll, ll> > cnt;
ll dep[MAXN];
ll d[MAXN];
void sizes(ll v, ll p, ll depth = 0, ll dist = 0)
{
dep[v] = depth;
d[v] = dist;
sz[v] = 1;
ll b = -1, mx = 0;
for (auto& [u, w]: g[v])
{
if (u != p)
{
sizes(u, v, depth + 1, dist + w);
sz[v] += sz[u];
if (sz[u] > mx)
{
# | 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... |