Submission #16,118

2025-04-03 08:15:15

cpp17

Accepted 50/50

65ms

2088 KiB

#include <iostream>

using namespace std;

int os[100001], melyseg[100001];

int mely (int csucs)
{
    if (!os[csucs]) return 0;
    if (!melyseg[csucs]) melyseg[csucs] = mely(os[csucs])+1;
    return melyseg[csucs];
}


int main()
{
    int n;
    cin >> n;

    int apa, fia;

    for (int i = 1; i < n; i++) {
        cin >> apa >> fia;
        os[fia] = apa;
    }

    mely(1);

    int maxi = 1;

    for (int i = 2; i <= n; i ++)
    {
        if (mely(i)>melyseg[maxi]) maxi = i;
    }

    cout << maxi;

    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	59ms	1076 KiB
		3	Accepted	1/1	1ms	500 KiB
		4	Accepted	3/3	1ms	316 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	1/1	1ms	316 KiB
		7	Accepted	1/1	1ms	508 KiB
		8	Accepted	1/1	1ms	316 KiB
		9	Accepted	2/2	63ms	940 KiB
		10	Accepted	3/3	63ms	1016 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	4/4	63ms	1052 KiB
		13	Accepted	4/4	64ms	1088 KiB
		14	Accepted	3/3	7ms	328 KiB
		15	Accepted	3/3	61ms	1284 KiB
		16	Accepted	3/3	57ms	1344 KiB
		17	Accepted	3/3	61ms	1300 KiB
		18	Accepted	4/4	46ms	1268 KiB
		19	Accepted	4/4	54ms	1776 KiB
		20	Accepted	4/4	65ms	2088 KiB