# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349202 | arnold518 | Mousetrap (CEOI17_mousetrap) | C++14 | 929 ms | 77420 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;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
int N, R, X;
vector<int> adj[MAXN+10];
int val[MAXN+10], dp[MAXN+10];
void dfs(int now, int bef, int p)
{
val[now]=p;
int a=0, b=0, cnt=0;
for(int nxt : adj[now])
{
if(nxt==bef) continue;
dfs(nxt, now, p+adj[nxt].size()-1);
cnt++;
if(a<=dp[nxt]) b=a, a=dp[nxt];
else if(b<=dp[nxt]) b=dp[nxt];
}
dp[now]=b;
if(cnt<=1) dp[now]=val[now];
//printf("%d : %d %d\n", now, val[now], dp[now]);
}
int main()
{
scanf("%d%d%d", &N, &R, &X);
for(int i=1; i<N; i++)
{
int u, v;
scanf("%d%d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(X, R, adj[X].size());
printf("%d\n", dp[X]-1);
}
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... |