Submission #1143258

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143258		Stormtrooper007	Triumphal arch (POI13_luk)	C++20	0 / 100	150 ms	18540 KiB

luk

#include <bits/stdc++.h>

using namespace std;
vector<int>adj[300001];
int depth[300001];
int f[300001];
int ans=0;
void dfs(int x,int p)
{
    if(p!=-1)
    {
        depth[x]=depth[p]+1;
    }
    for(int i=0;i<adj[x].size();i++)
    {
        if(adj[x][i]!=p)
        {
            dfs(adj[x][i],x);
        }
    }
}
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n-1;i++)
    {
        int a,b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(1,-1);
    for(int i=2;i<=n;i++)
    {
        f[depth[i]]++;
        //cout<<depth[i]<<'\n';
        ans=max(ans,f[depth[i]]);
    }
    cout<<ans<<'\n';
    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