-
Notifications
You must be signed in to change notification settings - Fork 0
/
1053.cpp
82 lines (78 loc) · 1.35 KB
/
1053.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// 1053.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
using namespace std;
vector<list<int> >tree(100);
vector<int >weight(100);
vector<bool >Check(100);
int N, M,S;
int index,K;
int temp = 0;
vector<vector<int >>s_weight;
vector<int>tempweight;
bool cmp(vector<int>v1, vector<int>v2)
{
return v1>v2;
}
void dfs(int index, int &total)
{
if (Check[index] == false)
{
Check[index] = true;
tempweight.push_back(weight[index]);
total += weight[index];
if (tree[index].empty() == false)
{
for (list<int>::iterator it = tree[index].begin(); it != tree[index].end(); it++)
{
if (Check[*it] == false)
{
dfs(*it, total);
}
}
}
else
{
if (total == S)
s_weight.push_back(tempweight);
}
tempweight.pop_back();
total -= weight[index];
}
}
int main()
{
cin >> N >> M >> S;
for (int i = 0; i < N; i++)
{
cin >> weight[i];
}
for (int i = 0; i < M; i++)
{
cin >> index >> K;
for (int j = 0; j < K; j++)
{
cin >> temp;
tree[index].push_back(temp);
}
}
int total = 0;
dfs(0,total);
sort(s_weight.begin(), s_weight.end(), cmp);
for (int i = 0; i < s_weight.size(); i++)
{
for (int j = 0; j < s_weight[i].size(); j++)
{
if (j)
cout << " ";
cout << s_weight[i][j];
}
cout << endl;
}
cin >> N;
return 0;
}