159032025-03-10 10:41:41ercseferencLegtávolabbi leszármazottcpp17Accepted 50/5046ms6140 KiB
#include <bits/stdc++.h>
using namespace std;
struct pont{int apa=0; vector<int>fia;};
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,x,y; cin>>n; vector<pont>a(n+1);
    for(int i=0; i<n-1; i++){
        cin>>x>>y; a[x].fia.push_back(y); a[y].apa=x;}
    int os;
    for(int i=1; i<=n; i++)
        {if(a[i].apa==0){os=i; break;}}
    vector<int>l1,l2; l1.push_back(os);  bool nincs=0;
    while(!nincs){
        for(int i=0; i<l1.size(); i++){
           for(int j=0; j<a[l1[i]].fia.size(); j++){
                l2.push_back(a[l1[i]].fia[j]);}}
        if(l2.size()==0){nincs=1; cout<<l1[0];}
        l1=l2; l2.clear();}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/035ms4688 KiB
3Accepted1/11ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms548 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted1/11ms500 KiB
9Accepted2/241ms5356 KiB
10Accepted3/337ms5236 KiB
11Accepted3/31ms316 KiB
12Accepted4/445ms5568 KiB
13Accepted4/446ms5428 KiB
14Accepted3/34ms820 KiB
15Accepted3/335ms5440 KiB
16Accepted3/341ms5116 KiB
17Accepted3/341ms5172 KiB
18Accepted4/430ms4148 KiB
19Accepted4/435ms4748 KiB
20Accepted4/443ms6140 KiB