PAT：1053. Path of Equal Weight (30) AC

#include<stdio.h>
#include<vector>
#include<queue> #include<algorithm> using namespace std; const int MAX=1010; int n,m; //n个节点，m个非叶子节点 long long int S; //待测权值 long long int weight[MAX]; //每个节点的权值 vector<int> child[MAX]; //存储节点 bool cmp(int a,int b) { return weight[a]>weight[b]; } long long int sum=0; vector<int> path; //存路径权值 void DFS(int root) { if(child[root].size()==0) { if(sum==S) { printf("%d",path.front()); //权值S不为0，符合条件一定有路径。单独输出首个，控制后面空格数 for(int i=1 ; i<path.size() ; ++i) printf(" %d",path[i]); //输出剩余路径 printf("\n"); } return; } for(int i=0 ; i<child[root].size() ; ++i) { sum+=weight[child[root][i]]; //加上该孩子的权值 //printf("root=%d, i=%d, sum=%lld, child[root][i]=%d\n", root, i, sum, child[root][i]); path.push_back(weight[child[root][i]]); //该孩子加入到路径 DFS(child[root][i]); sum-=path[path.size()-1]; path.pop_back(); } } int main() { scanf("%d%d%lld",&n,&m,&S); for(int i=0 ; i<n ; ++i) scanf("%lld",&weight[i]); for(int i=0 ; i<m ; ++i) { int father,k,c; scanf("%d%d",&father,&k); for(int j=0 ; j<k ; ++j) { scanf("%d",&c); child[father].push_back(c); } sort(child[father].begin(),child[father].end(),cmp); //【skill】对vector进行排序，保证遍历的时候从大到小 } path.push_back(weight[0]); sum+=weight[0]; DFS(0); return 0; }

转载于:https://www.cnblogs.com/Evence/p/4321869.html

PAT：1053. Path of Equal Weight (30) AC相关推荐

PAT甲级1053 Path of Equal Weight (30分) ：[C++题解]dfs求树的路径长度、邻接表
文章目录题目分析题目链接题目分析输入样例: 20 9 24 10 2 4 3 5 10 2 18 9 7 2 2 1 3 12 1 8 6 2 2 00 4 01 02 03 04 02 1 ...
PAT甲级 -- 1053 Path of Equal Weight (30 分)
Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weig ...
PAT (Advanced Level) Practice 1053 Path of Equal Weight (30 分)
1053 Path of Equal Weight (30 分) Given a non-empty tree with root R, and with weight Wi assigned to ...
1053 Path of Equal Weight (30分)
1053 Path of Equal Weight (30分) Given a non-empty tree with root R, and with weight Wi assigned t ...
1053 Path of Equal Weight
1053 Path of Equal Weight (30 分) Given a non-empty tree with root R, and with weight Wi assigned ...
1053 Path of Equal Weight （30 分）
题目 Given a non-empty tree with root R, and with weight WiW_iWi assigned to each tree node TiT_iTi. ...
【PAT】A1053 Path of Equal Weight
Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weig ...
1053 Path of Equal Weight(超级无敌详细注释+45行代码)
分数 30 全屏浏览题目切换布局作者 CHEN, Yue 单位浙江大学 Given a non-empty tree with root R, and with weight Wi assig ...
1053 Path of Equal Weight
1. 以下两组关系很大的概念树的深度优先搜索 - 先根遍历 - 递归树的广度优先搜索 - 层序遍历 - 非递归本题考察的是前者,我设置了这样一个结构体 struct Prestruct{int ...

PAT：1053. Path of Equal Weight (30) AC

PAT：1053. Path of Equal Weight (30) AC相关推荐

最新文章

热门文章