1053. Path of Equal Weight (30)

最新推荐文章于 2022-04-13 00:26:50 发布

jinzi锦梓

最新推荐文章于 2022-04-13 00:26:50 发布

阅读量259

点赞数

分类专栏： PAT_AL

本文链接：https://blog.youkuaiyun.com/huiyuanai222/article/details/46982477

版权

PAT_AL 专栏收录该内容

41 篇文章

订阅专栏

本文介绍了一个基于C++实现的算法，该算法通过遍历树形结构来找出所有权重之和等于给定值S的路径，并将这些路径上的节点权重按特定格式输出。文章详细展示了如何构建节点结构、遍历树形结构以及输出结果的具体步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

从叶子节点开始找比较方便。另外输出内容排序可以把输出串放在string中排序再输出比较方便

#define _CRT_SECURE_NO_WARNINGS

#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<stdio.h>
using namespace std;
bool cmp(string a, string b)
{
return a > b;
}
struct Route
{
vector<int> r;
int wei;
};
struct Node
{
int parent;
vector<Route> route;
bool leaf;
Node()
{
parent = -1;
leaf = true;
}

};
int mm[100000] = {0};
int main()
{
int N, M, S;
cin >> N >> M >> S;
int *weight = new int[N];
for (int i = 0; i < N; i++)
scanf("%d",&weight[i]);
Node *node = new Node[N];
for (int i = 0; i < M; i++)
{
int key, size;
scanf("%d %d", &key, &size);
node[key].leaf = false;
for (int j = 0; j < size; j++)
{
int tmp;
scanf("%d", &tmp);
//node[key].child.push_back(tmp);
node[tmp].parent = key;
}
}
for (int i = 0; i < N; i++)
{
if (node[i].leaf)
{
Route r;
r.r.push_back(i);
r.wei = weight[i];

int par = node[i].parent;
if (par==-1)
node[i].route.push_back(r);
while (par != -1)
{
r.r.push_back(par);
r.wei += weight[par];
if (node[par].parent==-1)
node[par].route.push_back(r);
par = node[par].parent;
}
}
}
vector<string> out;
for (int j = 0; j < node[0].route.size(); j++)
{
if (node[0].route[j].wei == S)
{
string sTmp;
vector<int> vR = node[0].route[j].r;
for (int k = vR.size() - 1; k >= 0; k--)
{
char c_s[4];
sprintf(c_s, "%03d", weight[vR[k]]);
sTmp += c_s;
}
out.push_back(sTmp);
}
}
sort(out.begin(), out .end(),cmp);
for (int i = 0; i < out.size(); i++)
{
string sT = out[i];
printf("%d", atoi(sT.substr(0, 3).c_str()));
for (int j = 3; j < sT.size(); j += 3)
{
int i = atoi(sT.substr(j,3).c_str());
printf(" %d",i);
}
cout << endl;
}
return 0;
}