TrafficCongestionDivTwo
SRM 585 · 2013-06-25 · by wrong
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
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 by exactly one car. Compute and return the smallest number of cars we need in order to do so.
Notes
- The answer will always fit into a 64-bit signed integer data type.
Constraints
- treeHeight will be between 0 and 60, inclusive.
0 Returns: 1
1 Returns: 1
In this case, one car can visit all the cities.
2 Returns: 3
Here is one way to visit all cities exactly once by three cars:
3 Returns: 5
4 Returns: 11
Submissions are judged against all 61 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Language: C++17 · define a public class TrafficCongestionDivTwo with a public method long long theMinCars(int treeHeight) · 61 test cases · 2 s / 256 MB per case