# Strategic game (POJ 1463 tree DP)

Source: Internet
Author: User
Tags integer numbers

Strategic game
 Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 7490 Accepted: 3483

Description

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and T Hen he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers in the nodes so, they can observe all the edges. Can you help him?

Your program should find the minimum number of soldiers that Bob have to put for a given tree.

For example for the tree:

The solution is a soldier (at the Node 1).

Input

The input contains several data sets in text format. Each data set represents a tree with the following description:

• The number of nodes
• The description of each node in the following format
Or
Node_identifier: (0)

The node identifiers is integer numbers between 0 and n-1, for n nodes (0 < n <=); Line of input would no more than 10. Every edge appears only once in the input data.

Output

The output should is printed on the standard output. For each given input data set, print one, integer number in a, gives the result (the minimum number of sold Iers). An example are given in the following:

Sample Input

`40: (1) 11: (2) 2 32: (0) 3: (0) 53: (3) 1 4 21: (1) 02: (0) 0: (0) 4: (0)`

Sample Output

`12`

Source

Southeastern Europe 2000a simple tree DP, state transition equation: Basically the same as the last question .　　DP[NODE][0]+=DP[TREE[NODE][I]][1];

Dp[node][1]+=min (dp[tree[node][i]][0],dp[tree[node][i]][1]); Then +1

First written dp[node][1]+=dp[tree[node][i]][0];

`1#include <iostream>2#include <cstdio>3#include <algorithm>4#include <cstring>5 using namespacestd;6 #defineMax 15067 intdp[max][2],fa[max],tree[max][ A];8 intN;9 intNum[max];Ten voidTREE_DP (intnode) One { A     inti; -      for(i=0; i<num[node];i++) -     { the TREE_DP (Tree[node][i]); -dp[node][0]+=dp[tree[node][i]][1]; -dp[node][1]+=min (dp[tree[node][i]][0],dp[tree[node][i]][1]); -     } +dp[node][1]++; -     return; + } A intMain () at { -     inti,j; -     intb; -     intk,root,f; -Freopen ("In.txt","R", stdin); -      while(SCANF ("%d", &n)! =EOF) in     { -Memset (DP,0,sizeof(DP)); tomemset (Tree,0,sizeof(tree)); +          for(i=0; i<max;i++) -fa[i]=-1; the          for(i=0; i<n;i++) *         { \$scanf"%d%*c%*c%d%*c",&f,&k);Panax Notoginsengnum[f]=K; -              for(j=0; j<k;j++) the             { +scanf"%d",&tree[f][j]); Afa[tree[f][j]]=F; the             } +         } -root=0; \$          while(fa[root]!=-1) \$root=Fa[root]; - TREE_DP (root); -printf"%d\n", Min (dp[root][0],dp[root][1])); the     } -     return 0;Wuyi}`

Strategic game (POJ 1463 tree DP)

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.