CodeForces 239E World Eater Brothers （DP）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=3e3+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,x[maxn],y[maxn];
vector<pii> g[maxn];
int dp[maxn],dep[maxn],ret,sum;
void dfs(int u,int f,int pre){
    dp[u]=dp[f]+pre,dep[u]=dep[f]+1;
    sum+=pre,ret=min(ret,dep[u]-2*dp[u]);
    for(auto v:g[u]) if(v.fi^f)
        dfs(v.fi,u,v.se);
}
int solve(int u,int f){
    dep[f]=-1,dp[f]=sum=0;
    ret=maxn;
    dfs(u,f,0);
    return ret+sum;
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n;
    rep(i,1,n){
        cin>>x[i]>>y[i];
        g[x[i]].push_back(mk(y[i],0));
        g[y[i]].push_back(mk(x[i],1));
    }
    int ans=maxn;
    rep(i,1,n){
        int tmp=solve(x[i],y[i])+solve(y[i],x[i]);
        ans=min(ans,tmp);
    }
    if(ans==maxn)cout<<0<<"\n";
    else cout<<ans<<"\n";
    return 0;
}