ural 1022. Genealogical Tree Topological sort

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
using namespace std;

struct Node{
int parentCount;
vector<int>son;
Node() :parentCount(0){ son.clear(); }
};

void func(){

vector<Node>v;
size_t n, i, j, num;
Node node;

cin >> n;
v.resize(n, node);
for (i = 0; i < n; i++){
while (cin >> num&&num){
v[i].son.push_back(num - 1);
v[num - 1].parentCount++;
}
}

vector<int>ans;
queue<int>q;

for (i = 0; i < n; i++)
{
if (v[i].parentCount == 0)q.push(i);
}

while (!q.empty()){
num = q.front();
q.pop();
ans.push_back(num);

int len = v[num].son.size();
for (i = 0; i < len; i++){
j = v[num].son[i];
v[j].parentCount--;
if (v[j].parentCount == 0)
q.push(j);
}
}

cout << ans[0] + 1;
for (i = 1; i < n; i++)
cout << ' ' << ans[i] + 1;

}

int main(){

freopen("out.txt", "w", stdout);
freopen("in.txt", "r", stdin);

func();

}