# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227318 | papa | Putovanje (COCI20_putovanje) | C++14 | 70 ms | 15736 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;
typedef long long ll;
struct gr
{
int u,a,b;
};
int n;
vector<gr> adj[200005];
ll dp[200005];
int sz[200005];
int ma[200005];
int mi[200005];
int siz(int u,int p)
{
sz[u] = 1;
for(gr gg : adj[u])
{
if(gg.u==p) continue;
sz[u]+=siz(gg.u,u);
}
return sz[u];
}
int maks(int u,int p)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |