Submission #1143248

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143248		laurentiu_t	Triumphal arch (POI13_luk)	C++20	0 / 100	135 ms	16904 KiB

luk

#include<bits/stdc++.h>
using namespace std;

int n,d[300001],nr[300001],r=1;

vector<int> a[300001];

queue<int> q;

int main()
{
    cin>>n;
    for(int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        a[x].push_back(y);
    }

    q.push(1);
    d[1]=1;

    while(!q.empty())
    {
        int x=q.front();
        q.pop();

        for(int i=0;i<a[x].size();i++)
            if(d[a[x][i]]==0)
        {
            d[a[x][i]]=d[x]+1;
            nr[d[a[x][i]]]++;
            r=max(r,nr[d[a[x][i]]]);
            q.push(a[x][i]);
        }
    }

    cout<<r;
}

• 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