### A. Die Roll

If the maximum of Yakko's and Wakko's points is a, then Dot will win, if she has not less than a points. So the probability of her win is (6 - (a-1)) / 6. Since there are only 6 values for a, you can simply hardcode the answers.### B. Running Student

It is simple to calculate the time*t*

_{i}that the Student will need, if he gets off the bus at the i-th stop:

*t*

_{i}=

*b*

_{i}+

*s*

_{i}, where

*b*

_{i}=

*x*

_{i}/

*v*

_{b}is the time he will drive on the bus, and is the time he will need to get from the i-th stop to the University. We need to choose indices with minimal possible

*t*

_{i}, and among them - the index with minimal possible

*s*

_{i}, that is, with maximal

*b*

_{i}, that is (since the coordinates of bus stops are already ordered) with maximal i.

Note that due to precision issues, you should be careful when you compare

*t*

_{i}: the condition

*t*

_{i}=

*t*

_{j}should be written in the form |

*t*

_{i}-

*t*

_{j}| < ε for some small ε.

### C. Hexadecimal's Numbers

Brute force solution, when you try each number from 1 to n, will not fit into the time limit.Note, however, that all good numbers have at most 10 digits, and each of the digits is 0 or 1. That is, there are at most 2

^{10}binary strings to check. Each of these strings is a number from 1 to 2

^{10}- 1 in binary representation. So the algorithm is the following: for each number from 1 to 2

^{10}- 1 write its binary representation, read it as if it was decimal representation and compare the result to n.

### D. How many trees?

Denote by*t*

_{nh}the number of binary search trees on n nodes with height equal to h. We will derive a recurrent formula for

*t*

_{nh}. For the base case note that

*t*

_{00}= 1 (empty tree), and

*t*

_{i0}=

*t*

_{0i}= 0 if i>0.

Now take any binary search tree on n nodes with height equal to h. Let m be the number written at its root, 1 ≤

*m*≤

*n*. The left subtree is a binary search tree on m-1 nodes, and the right subtree is a binary search tree on n-m nodes. The maximal of their heights must be equal to h-1. Consider 2 subcases:

1. The height of the left subtree is equal to h-1. There are

*t*

_{m - 1, h - 1}such trees. The right subtree can have any height from 0 to h-1, so there are such trees. Since we can choose left and right subtrees independently, we have variants in this case.

2. The height of the left subtree is less than h-1. There are such trees, and the right subtree must have height exactly h-1, which gives us totally variants.

So the recurrent formula is the following: .

All the values

*t*

_{nh}can be calculated by dynamic programming. The answer, then, is .

### E. Interesting graph and Apples

The funny ring consists of n vertices and n edges. If there is another edge except for these n, then the vertices it connects belong to more than one cycle. So, an interesting graph is just a funny ring.A graph is a funny ring if and only if the following conditions hold:

A1. The degree of each vertex equals 2.

A2. The graph is connected.

Now let's figure out when a graph is not yet a funny ring, but can be transformed into a funny ring by adding edges. There are obvious necessary conditions:

B1. m < n.

B2. There are no cycles.

B3. The degree of each vertex is not more than 2.

Let's add edges so that these conditions were preserved, and the sequence of edges was lexicographically minimal. So, we add an edge (i,j) such that:

1. The degrees of i and j are less than 2. (Otherwise we would break B3).

2. i and j belong to different connected components. (Otherwise we would break B2).

3. The pair (i,j) is lexicographically minimal.

Let's see what we have when we can't add edges anymore. Since there are no cycles, each connected component is a tree, and therefore has at least one vertex with degree less than 2. If there are two connected components, then they could be connected by an edge without breaking B1-B3. So the graph is connected, has no cycles, and the degree of each vertex is not more than 2. This means that the obtained graph is just a walk and we can connect its end points to obtain a funny ring.

To summarize, the algorithm is the following:

1. Check if A1-A2 hold. If yes, output "YES" and 0.

2. Check if B1-B3 hold. If no, output "NO".

3. Output "YES" and n-m.

4. Add edges as described. When the edge (i,j) is added, output "i j".

5. Find the only vertices i and j with degree less than 2 (they can be equal if n=1). Output "i j".

you maked good tutorial

author's solution of problem E is looks like the same with yours ;)

The first version of my solution was quite a mess, but when I started to write the explanation, I understood that it can be rewritten much clearer. The benefit of writing tutorials :)

Directly was meant in reference to calculating answers using dynamic programming to the type of question that is asked (number of trees with height not lower than a certain amount). Here is the main loop (the full solution is viewable in the "practice room").

for (int j = 0; j <= n - 1; ++j)

mem[n][h] += count(j, std::max(h - 1, 0)) * count(n - 1 - j, 0)

+ count(j, 0) * count(n - 1 - j, std::max(h - 1, 0))

- count(j, std::max(h - 1, 0)) * count(n - 1 - j, std::max(h - 1, 0));

Or for each partition of the vertices to the left and right subtrees, the number of trees with height not lower than h is equal to the number of trees with the height of the left subtree not lower than (h - 1) plus the number of trees with the height of the right subtree not lower than (h - 1) less the number of trees with both subtrees of height not lower than (h - 1). The latter term is subtracted, because we have double-counted the solutions with both subtrees of height not lower than h - 1.

It's similar to what everyone else has.

nnon-negativeintegersin ascending order"Yes, your first problem was with rounding. If you cast (double)x[i]/v1 all should be Ok.

Test #23 checks the condition "If such bus stops (with minimal time arrival) are multiple, choose the bus stop closest to the University".

3 3 1

0 1 4

4 4

Stops 2 and 3 have the same time, but the 3rd stop is closer to the university.

Hope this helps you,

Good luck!

Good Job~

example:

N = 101003021

X = 101001111

so, answer = 335

_{10}(N) = L_{2}N_{2}(N) = log_{10}(N) * log_{2}(10). The difference is just a constant log_{2}(10), thus it doesn't matter in complexity.thanks. I got wa and after viewing ur cmnt, I understood that point why I got wa. Now ac :)

One can use Ternary search (with some little modifications) to solve Problem B.

Problem E if input data ocuur a situation like this: n = 8 m = 9 1 2 2 3 3 1 3 4 4 5 5 6 6 4 is it yes?

NO .

in problem D

tutorial.neither of the 2 cases takes a height where height of left subtree or right subtree is greater than h-1.

why isn't this possible that there may be cases where either the LS or RS has height greater than h?

Can anyone please tell...

in tutorial , its given that maximum of their heights must be equal to h-1 but in question , it is nowhere mentioned that height can't be greater than h-1. aisa kyun >?

You are deriving recursive formula for a tree with n nodes and max height h in the current step. This n and h vary from (0..N) and (0..N) while calculating the dp table. When you have considered the tree with max height h then its left subtree can have max height h — 1 only.

Later you add up values in the dp table for trees of heights of (H..N).

yes .. i understood the rest part but where in the question it was mentioned that

height can't be greater than h.. it is written in the question that height can't be

lower than h but tutorial solve the question by taking max height upto h not more

than that .. here is the difference i was mentioning ..

otherwise the question is just similar of finding optimal binary search tree

Here we are solving for a general n and h. Not the ones mentioned in the question. We are summing up over all the possible subtrees which will have height less than h again because we are considering the tree with max height h.

"because we are considering the tree with max height h." yes i know that ...