Submission #1143249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143249		andrei0546	Triumphal arch (POI13_luk)	C++20	0 / 100	163 ms	18776 KiB

luk

#include <bits/stdc++.h>

using namespace std;
int f[300005],viz[300005];
vector<int>v[300005];
int main()
{
    int n,a,b;
    cin>>n;
    for(int i=1;i<n;i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    queue<pair<int,int>>q;
    q.push({1,0});
    viz[1]=1;
    while(!q.empty())
    {
        int d=q.front().second,i=q.front().first;
        q.pop();
        for(int k=0;k<v[i].size();k++)
        {
            int j=v[i][k];
            if(viz[j]==0)
            {
                viz[j]=1;
                f[d+1]++;
                q.push({j,d+1});
            }
        }
    }
    int rez=0;
    for(int i=0;i<=n;i++)
        rez=max(rez,f[i]);
    cout<<rez;
    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