poj3687Labeling Balls(反向拓扑+优先队列)
来源:互联网 发布:mac口红官网包装 编辑:程序博客网 时间:2024/06/05 23:40
题目链接:
题意:就是给了m个限制条件,然后形式是啊a,b就是说编号为a的小球比编号为b的小球青,最后输出字典序最小的序列出来。
思路:如果正常的正向建图的话,有可能得到的不是字典序最小的序列。。比如有这样一个例子1->5->4,6->2->3,如果正向建图得到的序列将会是
5 2 1 3 4 6,,而正确的序列式怎么感觉碰到一些题目按字典序都要逆向枚举啊。。1 3
4 6 5 2.。所以要反向拓扑。。
5 2 1 3 4 6,,而正确的序列式怎么感觉碰到一些题目按字典序都要逆向枚举啊。。1 3
4 6 5 2.。所以要反向拓扑。。
题目:
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
54 04 11 14 21 22 14 12 14 13 2
Sample Output
1 2 3 4-1-12 1 3 41 3 2 4
Source
代码为:
#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<cstring>using namespace std;const int maxn=200+10;vector<int>vec[maxn];int in[maxn],map[maxn][maxn],ans[maxn];int t,n,m,u,v;void topo(){ priority_queue<int>Q; memset(ans,0,sizeof(ans)); while(!Q.empty()) Q.pop(); int cal=n,id=0,flag=0; for(int i=1;i<=n;i++) { if(in[i]==0) Q.push(i); } while(!Q.empty()) { int temp=Q.top(); Q.pop(); ans[temp]=cal--; for(int i=0;i<vec[temp].size();i++) { if(--in[vec[temp][i]]==0) Q.push(vec[temp][i]); } } if(cal!=0) { cout<<"-1"<<endl; return; } for(int i=1;i<n;i++) printf("%d ",ans[i]); printf("%d\n",ans[n]);}int main(){ scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(map,0,sizeof(map)); for(int i=1;i<=n;i++) { in[i]=0; vec[i].clear(); } for(int i=1;i<=m;i++) { scanf("%d%d",&u,&v); if(map[u][v]==0) { map[u][v]=1; vec[v].push_back(u); in[u]++; } } topo(); } return 0;}
- poj3687Labeling Balls(反向拓扑+优先队列)
- poj3687Labeling Balls【反向拓扑排序 模板】
- poj3687Labeling Balls(逆序拓扑)
- POJ3687Labeling Balls(拓扑排序)
- POJ:3687 Labeling Balls (反向建图+拓扑排序+优先队列)
- POJ 3687 Labeling Balls(拓扑排序【反向建图+优先队列】)
- 拓扑排序+优先队列Labeling Balls
- hdu 4857 反向拓扑排序+优先队列
- POJ 3687 Labeling Balls 拓扑排序 优先队列实现
- POJ 3687:Labeling Balls(优先队列+拓扑排序)
- HDU 4857 (反向拓扑排序 + 优先队列)
- HDU 4857 逃生 【拓扑排序+反向建图+优先队列】
- 杭电-4857逃生(反向拓扑+优先队列+逆向输出)
- HDU 4857 逃生 (反向拓扑排序+优先队列)
- 【反向拓扑+优先队列】HDU4857逃生【BestCoder Round #1】
- 【HD 4857】逃生(反向构图+拓扑排序+优先队列)
- hdu 4857 逃生 反向拓扑排序+优先队列
- Poj 3687 Labeling Balls【逆向建图+拓扑排序+优先队列+思维】
- Codeforces 458A (01串下黄金分割公式的拓展公式)
- 软件测试
- extjs 右下角弹出窗口
- 程序员练级之路 (作者:陈皓)
- NOIP 2012 题解
- poj3687Labeling Balls(反向拓扑+优先队列)
- spark在那里指定master URL呢?
- 蓝牙学习
- Python 网页爬虫 & 文本处理 & 科学计算 & 机器学习 & 数据挖掘兵器谱
- OC属性总结全!
- Oracle EBS Interface – OM : Sale Order import
- 计算机单位换算
- Fedora18解决无线上网和屏幕亮度调节问题
- HDOJ 1863 畅通工程(并查集)