155632025-02-20 13:11:40MrkzLegtávolabbi leszármazottcpp17Time limit exceeded 2/50400ms1116 KiB
#include <bits/stdc++.h>
using namespace std;
int N;
vector<pair<int,int>>kapcs;
void beolvas(){
    cin>>N;
    kapcs.resize(N);
    for(int i=1;i<N;i++){
        cin>>kapcs[i].first>>kapcs[i].second;
    }
}
int main()
{
    beolvas();
    int utod;
    for(int i=1;i<=N;i++){
        bool b=false;
        for(int j=1;j<N;j++)
            if(kapcs[j].first==i)
                b=true;
        if(b==false)
            utod=i;
    }
    cout<<utod;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0388ms1116 KiB
3Accepted1/11ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/11ms316 KiB
7Accepted1/11ms316 KiB
8Wrong answer0/12ms500 KiB
9Time limit exceeded0/2400ms1076 KiB
10Time limit exceeded0/3400ms1076 KiB
11Wrong answer0/31ms316 KiB
12Time limit exceeded0/4400ms1076 KiB
13Time limit exceeded0/4386ms1076 KiB
14Wrong answer0/378ms508 KiB
15Time limit exceeded0/3382ms1076 KiB
16Time limit exceeded0/3400ms1076 KiB
17Time limit exceeded0/3381ms1076 KiB
18Time limit exceeded0/4381ms820 KiB
19Time limit exceeded0/4381ms820 KiB
20Time limit exceeded0/4398ms1076 KiB