L2-031 深入虎穴 (25分)

L2-031 深入虎穴 (25分)

#include <bits/stdc++.h>

#define int ll
//#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;

vector<int > ve[maxn];
int vis[maxn];
int id,dis;

int dfs(int fa,int d){
    if(ve[fa].size()==0&&d>=dis) dis=d,id=fa;
    for(auto x:ve[fa]) dfs(x,d+1);
}

void solve() {
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        int k;
        cin>>k;
        for (int j = 0; j < k; ++j) {
            int x;
            cin>>x;
            vis[x]=1;
            ve[i].push_back(x);
        }
    }
    int rk;
    for(int i=1;i<=n;i++)
        if(vis[i]==0) {
            rk=i;
            break;
        }
    dfs(rk,0);
    cout<<id;
}

signed main() {
    //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}