PAT甲级练习1053. Path of Equal Weight (30)

1053. Path of Equal Weight (30)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Given a non-empty tree with root R, and with weight W_i assigned to each tree node T_i. 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 Figure 1: 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 Figure 1.

Figure 1

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 < 2³⁰, the given weight number. The next line contains N positive numbers where W_i (<1000) corresponds to the tree node T_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 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 {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.

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

用dfs即可，用一个notend数组保存是否是根节点，判断权重的和，然后根据权值对符合要求的路径排序

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <string.h>

using namespace std;

const int MAX=1e5+10;
int r[101][101], w[101];
bool visited[101], notend[101];
int n, m, s, cnt=0, a, b, c;
vector<vector<int>> p;

bool cmp(vector<int> x, vector<int> y){
	int xl=x.size(), yl=y.size();
	int length = min(xl, yl);
	for(int i=0; i<length; i++){
		if(w[x[i]]!=w[y[i]]) return w[x[i]] > w[y[i]];
	}
	return x[length-1] < y[length-1];
}

void dfs(int start, int wsum, vector<int> path){
	if(wsum==s && notend[start]==false) p.push_back(path);
	else if(wsum>s) return;

	visited[start] = true;

	for(int i=1; i<n; i++){
		if(visited[i]==false && r[start][i]!=0){
			vector<int> pp(path);
			pp.push_back(i);
			dfs(i, wsum+w[i], pp);
		}
	}
	return;

}

int main(){

	scanf("%d%d%d", &n, &m, &s);

	for(int i=0; i<n; i++){
		scanf("%d", &a);
		w[i] = a;
	}
	for(int i=0; i<m; i++){
		scanf("%d%d", &a, &b);
		notend[a] = true; 
		for(int j=0; j<b; j++){
			scanf("%d", &c);
			r[a][c] = 1;
		}	
	}

	vector<int> path;
	path.push_back(0);
	dfs(0, w[0], path);
	sort(p.begin(), p.end(), cmp);

	for(int i=0; i<p.size(); i++){
		printf("%d", w[p[i][0]]);
		for(int j=1; j<p[i].size(); j++){
			printf(" %d", w[p[i][j]]);
		}
		printf("\n");
	}

	cin>>n;
	return 0;
}