Submission #1014143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014143		vjudge1	Triumphal arch (POI13_luk)	C++17	90 / 100	229 ms	27732 KiB

luk

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int n,dp[300001],k;
vector <int> v[300001]; 
int dfs(int i,int last){
    int sum=0;
    for(int j:v[i]) if(j!=last) sum+=dfs(j,i)+1;
    return max(0ll,sum-k);
}
int calc(int num){
    k=num;
    if(dfs(1,0)==0) return 1;
    else return 0;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(int i=0;i<n-1;i++){
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int l=1,r=n,ans=1e9;
    while(l<=r){
        int mid=(l+r)/2;
        if(calc(mid)==1){
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10