Comments
0

aviroop123 thnx for mentioning. yeah, and this is why the entire result can be computed in O(lg m) steps
+1

will be released shortly
+4

This is the editorial for the 5th problem of the contest. Only 2 people managed to solve it during the contest. I tried my best to make the explanation clear. Feel free to ask for clarification if any part isn't clear. Here is the link Venkatesh is bored — editorial
+17

No. It will be unrated.
+2

Reminder. Contest starts at 20:00 hrs IST
+1

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

The contest is conducted under the banner of Techniche, IIT Guwahati and sponsored by CodeChef. We had no jurisdiction over the contest. Also, the registration is only for prizes. You can take part without registering as well. As one of the problem setters, I would be glad if you participate. Hope you enjoy solving the problems.
+1

gabrielwu by when will the editorials of the advanced problems be published?
0

maybe this helps

link to codeforces blog: Debugging in C++
On zeus_iitg → Another problem on graphs, 6 years ago
0

CSES

Link to problem: https://cses.fi/problemset/task/1703/
On zeus_iitg → Another problem on graphs, 6 years ago
0

Thanx for answering. I did the same but getting a WA verdict. Mostly because i still don't understand what has to be printed as the result. Could anybody make the problem statement more clear.

Thanx in advance
0

Can someone explain D: Stick Game in more detail.

Thanx in advance
+1

Can somebody please have a look at it. Any help is highly appreciated.
0

Here is my explanation:-

https://mirror.codeforces.com/blog/entry/71080?#comment-555410
+3

It is correct approach and gives AC.

Link to submission:-

https://mirror.codeforces.com/contest/1245/submission/64014595
0

let's suppose we have i n's in sequence ( nnn....n i times ). Now two cases can be there:-

(1) last character is n

(2) last character is m ( disguised as nn )

hence dp[i] = dp[i-1] + dp[i-2].

The first term for the first case and the second term for the second case.

Hence, fibonacci
+6

Can someone explain why my code is wrong.

Link to submission:- https://mirror.codeforces.com/contest/1245/submission/64040834

Logic Explained:-

For every city, I calculate the minimum cost of providing electricity to it (either by joining with someother city or by installing a power station in it, the former includes adding an edge between the two cities and the latter introduces no new edge.) Then I calculate the cost for every connected component using dfs.

Any help would be highly appreciated.

Thanks in advance