Comments
0

In problem C-tesla, in the first sample, why am I getting WA cause I put car No 5 in (4, 1) as temp place? I will put it in right place after that.
+1

here
+2

Let's say that you have a lot of groups and want to merge them together with the minimum answer. You know the very base case that every node in a separate group, but how we will continue a lot of xor problems solve by trie store binary bits instead of strings.

Trie or prefix tree store one copy of every same prefix of the number, here we will put every number from the most significant bit to least significant bit. start traverse through trie all the numbers will have in common the very first node in the trie every node we will have 2 choices in this node (1 or 0) we need to merge the 2 groups by each other, every group of them will connect internally by each other later by the same way and its very obvious because every time we move in the trie the value that we add to the answer will decrease. We will connect the 2 groups by a search for every number in the first group and try to find the minimum number to it in the second group so now we connect the first group to the second group, but internally nothing happened we will move to the first and second group and do the same algorithm.

Algorithm: when traversing the trie if there is one edge only(1 or 0) you will go through it without adding anything to the answer if there are two edges(1 and 0) you will go through the two edges with adding value to the answer.

Value: as we said before we need to connect the two groups together with the minimum value, for every element in group 1 we will find the minimum element for him in the second group and take the minimum one.

Simplest code: here

Sorry for poor English and poor explanation :'D .
On adamant → General ideas, 9 years ago
-21

What about a blog have segment tree tricks?

0

it's important to correct it to make everyone sure about his answer. And if it can't be changed even by Mike himself, please edit the editorial and make a big warning for the weak test cases. it will be better if you add the test cases in any notepad and upload it.

After I noticed that my old code is wrong, I wrote another one and it's also AC. So, I can't know if it's true AC or false. I know nothing about centroid of tree.

if you are interested about it my submission is here : 26791285
0

MikeMirzayanov Can you help us ?
0

Auto comment: topic has been updated by Gasser (previous revision, new revision, compare).
0

cgy4ever can you fix it ?