제출 #1013918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013918		Almonther	새로운 문제 (POI13_luk)	C++98	30 / 100	292 ms	39544 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 mid;
bool dfs(ll x,ll last,ll num){
    num+=mid;
    bool ans=1;
    num-=v[x].size();
    if(x!=1) num++;
    if(num<0) return 0;
    for(auto i:v[x]){
        if(i==last) continue;
        ans&=dfs(i,x,num);
    }
    return ans;
}
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);
    }
    ll l,r,ans=0;
    l=0,r=n;
    while(l<=r){
        mid=(l+r)/2;
        if(dfs(1,-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: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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