PAT 1053

最新推荐文章于 2022-04-13 00:26:50 发布

是忧伤还是快乐

最新推荐文章于 2022-04-13 00:26:50 发布

阅读量163

点赞数

本文链接：https://blog.csdn.net/weixin_44417360/article/details/106225782

版权

很奇怪给权值排序 weight开的够大最后一个测试点就能通过
而给vector<vector>排序就通不过最后一个测试点

#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
struct node{
	int data;
	vector<int>child;
	int father;
}Node[110];
vector<int>weight[100];
int n,m,s;
int sum  = 0;
int temp;
int cou = 0;
bool cmp(int a,int b)
{
	return Node[a].data>Node[b].data;
}
void DFS(int v,int sum){
	if(Node[v].child.size()==0){
		if(sum==s){
			int i=0;
			while(v!=-1){
				weight[cou].push_back(Node[v].data);
				v = Node[v].father;
			}
			cou++;
		}
		return;
	}
	for(int i=0;i<Node[v].child.size();i++){
		temp = Node[v].child[i];
		DFS(temp,sum+Node[temp].data);
	}
}
int main()
{
	int x;
	scanf("%d%d%d",&n,&m,&s);
	for(int i=0;i<n;i++){
		scanf("%d",&x);
		Node[i].data = x;
	}
	int k,num;
	int a;
	Node[0].father = -1;
	for(int i=0;i<m;i++){
		scanf("%d%d",&a,&k);
		for(int j =0;j<k;j++){
			scanf("%d",&num);
			Node[a].child.push_back(num); 
			Node[num].father = a;
		}
		sort(Node[a].child.begin(),Node[a].child.end(),cmp);
	}
	DFS(0,Node[0].data);
	for(int i=0;i<cou;i++){
		reverse(weight[i].begin(),weight[i].end());
	}
	for(int i=0;i<cou;i++){
		for(int j=0;j<weight[i].size();j++){
			if(j==weight[i].size()-1) printf("%d",weight[i][j]);
			else printf("%d ",weight[i][j]);
		}
		if(i!=cou-1) printf("\n");
	}
	return 0;
}

#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
struct node{
	int data;
	vector<int>child;
	int father;
}Node[110];
vector<int>weight[100];
vector< vector<int> >result;
int n,m,s;
int sum  = 0;
int temp;
int cou = 0;
bool cmp(vector<int> a,vector<int> b)
{
 int i=0;
 for(i=0;i<a.size()&&i<b.size();i++)
 {
  if(a[i]!=b[i])
  return a[i]>b[i];
 }
}
void DFS(int v,int sum){
	if(Node[v].child.size()==0){
		if(sum==s){
			int i=0;
			while(v!=-1){
				weight[cou].push_back(Node[v].data);
				v = Node[v].father;
			}
			cou++;
		}
		return;
	}
	for(int i=0;i<Node[v].child.size();i++){
		temp = Node[v].child[i];
		DFS(temp,sum+Node[temp].data);
	}
}
int main()
{
	int x;
	scanf("%d%d%d",&n,&m,&s);
	for(int i=0;i<n;i++){
		scanf("%d",&x);
		Node[i].data = x;
	}
	int k,num;
	int a;
	Node[0].father = -1;
	for(int i=0;i<m;i++){
		scanf("%d%d",&a,&k);
		for(int j =0;j<k;j++){
			scanf("%d",&num);
			Node[a].child.push_back(num); 
			Node[num].father = a;
		}
	}
	DFS(0,Node[0].data);
	for(int i=0;i<cou;i++){
		reverse(weight[i].begin(),weight[i].end());
		result.push_back(weight[i]);
	}
	sort(result.begin(),result.end(),cmp);
	for(int i=0;i<result.size();i++){
		for(int j=0;j<result[i].size();j++){
			if(j==result[i].size()-1) printf("%d",result[i][j]);
			else printf("%d ",result[i][j]);
		}
		if(i!=result.size()) printf("\n");
	}
	return 0;
}