Graph Theory
来源:互联网 发布:房屋中介软件哪个好 编辑:程序博客网 时间:2024/05/16 06:57
Graph Theory
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
Little Q loves playing with different kinds of graphs very much. One day he thought about an interesting category of graphs called “Cool Graph”, which are generated in the following way:
Let the set of vertices be {1, 2, 3, …, n}. You have to consider every vertice from left to right (i.e. from vertice 2 to n). At vertice i, you must make one of the following two decisions:
(1) Add edges between this vertex and all the previous vertices (i.e. from vertex 1 to i−1).
(2) Not add any edge between this vertex and any of the previous vertices.
In the mathematical discipline of graph theory, a matching in a graph is a set of edges without common vertices. A perfect matching is a matching that each vertice is covered by an edge in the set.
Now Little Q is interested in checking whether a ”Cool Graph” has perfect matching. Please write a program to help him.
Input
The first line of the input contains an integer T(1≤T≤50), denoting the number of test cases.
In each test case, there is an integer n(2≤n≤100000) in the first line, denoting the number of vertices of the graph.
The following line contains n−1 integers a2,a3,…,an(1≤ai≤2), denoting the decision on each vertice.
Output
For each test case, output a string in the first line. If the graph has perfect matching, output ”Yes”, otherwise output ”No”.
Sample Input
3
2
1
2
2
4
1 1 2
Sample Output
Yes
No
No
#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<string>#include<iomanip>#include<cmath>#define ll long long int #define maxsize 105000#define INF 99999999using namespace std;int a[maxsize];int main(){ int t;int n; while (cin >> t) { while (t--) { int sum = 0; cin >> n;int flag = 0; for (int i = 2;i <= n;i++) { cin >> a[i]; if (a[i] == 1) { if (sum<i-1) { sum += 2; } } } if (n % 2) { cout << "No" << endl; } else { if (sum == n) cout << "Yes" << endl; else cout << "No" << endl; } } } return 0;}
- Graph Theory
- Graph Theory
- Graph Theory
- timus graph theory
- Graph Theory - Assignment Problem
- Spectral Graph Theory
- Tournament (graph theory)
- HDU6029-Graph Theory
- HDU 6029 Graph Theory
- HDU6029 Graph Theory
- HDU 6029 Graph Theory
- HDU 6029 Graph Theory
- HDU 6029 Graph Theory
- hdoj 6029 Graph Theory
- hdu 6029 Graph Theory
- HDU 6029 Graph Theory
- HDU6029 Graph Theory
- Graph Theory HDU
- Easy Summation
- 【递推】洛谷 P1192 台阶问题
- 打印1到最大的n位数
- 界面类型与分析
- JavaScript BOM重要方法——计时事件
- Graph Theory
- transform应用
- [设计模式]适配器模式(Adapter)
- Java Web研发工程师新手入门指南
- CentOS7实现网卡bond
- 数据结构与算法分析 c++11 List实现
- Java多线程 -- 多线程的异常捕捉
- Boost库命名规则
- TCP套接字与UDP套接字编程