1053 Path of Equal Weight (30point(s))

最新推荐文章于 2024-07-22 22:15:05 发布

摩天佳迪斯

最新推荐文章于 2024-07-22 22:15:05 发布

阅读量95

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签：算法

本文链接：https://blog.csdn.net/weixin_44970602/article/details/112450811

版权

PAT (Advanced Level) Practice 专栏收录该内容

85 篇文章 1 订阅

订阅专栏

1053 Path of Equal Weight (30point(s))

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 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<2
30
, 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
1
,A
2
,⋯,A
n
} is said to be greater than sequence {B
1
,B
2
,⋯,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
cmp()用于处理两条路径上weight值完全一样的情况

#include<bits/stdc++.h>
using namespace std;
const int maxn = 110;
int N, M, S;
int path[maxn];
struct node {
	int weight;
	vector<int> child;
}Node[maxn];
bool cmp(int a, int b){
	return Node[a].weight>Node[b].weight;
}
void dfs(int index, int depth, int sum){
	if (sum > S)
		return;
	if (sum == S){
		if (!Node[index].child.empty())
			return;
		for (int i = 0; i < depth; ++i){
            if(i!=0) printf(" ");
			printf("%d", Node[path[i]].weight);
		}
        printf("\n");
		return;
	}
	for (int i = 0; i < Node[index].child.size(); ++i){
		int child = Node[index].child[i];
		path[depth] = child;
		dfs(child, depth + 1, sum + Node[child].weight);
	}
}
int main()
{
	scanf("%d%d%d", &N, &M, &S);
	for (int i = 0; i < N; ++i)
		scanf("%d", &Node[i].weight);
	int id, k,child;
	for (int i = 0; i < M; ++i){
		scanf("%d%d", &id, &k);
		for (int j = 0; j < k; ++j){
			scanf("%d", &child);
			Node[id].child.push_back(child);
		}
		sort(Node[id].child.begin(), Node[id].child.end(),cmp);
	}
	path[0] = 0;
	dfs(0, 1, Node[0].weight);
	return 0;
}

BFS没写出来，挺复杂的，感觉差一点
cmp无法区分，目前没有什么简洁的想法，还是老老实实用dfs

#include<bits/stdc++.h>
using namespace std;
const int maxn = 110;
int N, M, S;
struct node {
	int weight,depth,total=0;
    int path[maxn];
	vector<int> child;
}Node[maxn];
int rank[maxn]={0};
void BFS(int index){
    queue<int> q;
    q.push(index);
    Node[index].path[0]=0;
    Node[index].depth=0;
    Node[index].total+=Node[index].weight;
    while(!q.empty()){
        int now=q.front();
        q.pop();
        if(Node[now].total==S&&Node[now].child.empty()){
            for(int i=0;i<=Node[now].depth;++i){
                if(i!=0) printf(" ");
                printf("%d",Node[Node[now].path[i]].weight);
            }
            printf("\n");
        }else if(Node[now].total>S) continue;
        for(int i=0;i<Node[now].child.size();++i){
            int child=Node[now].child[i];
            int depth=Node[now].depth+1;
            Node[child].depth=depth;
            Node[child].total=Node[now].total+Node[child].weight;
            for(int j=0;j<=Node[now].depth;++j) Node[child].path[j]=Node[now].path[j];
            Node[child].path[depth]=child;
            q.push(child);
        }
    }
}
int main(){
	scanf("%d%d%d", &N, &M, &S);
	for (int i = 0; i < N; ++i)
		scanf("%d", &Node[i].weight);
	int id, k,child;
	for (int i = 0; i < M; ++i){
		scanf("%d%d", &id, &k);
		for (int j = 0; j < k; ++j){
			scanf("%d", &child);
			Node[id].child.push_back(child);
		}
	}
	BFS(0);
	return 0;
}