제출 #1014140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014140		Almonther	새로운 문제 (POI13_luk)	C++98	0 / 100	279 ms	57680 KiB

luk

#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
ll n;
vector<ll>v[1000001];
ll dp[1000001];
ll dep[1000001];
vector<pair<ll,ll>>v1;
ll par[1000001];
void make_dp(ll x){
    for(auto i:v1){
        ll sum=v[i.second].size();
        if(i.second!=1) sum--;
        for(auto j:v[i.second]){
            if(j==par[j]) continue;
            sum+=dp[j];
        }
        dp[i.first]=max(0ll,sum-x);
    }
}
void dfs(ll x,ll last){
    par[x]=last;
    v1.push_back({dep[last]+1,x});
    dep[x]=dep[last]+1;
    for(auto i:v[x]){
        if(i==last) continue;
        dfs(i,x);
    }
}
void solve(){
    cin>>n;
    for(int i=0;i<n-1;i++){
        ll a,b;
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs(1,-1);
    sort(v1.begin(),v1.end());
    reverse(v1.begin(),v1.end());
    ll l,r,ans=0;
    l=0,r=1e6;
    while(l<=r){
        ll mid=(l+r)/2;
        make_dp(mid);
        if(dp[1]==0){
            r=mid-1;
            ans=mid;
        }
        else l=mid+1;
    }
    co ans;
}
int main()
{
    suiii
    int tt=1;
    // cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}

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