I hope you guys enjoyed the contest and we hope to host another one soon :)

With that said, here are the tutorials:

Tutorial is loading...

Author: Ashishgup

C++ Code: 46095081

Java Code: 46095332

Tutorial is loading...

Author: Jeel_Vaishnav

C++ Code: 46095083

Java Code: 46095337

Tutorial is loading...

Authors: Jeel_Vaishnav, Ashishgup

C++ Code: 46095097

Java Code: 46095342

Tutorial is loading...

Authors: Jeel_Vaishnav, Ashishgup

C++ Code: 46095154

Java Code: 46095344

Tutorial is loading...

Author: Jeel_Vaishnav

Java Code: 46095349

A nice explanation of Problem E by Kognition in the comment section: https://codeforces.com/blog/entry/63352?#comment-473028

Tutorial is loading...

Author: Ashishgup

Editorials came in so early :)

Thank you Jeel_Vaishnav and Ashishgup.

Good contest,expect for the order of E and F.

Moreover,why I can't see it in contest materials.It seems that the editorials haven't attached to the contest.

Did anyone solve problem E with LP solvers? If yes, what's the solver needed? I am using simplex and it gives TLE :/

I love how there are Java and C++ code!

Is there any proof for the author's solution of D?

I am also looking for some proof for this problem.

I have added the proof for Problem D. Hope it helps:)

Thanks :)

In F, final part may be a little bit easier. The root node is the node separated from any of two leafs by exactly

h- 1 nodes (among the found 2h- 1 nodes). StillO(H^{2}) though.In the final part of F, you can use std::sort like this:

This decreases the complexity of fixing the order to . Moreover selection algorithm will make it

O(H).Auto comment: topic has been updated by Jeel_Vaishnav (previous revision, new revision, compare).What the F ;)

My solution of F -

Take any 2 random nodes, say

uandv. The probability thatrootlies in the path ofuandvis1/2.Perform

query(u, i, v), query(u, v, i)andquery(i, u, v)for alli.if

query(u, i, v) = Yes, thenilies in the path ofuandvif

query(u, v, i) = Yes, thenilies in the subtree of vif

query(i, u, v) = Yes, thenilies in the subtree ofuWe can find subtree sizes of

uandv, and thus we'll get the level ofuandv. We already know the level of theroot. So, by checking the number of nodes in the path ofuandv, we'll get to know whetherrootlies in the path or not.If

rootlies in the path, then we can find the order of the nodes which are in the path (as mentioned in the editorial), and thus find the root.Ashishgup can you plz provide explanation of your code for problem multiplicity.

Problem — Views Matter What will be the output for Input ?

shouldn't the output should be " 2 " instead of " 1 " Since " 3 " blocks can manage top and right view.

Illustration

Top View — 3

Right View — 3 After Changes

Top View — 3

Right View — 3 Help me, is this correct or did I misunderstood something. Task number — 5

Ashishgup, Thanks for clearing my doubt

The answer "1" is correct because the position of any block in a stack cannot change. As per your illustration, the * in the 2nd stack should be in the 3rd row only as there's only 1 * in that stack.

Excuse me, could someone please show me what I have done wrong with the WA solutions ?

Correct sol : https://codeforces.com/contest/1061/submission/46112942

WA sol : https://codeforces.com/contest/1061/submission/46097011

Summarization: In both sol, what I am trying to do is too keep the all the ends of renting time of TVs, and for the current shows, I will decide to attach it to a TV or assign it to a new one, optimally. The only difference in two solutions is the sorting of the [li, ri]. In the WA, the array was sorted in accordance to ri, while in the correct one it was sorted according to li

wa in testcase 43 of problem D

https://codeforces.com/contest/1061/submission/46100789

What is wrong with the solution?

哇，

My submission also failed on test 43. For a case where it fails, read the editorial of the problem and then consider the intervals [li, ri], [lo1, ro1], [lo2, ro2] given in that. Try to draw them on paper and see how your algorithm proceeds. It assigns the same TV to [li, ri] as that of [lo1, ro1] whereas the optimal solution is to assign it the same TV as that of [lo2, ro2].

