HDU5423 Rikka with Tree
2017-02-24 15:45
288 查看
题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=5423题解:
中文题意链接:http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=625&pid=1002
本题实际上就是看出除了底层有叶子节点,其他的地方有没有叶子节点,有的话,输出“NO”,不然就输出“YES”。里面需要进行排序,直接用set做。
代码:
#include <set> #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define met(a,b) memset(a,b,sizeof(a)) #define inf 0x3f3f3f3f const int maxn = 1e3+10; int main() { int n; while(scanf("%d",&n)!=EOF) { int m=n-1; set<int> num[maxn]; for(int i=0;i<m;i++) { int x,y; scanf("%d%d",&x,&y); num[x].insert(y); } int flag=0; for(int i =0;i<maxn;i++) { if(num[i].size()>1) { for(set<int>:: iterator j=num[i].begin();j!=num[i].end(); j++) { int pos=*j; if(num[pos].size()!=0) { flag=1; break; } } } } if(flag) printf("NO\n"); else printf("YES\n"); } }
相关文章推荐
- hdu5423 Rikka with Tree
- hdu5423 Rikka with Tree(DFS)
- ACM学习历程—HDU5423 Rikka with Tree(搜索)
- HDU5423 Rikka with Tree(树,深搜DFS)
- hdu 5423 Rikka with Tree(思路)
- hdu 5423 Rikka with Tree 乱搞
- hdu 5423 Rikka with Tree DFS
- 【hihocoder1455】Rikka with Tree III 题解
- hdu 5423 Rikka with Tree(思路)
- HDU - 5423 Rikka with Tree
- hdu 5423 Rikka with Tree(dfs)
- Rikka with Tree(DFS+树的性质)
- hdu 5423 Rikka with Tree(思路)
- HDU 5423 Rikka with Tree(DFS)
- [点分治] HihoCoder #1462 Challenge 26 Rikka with Tree IV
- hdu 5423 Rikka with Tree(思路)
- BestCoder Round #53 (div.2) HDOJ5423 Rikka with Tree(bfs)
- HDU 5432 Rikka with Tree (BestCoder Round #53 (div.2))
- hihocoder 1455 : Rikka with Tree III
- hdu 5423 Rikka with Tree(思路)