3687-Labeling Balls-反向拓扑排序
2015-08-06 19:45
381 查看
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
Sample Output
题意: 假设原来球一样重,后面告诉的条件,例如2 1 前面的球比后面的球重,把球按照重量排序,重的在后面且序号较大,然后输出每个球的位置,没有处理的球在原来的位子,反向排,从n到1
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
题意: 假设原来球一样重,后面告诉的条件,例如2 1 前面的球比后面的球重,把球按照重量排序,重的在后面且序号较大,然后输出每个球的位置,没有处理的球在原来的位子,反向排,从n到1
#include<stdio.h> #include<string.h> #include<stdlib.h> int n,m; int ls[500]; int du[250]; int map[250][250]; void tuo() { bool flag ; int c = 0; int mm; for(int i = n; i >= 1; i--) { flag = false; for(int j = n; j >= 1; j--) { if(du[j]==0) { mm = j; flag = true; break; } } if(!flag) { printf("-1\n"); return; } ls[mm] = i; du[mm]=-1; for(int j = 1;j <= n; j++) { if(map[mm][j]) du[j]--; } } for(int i = 1; i <= n; i++) { printf("%d",ls[i]); if(i < n) printf(" "); } printf("\n"); } int main() { int t; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(du,0,sizeof(du)); memset(map,0,sizeof(map)); for(int i = 0; i < m; i++) { int u,v; scanf("%d%d",&u,&v); if(!map[v][u]) { map[v][u]=1; du[u]++; } } tuo(); } return 0; }
相关文章推荐
- OC数字和集对象【官方文档】
- 模板方法模式
- curl转让query string逃生参数
- IOC原理解释
- Binary Search Tree
- Android学习路线——渐进
- lua_code_cache开关
- 我好换一个博客了
- 关于Character的digit,forDigit,getNumericValue方法的一点理解
- 我好换一个博客了
- JAVA项目1:聊天
- 【USACO OPEN 10】hop
- poj 1274 最大流或二分图,匈牙利算法
- 2015 多校联赛 ——HDU5353(构造)
- hibernate SQL Error: 8152, SQLState: 22001
- 反转一个单向链表
- poj-3687 Labeling Balls
- 2015 多校联赛 ——HDU5353(构造)
- Lua笔记7-闭包2
- nyoj 67 三角形面积【三角形面积公式】