dp[i][j]={ dp[i−1][j]+dp[i−1][j−1] if a[i] is a multiple of j dp[i−1][j] otherwise } Can anyone explain me this equation.

The number of good sequences of length

jin the arraya_{1},a_{2}, ...a_{i}is the sum of the number of good sequences of lenghtjin the arraya_{1},a_{2}, ...a_{i - 1}(the number of sequences wherea_{i}is not thej-th element) plus the number of good sequences of lengthj- 1 in the arraya_{1},a_{2}, ...a_{i - 1}(the number of sequences wherea_{i}is thej-th element).How does one convert this to a 1D array? The 2D approach can't be directly reduced to use 1D arrays right?

Let's maintain a 1D dp of size

n. We iterate over the array and keep updating the dp. At any moment,dp[i] will be the number of ways to form subsequences of sizeifrom the elements we iterated till now. Let the current number in the array bex. Now, we can see that the transitiondp[i][j] =dp[i- 1][j] is not required here as it will be stored anyway in thedp. Only transition needed here isdp[i][j] =dp[i- 1][j] +dp[i- 1][j- 1], which is when j is a multiple ofx. Also in 1D dp, the transition will becomedp[j] =dp[j] +dp[j- 1]. Hence, what we can do is that we iterate over the divisors ofxand update thedpaccordingly.Note that we need to iterate the divisors in decreasing order or you may end up calculating more ways. For example, if you are iterating divisors in increasing order and

xis 6, then first you will updatedp[2] =dp[2] +dp[1] and then you will updatedp[3] =dp[3] +dp[2]. As you can see here, you calculated more number of ways fordp[3], as you updateddp[2] beforedp[3].what is the inital value of dp ( i mean before recurring loop )

I have another approach for F.

