Friend-Graph 野性酷女 2022-06-10 13:06 162阅读 0赞 # Friend-Graph # **Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3254 Accepted Submission(s): 523** Problem Description It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team. In a team with n members,if there are three or more members are not friends with each other or there are three or more members who are friends with each other. The team meeting the above conditions can be called a bad team.Otherwise,the team is a good team. A company is going to make an assessment of each team in this company. We have known the team with n members and all the friend relationship among these n individuals. Please judge whether it is a good team. Input The first line of the input gives the number of test cases T; T test cases follow.（T<=15） The first line od each case should contain one integers n, representing the number of people of the team.( n≤3000![Image 1][]) Then there are n-1 rows. The i![Image 1][]th row should contain n-i numbers, in which number a![Image 1][]ij![Image 1][]![Image 1][] represents the relationship between member i and member j+i. 0 means these two individuals are not friends. 1 means these two individuals are friends. Output Please output ”Great Team!” if this team is a good team, otherwise please output “Bad Team!”. Sample Input 1 4 1 1 0 0 0 1 Sample Output Great Team! #include<cstdio> int a[3005][3005]; int main() { int n,m; scanf("%d",&n); while(n--) { int ok=0; scanf("%d",&m); for(int i=0; i<m-1; i++) for(int l=0; l<m-1-i; l++) scanf("%d",&a[i][l]); if(m<3) { printf("Great Team!\n"); continue; } for(int i=0; i<m-1; i++) { for(int l=0; l<m-1-i; l++) { for (int k=l+1; k<m-1-i; k++) { int s=a[i][l]+a[i][k]+a[i+l+2-1][i+k+2-(i+l+1+1)-1]; if(s==3||s==0) { printf("Bad Team!\n"); ok=1; break; } } if(ok) break; } if(ok) break; } if(!ok) printf("Great Team!\n"); } return 0; } [Image 1]:
还没有评论，来说两句吧...