Submission #1168088

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168088		hashimali	Triumphal arch (POI13_luk)	C++20	30 / 100	106 ms	21628 KiB

luk

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 1'000'000'007
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
int n,ans;
const int N=3e5+10;
int d[N];
vector<int>g[N];
void dfs(int u,int p=-1,int a=1,int b=0){
    a+=(g[u].size()-1);
    ans=max({ans,b,(a/d[u])+((a%d[u])>0)});
    for(int v:g[u]){
        if(v==p)
            continue;
        d[v]=d[u]+1;
        dfs(v,u,a,max((a/d[u])+((a%d[u])>0),b));
    }
}
void solve(){
    cin>>n;
    for(int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }
    d[1]=1;
    dfs(1);
    cout<<ans<<endl;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    for(int i=1;i<=t;i++){
        // cout<<"Scenario #"<<i<<":"<<" ";
        solve();
    }
}

• 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