Submission #1143210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143210		victor_c	Triumphal arch (POI13_luk)	C++20	0 / 100	2095 ms	324 KiB

luk

#include <iostream>

using namespace std;
int f[10005], tata[10005];
int main()
{
    int n, a, b, aux, cnt=1, maxx=0;
    cin>>n;
    tata[1]=1;
    for(int i=1; i<n; i++)
    {
        cin>>a>>b;
        if(tata[a]!=0) tata[b]=a;
        else tata[a]=b;
    }
    for(int i=1; i<=n; i++)
    {
        aux=tata[i];
        while(tata[i]!=1)
        {
            tata[i]=tata[aux];
            cnt++;
        }
        f[cnt]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(f[i]>maxx) maxx=f[i];
    }
    cout<<maxx;
    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