浙大pat | 1042 Path of Equal Weight (30) DFS

题目描述

Given a non-empty tree with root R, and with weight W_i

 assigned to each treenode T_i

.  The weight of a path from R to L

 is defined to be the sumof 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 thepaths with

their weights equal to a given number.  For example, let's consider the

tree showed in Figure 1: for each node, the upper number is thenode ID

which is a two-digit number, and the lower number is the weightof that

node.  Suppose that thegiven 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 edgesin

Figure 1.

Figure 1

输入描述:

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 ofnon-leaf nodes, and 0 < S < 2³⁰, the given weight number. The next linecontains N positive numbers where W_i (<1000) corresponds to the tree nodeT_i. 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 thenumber of its children, followed by a sequence of two-digit ID's of itschildren. For the sake of simplicity, let us fix the root ID to be 00.

输出描述:

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

Note: sequence {A₁, A₂, ..., A_n} is said to be greater than sequence {B₁, B₂, ..., B_m} if there exists 1 <= k < min{n, m} such that A_i = B_i for i=1, ... k, and A_k+1 > B_k+1.

输入例子:

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

输出例子:

10 5 2 7

10 4 10

10 3 3 6 2

10 3 3 6 2

这一题就是DFS和递归以及栈的简单应用，并不难

按照dfs和栈的使用技巧去遍历一遍原树就能够得到结果

通过这一题我明白了几点很重要的习惯，

首先vector < vector<int>> result;这种写法是不对的，有些编译器可能会将>>识别为特殊符号，然后不给通过，vector<int>之后应该有一个空格，类似的还有>=这两个之间不能有空格

然后还有就是将i和j写在程序 的开头，可能有一些编译器不应许在for里面重复定义i和j，然后有一些一定要在for里面重复定义i和j，直接把i和j写在程序开头就好了

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int theWeight[103];
int theStack[105];
bool theEdges[103][103] = {false};
int stackIndex=0;
int sum=0;
int N,M,S;
vector < vector<int> > result;
void P(int t)
{
	sum+=theWeight[t];
	if(sum>S) {	sum-=theWeight[t]; return;}
	theStack[stackIndex++] = t;
	
	bool j_find=false;
	for(int i = N-1;i>=0;i--)
	{
		
		if(theEdges[t][i])
		{
			j_find=true;
			P(i);
		}
	}
	if(!j_find)
	{
		if(sum==S)
		{
			vector<int> tmp;
			for(int i=0;i<stackIndex;i++)
				tmp.push_back(theWeight[theStack[i]]);
			result.push_back(tmp);
		}
	}
	sum-=theWeight[t];
	stackIndex--;
}

int main()
{
	int a,b,c;
	cin>>N>>M>>S;
	for(int i=0;i<N;i++)
	{
		cin>>theWeight[i];
	}
	for(i=0;i<M;i++)
	{
		cin>>a>>b;
		for(int j=0;j<b;j++)
		{
			cin>>c;
			theEdges[a][c] = true;
		}
	}
	P(0);
	sort(result.begin(),result.end());
	for(i=(int)result.size()-1;i>=0;i--)
	{
		for(int j=0;j<(int)result[i].size();j++)
		{
			cout<<result[i][j];
			if(j!=(int)result[i].size()-1)
				cout<<" ";
		}
		cout<<endl;
	}

	return 0;
}