zoukankan      html  css  js  c++  java
  • POJ 3687 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:

    1. No two balls share the same label.
    2. 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

    题意和思路:给你标号为1~N的球,a b代表a比b轻,需要你排列出这N个球的顺序,要求按编号字典序排列,最后要你依次给出这N个球的重量(这里要注意不是叫你给出编号的顺序,而是1的质量,2的质量...N的质量这样输出,就这里这WA了...)。思路很简单,就是把轻的球加度,然后重的指向轻的,然后度0的就是重的,优先队列要用降序,这样就能保证度为0的比较重的先取出,(这里用倒着存到ans[ ],从头往后读就是编号的正确顺序),但我们要注意他要我们输出重量,所以ans[ ]编号里从最后一个开始依次赋值1~N

    代码:

    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<cctype>
    #include<queue>
    #include<cmath>
    #include<string>
    #include<stack> 
    #include<set>
    #include<map>
    #include<vector>
    #include<iostream>
    #include<algorithm>
    #include<sstream>
    #define ll long long 
    const int N=210;
    const int INF=1e9;
    using namespace std;
    int n,m,degree[N],ans[N],weight[N];    //ans记录倒序的编号,weight记录最终答案
    vector<int> g[N];     //邻接表
    void topo(){
    	int cnt=0;
    	priority_queue<int,vector<int>,less<int> > q;
    	for(int i=1;i<=n;i++){
    		if(degree[i]==0) q.push(i);
    	}
    	while(!q.empty()){
    		int v=q.top();
    		q.pop();
    		ans[cnt]=v;
    		cnt++;
    		for(int i=0;i<g[v].size();i++){
    			int p=g[v][i];
    			degree[p]--;
    			if(degree[p]==0) q.push(p);
    		}
    	}
    	if(cnt!=n) cout<<-1<<endl;
    	else{
    		int wei=1;
    		for(int i=cnt-1;i>=0;i--){
    			weight[ans[i]]=wei++;
    		}
    		for(int i=1;i<=n;i++) printf("%d ",weight[i]); 
    		cout<<endl;
    	}
    }
    int main(){
    	int T,a,b;
    	scanf("%d",&T);
    	while(T--){
    		memset(degree,0,sizeof(degree));
    		for(int i=0;i<N;i++) g[i].clear();
    		scanf("%d%d",&n,&m);
    		for(int i=0;i<m;i++){
    			scanf("%d%d",&a,&b);
    			degree[a]++;	//轻的加度 
    			g[b].push_back(a);	
    		}
    		topo();
    	}
        return 0;  
    }  

  • 相关阅读:
    设置材质球的材质,是第几个
    转载渲染。
    系统的时间调不错,就是界面躁动太多,要是允许话还是在自己的界面中加入比较薄, 不过这个很方便。
    清除poly修改器的脚本,效果还好。
    不用string了用getFilenameFile 函数 索引名字更快
    判断平pickbutton 节点是否被删除, 这个事件放在点击事件之内。
    字符串加入到数组的号办法。
    收集每个mesh 面的id 号, 这个很有用,可以用来查找物体共有几个id 效果好。
    Evervolv android 源码编译
    zoj 2112 Dynamic Rankings(SBT in SegTree)
  • 原文地址:https://www.cnblogs.com/KirinSB/p/9409098.html
Copyright © 2011-2022 走看看