First case:k< 18Starting from a random node (let's call it

X), I basically find all of itskchildren and parent (if it's not the root). To do this, just find another random node which hasn't been marked yet (marking process is written below) and ask for the next node which lies on the path from our current node to it.After finding one of its neighbor (lets call it

Y), I mark all the nodesZthatask(X,Y,Z) = "Yes", cause they are negligible.You can easily notice that the parent of the current node is the vertice with the biggest number of vertice

Zthat satisfied the condition above.If a vertice have exactly

kneighbors, it's the root of the tree.So there will be at most

log(n) *n* 2 *kquestions need to be asked in this caseSecond case:k> 17One thing to notice is that in this case, the depth of the tree is at most 3.

Now the idea is from a random node, find the longest simple path starting from this node and you will know exactly which node is the root on this path.

For instance, let

n= 421 andk= 20 and you've found the longest path starting from nodeXwhich its length is 3 then you can be sure that the second node lying on this path is the root of the tree (sorry for poor explanation).Now, to find the longest path starting from a node

X, my solution is to get 50 other random vertices and find ask for the length fromXto these nodes. One can easily see that the probability of getting one of the longest paths in this way is >= 0.5 for each random node we ask.After getting nodes from one of the longest paths, you can easily sort this path in the correct order and find the answer.

Is there any way to test problem F on my machine?

I thought that the checker for F could be adversarial. Like if your algorithm is to randomly pick nodes until you get leafs where the root is their Lowest Common Ancestor, then the adversarial checker would give you neighboring nodes instead. It could defer assigning final positions to the nodes unless query answers lead to contradictions.

I think I have a algorithm that does something like ≈ 50

Nqueries when the checker is as adversarial as possible and the tree height is 10 (which is the max for the problem).I start with picking two random nodes

a,band making queries (a,x,b) until I find a node in between. That'sN- 2 steps. Then I find the depth ofxand all nodes reachable through it's parent by fixinga,xand making queries (a,x,y) and then fixingb,xand making all queries (b,x,y). After 2N- 4 queries you know which ones ofa,bare abovex, the depth ofx, and all nodes reachable throughx:s parent. Ifxis the root, we will detect it, because we know it's depth.Then the idea is to find a node

zon the path fromxto the root, and continue going up fromz. We pick any nodetin the subtree reachable fromxthrough it's parent. Then we check what nodes are on the path betweenxandtin ≤N- 2 steps. We also check the depth oftin ≤ 2N- 4 steps. Then we sort the path fromxtotto find the highest node on it. Sorting can be quadratic, but that's fine, because the path is ≤ 19 elements long, and the longer it is, the higher up in the tree we will get.Very nice idea of yours. In your explanation, the sentence "I start with picking two random nodes a, b" is misleading because it makes think that your algorithm is random. You could just say "I start by picking any two nodes a,b, e.g. a=1, b=2".

Are the complexities for E correct? Min-Cost-Max-Flow should take

O(nm) iterations (like Edmonds-Karp), and in each iteration Bellman-Ford takesO(nm), which givesO(n^{2m}^{2}). In our case, sincem=O(n) we would getO(n^{4}).It is correct. You can keep a potential value to be able to use dijkstra instead of bellman-ford to make it O(mlogm) per augmenting path. More details here: https://www.topcoder.com/community/competitive-programming/tutorials/minimum-cost-flow-part-two-algorithms/

Just to be more clear, this algorithm runs bellman-form 1 time to get initial potentials and maintains it so that the edges have modified weights >= 0 but they still get the correct min path.

Quick edit: there will be O(N) augmenting paths so the complexity is O(#augmenting paths * cost of finding an augmenting path)

Complexity of Min-Cost Max-Flow using Bellman Ford is

O(flow·V·E). Here, maximum flow will benand evenVandEwill benand so overall complexity will beO(n^{3}).Oh, the Ford-Fulkerson argument (each augmenting path increases flow by at least 1). I see.

I would appreciate if someone could help me understand why this submission 46126706 fails and this one gets AC 46126678. The only difference between them is in function f :(.

SpoilerWA:

AC:

"if( f(*it, l) > x)". Probably this line, because you cannot compare after taking modulo.

Sometimes because of module function f will appear smaller than x so when you use this function for comparisons you need to stick without it.

In problems like D, I always sort them by their ending time and all of them passed. Now It fails in test 43. Learned a new thing. Thanks.

Can you prove why it failed? I have encountered the same problem

Another similar approach for problem

F: Get two random vertex (u,v). The probability that these are two leaf from distincts subtrees of the root is 1 / 8, so the probability of fail is 7 / 8 and after 40 random pick of (u,v) the probability of fail is around0.004. For each pick ask for all the nodes that are in the path fromutov, if these number is exactly 2 * (depth- 1) - 1 then these are two leaf from distincts subtrees and the root is there. Only left check what of these nodes are the root, this can be done withnquery, because for a fixed vertex and all the others the root is the only node that are in exactly inn- 1 - (n- 1) /kpaths. 46130299Pretty and short

sweepline+greedyapproach for problemD: 46130297I am wondering whether problem C can get accepted submission using python ..

EDIT: I can get accepted using PyPy. Does anyone know whether there is some explanation regarding python submission for contest?

I don't understand the problem statement for problem B at all :(. Visual cues are not clear. The drawing doesn't explain the parameters for the problem.

The first drawing doesn't have an example which could explain the problem statement.Unless I start making assumptions which ideally I should not. I am not sure if the author is trying not to state the obvious (from his point of view), but it really helps if he does for this particular problem where you do need some visual cues.

Here is my submission for C: 46183737. I get TLE, probably because my loops to calculate the divisors for every number is too slow. Is there something simple I can fix, or is my method just too slow?

Also, the author has a much more complicated way of calculating divisors. Is his way fast enough to use for pretty much every problem where it is beneficial to precalculate the divisors of numbers?

Can anyone explain me why dp[j] is updated if and only if j is a divisor of a[i] ? Thank you so much

As per the editorial of F, all the 60n queries are exhausted in Part 2 and 3 only. How do we afford the additional queries for the Finally part? Please let me know what am I missing here.

updit was mistake in my idea

sorry for the trouble

Can someone tell that in problem C, we want the decreasing order of divisors.I used set for this but I got TLE on testcase number 19, but when I used vector:sort, it got accepted.But both have same time complexity on an average ,or it is so that vector is more efficient than set?

in B example 5: 3 3 3 1 1 i think we can remove 2 block from height 3,please help

In Problem C how can we find all the divisors of a number . Isn't it hard to construct all divisors by having only prime divisors ?

in order to find a leaf, we can act like this:

then we can get a leaf in O(n),use n querys only.