[Topcoder] SRM585 Div 2

Problem Statement

There are some cities and some roads connecting them together. The road network has the topology of a perfect binary tree (see below for a picture), in which the cities are nodes and the roads are edges. You are given the int treeHeight giving the height of the tree. (The height of a perfect binary tree is the number of edges on the path between the root node and any leaf node.) Thus, there are 2^(treeHeight+1)-1 cities and 2^(treeHeight+1)-2 roads in total. The picture below shows how the road network looks like when treeHeight = 2.

We want to send some cars into the road network. Each car will be traveling from its starting city to its destination city without visiting the same city twice. (Note that the route of each car is uniquely determined by its starting and its destination city.) It is possible for the starting city to be equal to the destination city, in that case the car only visits that single city.   Our goal is to send out the cars in such a way that each city will be visited byexactly one car. Compute and return the smallest number of cars we need in order to do so.

0)
	1 Returns: 1 In this case, one car can visit all the cities.
1)
	2 Returns: 3 Here is one way to visit all cities exactly once by three cars:
2)
	3 Returns: 5
3)
	10 Returns: 683
4)
	60 Returns: 768614336404564651

 

发现要把问题拷过来还蛮多格式问题的。

 

题目大意就是需要几条不相交的路径能把一棵完全二叉树的所有节点访问一遍，给定的条件是树高。

很明显 h =0 和 h =1的时候一条路径。

然后规律是 h为偶数的时候 ， ans ( h ) = ans( h-1 ) * 2 +1

                     h为奇数的时候，ans(h) = ans(h-1) * 2 -1

 

见代码：

#include<vector>
using namespace std;

#define ll long long
class TrafficCongestionDivTwo
{
public:
	vector<ll> rec;
	ll solve(int h)
	{
		ll& ans= rec[h];
		if ( ans!=-1 )
			return ans;
		if ( h== 0 || h==1 )
			ans=1;
		else if ( h%2 ==0 )
			ans= solve(h-1)*2+1;
		else
			ans=solve(h-1)*2-1;
		return ans;
	}
	ll theMinCars(int h)
	{
		rec=vector<ll>(h+1,-1);
		return solve(h);
	}
};