213032026-01-12 18:11:26algoproLegtávolabbi leszármazottcpp17Wrong answer 2/5089ms6316 KiB
// UUID: bc413f74-16a4-41c2-bbc5-84f776f531ab
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>>gyerek;
vector<bool>volt;
vector<int>tavolsagok;
vector<int>szulo;
void melysegi(int csucs){
	volt[csucs] = true;
	tavolsagok[csucs] = tavolsagok[szulo[csucs]]+1;
	for(int i : gyerek[csucs]){
		if(volt[i] == false){
			melysegi(i);
		}
	}
}

int main() {
	int n;
	cin >> n;
	gyerek.resize(n+1);
	szulo.resize(n+1);
	for(int i = 0; i < n-1; i++){
		int apa, fia;
		cin >> apa >> fia;
		gyerek[apa].push_back(fia);
		szulo[fia] = apa;
	}
	int os;
	for(int i = 1; i < n+1; i++){
		if(gyerek[i].empty()){
			os = i;
		}
	}
	volt.resize(n+1, false);
	tavolsagok.resize(n+1);
	tavolsagok[os] = 0;
	melysegi(n);
	int maxtav = 0;
	int kiirni = 0;
	for(int i = 1; i <= n; i++){
		if(tavolsagok[i] > maxtav){
			maxtav = tavolsagok[i];
			kiirni = i;
		}
	}
	cout << kiirni;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Accepted0/01ms316 KiB
2Wrong answer0/075ms4660 KiB
3Accepted1/11ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/11ms316 KiB
7Accepted1/11ms316 KiB
8Wrong answer0/12ms316 KiB
9Wrong answer0/278ms5176 KiB
10Wrong answer0/383ms5032 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/489ms5412 KiB
13Wrong answer0/482ms5424 KiB
14Wrong answer0/38ms828 KiB
15Wrong answer0/382ms5524 KiB
16Wrong answer0/372ms5016 KiB
17Wrong answer0/379ms5248 KiB
18Wrong answer0/459ms4144 KiB
19Wrong answer0/468ms4660 KiB
20Wrong answer0/482ms6316 KiB