150512025-02-11 18:00:13csdavidLegtávolabbi leszármazottcpp17Accepted 50/50118ms6196 KiB
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

struct ember{
    int szulo=-1, d=0;
    vector<int> gyerek;
};

ember a[100000];

int main()
{
    int n, x, y, maxi=0, legtavolabbi;
    cin >> n;
    for(int i=1; i<n; i++){
        cin >> x >> y;
        x--;
        y--;
        a[y].szulo=x;
        a[x].gyerek.push_back(y);
    }
    for(int i=0; i<n; i++){
        if(a[i].szulo==-1){
            x=i;
            break;
        }
    }
    queue<int> q;
    q.push(x);
    while(!q.empty()){
        x=q.front();
        q.pop();
        for(auto& it:a[x].gyerek){
            q.push(it);
        }
    }
    cout << x+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/04ms3380 KiB
2Accepted0/079ms4828 KiB
3Accepted1/14ms3380 KiB
4Accepted3/33ms3380 KiB
5Accepted3/34ms3380 KiB
6Accepted1/14ms3380 KiB
7Accepted1/13ms3380 KiB
8Accepted1/14ms3380 KiB
9Accepted2/287ms5196 KiB
10Accepted3/387ms5132 KiB
11Accepted3/33ms3380 KiB
12Accepted4/487ms5352 KiB
13Accepted4/497ms5428 KiB
14Accepted3/39ms3636 KiB
15Accepted3/382ms5820 KiB
16Accepted3/390ms5364 KiB
17Accepted3/386ms5428 KiB
18Accepted4/468ms5172 KiB
19Accepted4/475ms5168 KiB
20Accepted4/4118ms6196 KiB