国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學(xué)院 > 開發(fā)設(shè)計(jì) > 正文

POJ 3687 Labeling Balls （拓?fù)渑判颍?/h1>
2019-11-10 18:06:21
字體：大 中 小
供稿：網(wǎng)友

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

題意

標(biāo)號(hào)為 1~n 的 N 個(gè)球，滿足給定的 M 個(gè)編號(hào)約束關(guān)系，輸出最終滿足關(guān)系的球的標(biāo)號(hào)。

思路

每一個(gè)標(biāo)號(hào)都有可能被其他標(biāo)號(hào)所約束，而對(duì)于這樣的題目我們可以聯(lián)想到拓?fù)渑判颉?/p>

但是題目要求使字典序盡可能的小，于是我們可以逆向建圖，然后從最大的標(biāo)號(hào)開始判斷，因?yàn)檫@樣保證了大一點(diǎn)的標(biāo)號(hào)在右邊，于是使得字典序也是最小的了。

AC 代碼

#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<vector>#include<queue>#include<set>using namespace std;#define M 210int in[M],arr[M];vector<int>G[M];int main(){ int T; scanf("%d",&T); while(T--) { int n,m; scanf("%d%d",&n,&m); for(int i=1; i<=n; i++) G[i].clear(); memset(in,0,sizeof(in)); for(int i=0; i<m; i++) { int a,b; scanf("%d%d",&a,&b); G[b].push_back(a); //反向建立鄰接表 in[a]++; //點(diǎn)的入度 } int w; for(w=n; w>0; w--) //從最大點(diǎn)開始 { int i; for(i=n; i>0; i--) //尋找入度為0的點(diǎn) if(!in[i])break; if(i==0)break; //沒有找到 arr[i]=w; in[i]=-1; //刪除該點(diǎn) for(int j=0; j<(int)G[i].size(); j++) { int v=G[i][j]; //臨接點(diǎn)的入度-1 if(in[v]>0) in[v]--; } } if(w!=0)

發(fā)表評(píng)論 共有條評(píng)論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表

主站蜘蛛池模板： 沙田区| 巧家县| 连城县| 沙湾县| 香河县| 万源市| 河池市| 靖安县| 溆浦县| 平谷区| 延津县| 湘潭县| 永德县| 迁安市| 牙克石市| 西林县| 普兰县| 南雄市| 内乡县| 砀山县| 同仁县| 津市市| 扎赉特旗| 临沧市| 苗栗县| 万盛区| 砚山县| 华坪县| 滦南县| 博野县| 宜春市| 北碚区| 南华县| 梁平县| 南雄市| 平阳县| 元阳县| 专栏| 集安市| 江孜县| 黎川县|