POJ 3687 Labeling Balls(拓扑排序,逆序)
2015-08-14 18:01
417 查看
Labeling Balls
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12256 | Accepted: 3510 |
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 和普通拓扑排序一样,只是逆序赋值 ac代码:
#include<stdio.h> #include<string.h> #include<math.h> #include<iostream> #include<algorithm> #define INF 0x7fffffff #define MAXN 600 #define max(a,b) a>b?a:b #define min(a,b) a>b?b:a using namespace std; int pri[MAXN][MAXN]; int v[MAXN]; int num[MAXN]; int n,m; int main() { int i,j,a,b,k,t,bz; scanf("%d",&t); while(t--) { bz=0; scanf("%d%d",&n,&m); memset(pri,0,sizeof(pri)); memset(v,0,sizeof(v)); memset(num,0,sizeof(num)); for(i=0;i<m;i++) { scanf("%d%d",&a,&b); if(pri[b][a]==0) { pri[b][a]=1; v[a]++; } } for(i=n;i>=1;i--)//逆序 { k=-1; for(j=n;j>=1;j--) { if(v[j]==0) { k=j; num[j]=i; v[j]=-1; break; } } if(k!=-1) { for(j=1;j<=n;j++) { if(pri[k][j]) { v[j]--; pri[k][j]=0; } } } else { bz=1; break; } } if(bz) printf("-1\n"); else { for(i=1;i<=n-1;i++) { printf("%d ",num[i]); } printf("%d\n",num ); } } return 0; }
相关文章推荐
- leetcode刷题,总结,记录,备忘 101
- Java序列化
- java设计模式之五 —— 单例模式的三种模式优缺点整理
- 编程不过是文字游戏
- STL之map详解
- JLINK(SEGGER)灯不亮 USB不识别固件修复、clone修改
- JLINK(SEGGER)灯不亮 USB不识别固件修复、clone修改
- (4.1.2.6)Android 判断app是否在前台还是在后台运行
- Windows环境下安装wdl文件
- bzoj2594水管局长数据加强版题解
- .nav ul .mall a:hover 是什么意思
- 解决checkbox的attr(checked)一直为undefined问题
- JLINK(SEGGER)灯不亮 USB不识别固件修复、clone修改
- C中不安全函数
- JLINK(SEGGER)灯不亮 USB不识别固件修复、clone修改
- iOS真机系列之真机调试
- jack's things
- FFmpeg常用基本命令
- Ambiguous handler methods mapped for HTTP path
- cvs常用命令