poj 36876 Labeling Balls

Labeling Balls
Time Limit: 1000MS
 
Memory Limit: 65536K
Total Submissions: 5819
 
Accepted: 1455
Description
Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that:

No two balls share the same label.

The labeling satisfies several constrains like "The ball labeled with a is lighter than the one labeled with b".

Can you help windy to find a solution?
Input
The first line of input is the number of test case. The first line of each test case contains two integers, N (1 ≤ N ≤ 200) and M (0 ≤ M ≤ 40,000). The next M line each contain two integers a and b indicating the ball labeled with a must be lighter than the one labeled with b. (1 ≤ a, b ≤ N) There is a blank line before each test case.
Output
For each test case output on a single line the balls' weights from label 1 to label N. If several solutions exist, you should output the one with the smallest weight for label 1, then with the smallest weight for label 2, then with the smallest weight for label 3 and so on... If no solution exists, output -1 instead.
Sample Input

5

4 0

4 1
1 1

4 2
1 2
2 1

4 1
2 1

4 1
3 2

Sample Output

1 2 3 4
-1
-1
2 1 3 4
1 3 2 4

Source
POJ Founder Monthly Contest – 2008.08.31, windy7926778
 
/* 괴이한 토폴로지 정렬, 번호가 가장 작은 숫자는 가능한 한 빨리 출력되어야 한다. 괴이한 것은 하나의 원칙에 따라 작은 머리가 반드시 앞에 있는 것은 아니지만, 큰 꼬리는 반드시 뒤에서 반대로 그림을 만들고 번호가 큰 칭찬을 찾아야 한다.http://imlazy.ycool.com/post.2144071.html */#include #include int map[201][201]; int in[201],cou[201]; int n,m,num; int main() { int t; scanf("%d",&t); while(t--) { int a,b; scanf("%d%d",&n,&m); memset(in,0,sizeof(in)); memset(cou,0,sizeof(cou)); num=0; for(int i=1;i<=n;i++) map[i][0]=0; for(int i=0;i=1;i--) if(in[i]==0) { in[i]=-1; cou[i]=++num; flag=1; if(map[i][0]>0) { for(int j=1;j<=map[i][0];j++) in[map[i][j]]--; } break; } if(!flag) break; } if(num