1053. Path of Equal Weight (30)

从叶子节点开始找比较方便。另外输出内容排序可以把输出串放在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;
}