304346: CF830E. Perpetual Motion Machine
Memory Limit:512 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Perpetual Motion Machine
题意翻译
有 $n$ 台机器,每个机器有一个设定值 $d_i$,它可以定为任意非负整数。当某一台机器的设定值为 $d_i$ 时,它每秒会消耗 $d_i^2$ 的能量,如果某一对机器 $y,z$ 通过电线直接连接,每秒会产生 $d_y \times d_z$ 的能量。 现在,给出机器和电线的连接情况,试问是否存在一种设定 $n$ 个机器的设定值的方案,使得 $\exists i,d_i \neq 0$ 且能量的总生产值大于等于总消耗值。 $n, m \leq 10^5$。题目描述
Developer Petr thinks that he invented a perpetual motion machine. Namely, he has a lot of elements, which work in the following way. Each element has one controller that can be set to any non-negative real value. If a controller is set on some value $ x $ , then the controller consumes $ x^{2} $ energy units per second. At the same time, any two elements connected by a wire produce $ y·z $ energy units per second, where $ y $ and $ z $ are the values set on their controllers. Petr has only a limited number of wires, so he has already built some scheme of elements and wires, and is now interested if it's possible to set the controllers in such a way that the system produces at least as much power as it consumes, and at least one controller is set on the value different from $ 0 $ . Help him check this, and if it's possible, find the required integer values that should be set. It is guaranteed that if there exist controllers' settings satisfying the above conditions, then there exist required integer values not greater than $ 10^{6} $ .输入输出格式
输入格式
There are several (at least one) test cases in the input. The first line contains single integer — the number of test cases. There is an empty line before each test case. The first line of test case contains two integers $ n $ and $ m $ ( $ 1<=n<=10^{5} $ , $ 0<=m<=10^{5} $ ) — the number of elements in the scheme and the number of wires. After that, $ m $ lines follow, each of them contains two integers $ a $ and $ b $ ( $ 1<=a,b<=n $ ) — two elements connected by a wire. No element is connected with itself, no two elements are connected by more than one wire. It is guaranteed that the sum of $ n $ and the sum of $ m $ over all test cases do not exceed $ 10^{5} $ . For hacks you can only use tests with one test case.
输出格式
Print answer for each test case. For each test case print "YES" if it's possible to set the controllers in such a way that the consumed power is not greater than the power produced, and the required values on the next line. The settings should be integers from $ 0 $ to $ 10^{6} $ , inclusive, and at least one value should be different from $ 0 $ . If there are multiple answers, print any of them. If it's not possible to set the controllers in the required way, print one line "NO".
输入输出样例
输入样例 #1
4
4 4
1 2
2 3
3 4
4 2
3 2
2 3
3 1
4 6
1 2
3 4
4 2
1 4
1 3
3 2
10 9
2 1
3 2
5 2
6 2
2 7
2 8
2 9
2 10
4 2
输出样例 #1
YES
1 2 2 1
NO
YES
1 1 1 1
YES
1 5 1 1 1 1 1 1 1 1