213322026-01-12 18:33:36algoproLegtávolabbi leszármazottcpp17Accepted 50/50101ms8356 KiB
// UUID: 5b327ef0-042f-40e7-9a57-31b970c92f52
#include <bits/stdc++.h>
using namespace std;

int cnt=0; int hindex=0;
vector <vector<int>> graph;
vector <bool> voltE;

void dfs (int i, int crt) {
    crt+=1;
    if (crt>cnt) {
        cnt=crt;
        hindex=i;
    }
    for (int x : graph[i]) {
        dfs(x,crt);
    }
}
int main() {
	int n;
    cin >> n;
    graph.resize(n);
    voltE.resize(n);

    for (int i=0; i<n-1; i++) {
        int a,b; cin >> a >> b;
        a--; b--;
        graph[a].push_back(b);
        voltE[b]=1;
    }
    int first=0;
    for (int i=0; i<n; i++) {
        if (!voltE[i]) {
            first=i;
            break;
        }
    }
    dfs(first,0);
    cout << hindex+1;     
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/075ms3892 KiB
3Accepted1/11ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms560 KiB
8Accepted1/11ms316 KiB
9Accepted2/289ms4144 KiB
10Accepted3/382ms4192 KiB
11Accepted3/31ms500 KiB
12Accepted4/497ms6088 KiB
13Accepted4/4101ms6196 KiB
14Accepted3/38ms564 KiB
15Accepted3/389ms6196 KiB
16Accepted3/383ms6196 KiB
17Accepted3/398ms5928 KiB
18Accepted4/464ms4404 KiB
19Accepted4/479ms5580 KiB
20Accepted4/498ms8356 KiB