1053 Path of Equal Weight

1053 Path of Equal Weight

Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to any leaf node L.

Now given any weighted tree, you are supposed to find all the paths with their weights equal to a given number. For example, let’s consider the tree showed in the following figure: for each node, the upper number is the node ID which is a two-digit number, and the lower number is the weight of that node. Suppose that the given number is 24, then there exists 4 different paths which have the same given weight: {10 5 2 7}, {10 4 10}, {10 3 3 6 2} and {10 3 3 6 2}, which correspond to the red edges in the figure.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 0<N≤100, the number of nodes in a tree, M (<N), the number of non-leaf nodes, and 0<S<230, the given weight number. The next line contains N positive numbers where Wi (<1000) corresponds to the tree node Ti. Then M lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 00.

Output Specification:

For each test case, print all the paths with weight S in non-increasing order. Each path occupies a line with printed weights from the root to the leaf in order. All the numbers must be separated by a space with no extra space at the end of the line.

Note: sequence {A1,A2,⋯,An} is said to be greater than sequence {B1,B2,⋯,Bm} if there exists 1≤k<min{n,m} such that Ai=Bi for i=1,⋯,k, and Ak+1>Bk+1.

Sample Input:

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 05
04 2 06 07
03 3 11 12 13
06 1 09
07 2 08 10
16 1 15
13 3 14 16 17
17 2 18 19

Sample Output:

10 5 2 7
10 4 10
10 3 3 6 2
10 3 3 6 2

#include<cstdio>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;

struct node
{
  bool flag;
  int father;
  int weight;
  vector<int> child;
}nodes[110];

int total, non_leaf, target;
int ID, num, id;

vector<vector<int> > ans;
vector<vector<int> > real_ans;
int num_ans = 0;

void DFS(int root,int path)
{
  if (nodes[root].child.size() == 0)
  {
    if (path + nodes[root].weight == target)
    {
      ans.push_back(vector<int>());
      int p = root;
      while (p != -1)
      {
        ans[num_ans].push_back(p);
        p = nodes[p].father;
      }
      num_ans++;
    }
  }
  else
  {
    for (int i = nodes[root].child.size()-1; i >=0; i--)
    {
      DFS(nodes[root].child[i], path + nodes[root].weight);
    }
  }
}

static bool cmp(const vector<int>& A, const vector<int>& B)
{
  //这是个错误函数，但没用
  int min;
  if (A.size() <= B.size())
    min = A.size();
  else
    min = B.size();
  int i = 0;
  for (i; i < min; i++)
  {
    if (A[i] != B[i])
    {
      return A[i] > B[i];
    }
    else
    {
      continue;
    }
  }
  
}


int main()
{

  scanf_s("%d%d%d", &total, &non_leaf, &target);
  
  for (int i = 0; i < total; i++)
  {
    nodes[i].flag = false;
    nodes[i].father = -1;
    scanf_s("%d", &nodes[i].weight);
  }
  for (int i = 0; i < non_leaf; i++)
  {
    scanf_s("%d%d", &ID, &num);
    for (int j = 0; j < num; j++)
    {
      scanf_s("%d", &id);
      nodes[ID].child.push_back(id);
      nodes[id].father = ID;
    }
  }

  DFS(0, 0);

  num_ans = -1;
  for (int i = 0; i < ans.size(); i++)
  {
    real_ans.push_back(vector<int>());
    num_ans++;
    for (int j = ans[i].size()-1; j >= 0; j--)
    {
      real_ans[num_ans].push_back(nodes[ans[i][j]].weight);
    }
  }

  sort(real_ans.rbegin(), real_ans.rend());
  for (int i = 0; i < real_ans.size(); i++)
  {
    for (int j = 0; j < real_ans[i].size(); j++)
    {
      printf("%d", real_ans[i][j]);
      if (j < real_ans[i].size() - 1)
      {
        printf(" ");
      }
      else
      {
        printf("\n");
      }
    }
  }
}