제출 #448168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448168		jk410	Papričice (COCI20_papricice)	C++17	50 / 110	90 ms	588 KiB

papricice

#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
int N,Ans=INF;
int Size[2001];
vector<int> Edge[2001];
vector<pair<int,int>> Edge_List;
void dfs(int v,int par){
    Size[v]=1;
    for (int i:Edge[v]){
        if (i==par)
            continue;
        dfs(i,v);
        Size[v]+=Size[i];
    }
}
void f(int v,int par){
    for (int i=1; i<=N; i++)
        Size[i]=0;
    dfs(v,par);
    for (int i=1; i<=N; i++){
        if (!Size[i]||i==par)
            continue;
        Ans=min(Ans,max({Size[i],Size[v]-Size[i],N-Size[v]})-min({Size[i],Size[v]-Size[i],N-Size[v]}));
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>N;
    for (int i=1; i<N; i++){
        int a,b;
        cin>>a>>b;
        Edge[a].push_back(b);
        Edge[b].push_back(a);
        Edge_List.push_back({a,b});
    }
    for (auto i:Edge_List){
        f(i.first,i.second);
        f(i.second,i.first);
    }
    cout<<Ans;
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 35 / 35
• Subtask 3: 0 / 60