(2367)POJ

#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007

using namespace std;
/*

题意：

想法：

*/
int n,m;
int head[MAX];
int p[MAX];
int next[MAX];
int edgecnt;
int Count[MAX];
int ans[MAX];
int k;

void addedge(int u,int v)
{
    ++edgecnt;
    p[edgecnt] = v;
    next[edgecnt] = head[u];
    head[u] = edgecnt;
}
void init()
{
    memset(Count,0,sizeof(Count));
    memset(head,0,sizeof(head));
    memset(next,0,sizeof(next));
}
void topsort()
{
    k = 0;
    int sum = 0;
    stack<int>Q;
    int top =  -1;
    for(int i = 1; i<=n; i++)
    {
        if(Count[i]==0)
        {
            Q.push(i);
        }
    }
    while(!Q.empty())
    {
        int u = Q.top();
        Q.pop();
        ans[k++] = u;
        for(int i = head[u]; i; i = next[i])
        {
            int v = p[i];
            Count[v]--;
            if(Count[v]==0)
            {
                Q.push(v);
            }
        }
    }
}
int main()
{
    //freopen("date.in","r",stdin);
    int T;
    while(~scanf("%d",&n))
    {
        init();
        for(int i = 1; i<=n; i++)
        {
            int u,v;
            while(1)
            {
                u = i;
                scanf("%d",&v);
                if(v==0)break;
                else
                {
                    Count[v]++;
                    addedge(u,v);
                }
            }
        }
        topsort();
        for(int i = 0; i<k; i++)
        {
            if(i)
                printf(" ");
            printf("%d",ans[i]);
        }
        puts("");
    }
    return 0;
}