# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947636 | atom | Hard route (IZhO17_road) | C++17 | 565 ms | 1364 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"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;
#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif
const int N = 5e3 + 5;
const int INF = 1e9;
int n;
vector <int> adj[N];
ll ans, cnt;
using T = pair <ll, ll>;
T dp[N];
// <maximum distance from current node, number of ways>
void dfs(int u, int p, int dep) {
dp[u] = make_pair(dep, 1);
for (int v : adj[u]) {
if (v == p) continue;
dfs(v, u, dep + 1);
if (dp[u].first < dp[v].first)
dp[u] = make_pair(dp[v].first, dp[v].second);
else if (dp[u].first == dp[v].first)
dp[u].second += dp[v].second;
}
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... |