ZOJ2856 - Happy Life
来源:互联网 发布:linux服务器访问外网 编辑:程序博客网 时间:2024/06/14 17:47
题目出处:点击打开链接
Do you know Utopia? It's a perfect world in which everyone leads a happy life.
A fairy wants to make a naive Utopia City. She studies the factors that have an impact on people's happiness and thinks that a person is happy if and only if all other persons' total "influence factor" on him (or her) is nonnegative. Each person has an influence factor on another person, which may be a positive integer or negative integer or 0. The influence factor is always symmetric, that is, if person A has an influence factor f on person B, it means that person B also has an "influence factor" f on A. So we can say the influence factor between person A and B is f without confusion. A person's influence factor on himself (or herself) is always 0. So let f(i, j) be the influence factor between person i and person j and person i's happiness(i) is well defined as follows:
Obviously there may be some persons who are not happy. Though the fairy cannot change any influence factor, she can give every person a property p(i) which is always +1 or -1. Under the fairy's magical definition, a person i's happiness(i)' is redefined as follow:
Person i feels happy if the value of happiness(i)' is nonnegative. But the fairy wonders whether she can give everyone a property to make all of them happy so that she can build her ideal naive Utopia successfully.
Since you're an ace programmer, the fairy asks you to help her to fulfill her dream. Can you help her?
Input
The input contains multiple test cases!
Each test case starts with an integer N (2 <= N <= 200), the number of persons in the city. After that there're N lines of integers and each line consists of N integers. The j-th integer of the i-th line of the matrix indicates the influence factor f(i,j) (-1000 < f(i,j) < 1000).
Proceed to the End Of File (EOF).
Output
For each test case, if the fairy fails, output a single line with "No" (without the quotations), otherwise output "Yes" (without the quotations) in the first line, followed by N lines, each line contains exactly a "+" (without the quotations) or a "-"(without the quotations) to indicate that the fairy should give the i-th person property +1 or -1 to fulfill her dream.
Sample Input
3
0 1 3
1 0 -1
3 -1 0
2
0 -10
-10 0
Sample Output
Yes
-
+
-
Yes
+
-
Author: CAO, Peng
Source: Zhejiang Provincial Programming Contest 2007
一开始以为暴力过去会超时,结果没有,但是有bug,可还是过了,真的有bug,真的有bug,真的有bug重要的是说三遍
the accepted code like this;
#include <stdio.h>#include <iostream>#define MAXN 222using namespace std;int main(){ int n; int a[MAXN][MAXN]; int ans[MAXN]; int i,j; while( scanf("%d",&n)!=EOF ) { for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { scanf("%d" ,&a[i][j]); } ans[i]=1; } int index=1; for(;;) { if(index==n+1){ break; } int sum=0; for(i=1; i<=n; i++){ sum+=ans[i]*a[index][i]; } if(sum*ans[index]<0){ ans[index]*=-1; index=1; } else index++; } puts("Yes"); for(int i=1; i<=n; i++){ if(ans[i]<0) puts("-"); else puts("+"); } } return 0;}
- ZOJ2856 - Happy Life
- happy work, happy life
- Happy WiFi,Happy life
- 【暴力】ZOJ 1856 Happy Life
- Living a Rewarding, Successful, and Happy Life
- The ABCs of Living a Happy Life
- The ABCs of Living a Happy Life
- ZOJ 2856Happy Life(数论,暴力)
- How to Living a Rewarding, Successful, and Happy Life
- Life = 1/2 Happy+1/2 Sad
- ZOJ 2856 Happy Life / 太暴力了 我不会啊!!
- happy!
- Happy
- Happy?
- happy
- happy!
- Happy
- happy
- 【Android】【笔记】《Android 入门经典》part 11 ContentProvider 数据共享
- deep learning tutorials 的翻译版+theano教程的翻译版本
- JSONException: Value of type java.lang.String cannot be converted to JSONObject
- 关于linux的用户,组,以及权限的知识结构
- leetcode 3 Longest Substring Without Repeating Characters
- ZOJ2856 - Happy Life
- 集训队专题(2)1006 Mistwald
- 20160130交易记录
- 【Android】【笔记】《Android 入门经典》part 12 线程与消息处理
- 一个不用密码的用户系统
- git-使用指南
- LeetCode #237 Delete Node in a Linked List
- 遍历新姿势
- opencv(2)