1053.Path of Equal Weight (30)...to be continued...

最新推荐文章于 2024-08-15 17:46:09 发布

原创最新推荐文章于 2024-08-15 17:46:09 发布 · 260 阅读

0 ·

CC 4.0 BY-SA版权

pat 专栏收录该内容

163 篇文章

订阅专栏

本文介绍了一个基于PAT算法的问题解决思路，通过深度优先搜索（DFS）实现路径中节点权重相等的所有组合查找。该算法首先读取输入的节点数量、边的数量以及目标权重值，然后构建图结构并进行遍历。

1053.Path of Equal Weight (30)…to be continued…

pat-al-1053

2017-02-27

主要是复习一下dfs

/**
 * pat-al-1053
 * 2017-02-27
 * Cpp version
 * Author: fengLian_s
 */
#include<stdio.h>
#include<vector>
#include<algorithm>
#define MAX 110
using namespace std;
struct NODE
{
  int weight;
  vector<int> child;
}node[MAX];
bool cmp(int a, int b)
{
  return node[a].weight > node[b].weight;
}
int n, m, s;
int path[MAX];
void dfs(int index, int numNode, int sum)
{
  if(sum > s)
    return;
  if(sum == s)
  {
    if(node[index].child.size() != 0)
      return;
    printf("%d", node[path[0]].weight);
    for(int i = 1;i < numNode;i++)
    {
      printf(" %d", node[path[i]].weight);
    }
    putchar('\n');
    return;
  }
  for(int i = 0;i < node[index].child.size();i++)
  {
    int child = node[index].child[i];
    path[numNode] = child;
    dfs(child, numNode+1, sum+node[child].weight);
  }
}
int main()
{
  freopen("in.txt", "r", stdin);
  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;
}

-TBC-