Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official. ×

shivamg_isc's blog

By shivamg_isc, 10 months ago, In English,

Hello Codeforces!

Aparoksha presents to you an all-new flagship event CodeRed in association with ACM.
If you have the appetite for algorithmic problem solving, then don't miss it out!

It will be a 5-hour long team event with a maximum size of the team being 3 members.
The preliminary round will be held on Codechef, and the onsite round will be held during Aparoksha.

The total prize money is worth INR 50,000. The best 40 teams will make it to the onsite round.
Also, top 2 teams in the online round will get INR 3000 and 2000 respectively, along with Codechef Laddus.
All teams making it to the onsite round will get CodeRed T-shirts.

Contest link is here — CodeRed 2018
The problem set comprises 6 problems of varying difficulty level.

So be ready to have a nail-biting experience on February 17, 2018 at 21:00 IST
Register right now at the link given here to be eligible for prize money.

The problems have been set by me (shivamg_isc) and tested by Shiv Dhingra (lucifer2709).
Facebook Page — CodeRed Facebook Page

Some of our previous contests — Alkhwarizm 2017 and HumbleFool Cup 2016.

Great Prizes and Glory await you in the Coding Arena. CODE ON!

Upd 1:- Contest is about to begin in almost 1 hour. Best of luck :)

Upd 2:- The contest is over, and was a great success with about 900 teams registering for the contest.
Thanks for the overwhelming response. :D

Congratulations to the winners :D

  1. Mutability — uwi
  2. Twin Prime — jtnydv25, HackerTina
  3. Accidently in Warsaw — Mex-Mans, YerzhanU
  4. noticeMeSenpai — satylogin, sarkysaurabh, vaibhav138
  5. karma — wittyskull, garuna, abhi_1595

Top 2 teams will get cash prizes of INR 3000 and INR 2000 respectively, along with Codechef Laddus. :)
Feedback of the contest in the comments will be highly appreciated :D

The detailed editorials will be published on Monday.
For now, I am posting the hints.

KRYP1
KRYP2
KRYP3
KRYP4
KRYP5
KRYP6

Upd 3:- Editorials are finally posted. :) Click Here

 
 
 
 
  • Vote: I like it  
  • +116
  • Vote: I do not like it  

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

shivamg_isc for KRYP1 i was doing the same thing Dp But it consistently give wrong answer. Can u please tell where i am going wrong? https://www.codechef.com/viewsolution/17463680

  • »
    »
    10 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Hi tarun_.
    In 2nd dfs, you took the max value from the siblings only. What if the maximum value could have been obtained from above the parent side I.e from the ancestors or from any ancestors' siblings. In case you still have any doubt regarding this, I will post an example :)

»
10 months ago, # |
  Vote: I like it +6 Vote: I do not like it

i know topics like dp,graphs and solved some example, in this contest i was able to solve 2 problems only. i read the hints you wrote here, but i am almost new to every topic you wrote.Hope full editorial will help . Thanks for good contest

  • »
    »
    10 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Thanks a lot for your feedback learner_321.
    Don't worry. The full editorial will be posted tomorrow.
    I will notify once it will be posted :D

  • »
    »
    10 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Editorials are posted. Check out the blog for the link.

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi. I am continuously getting TLE for Mo's on Tree. Can you help someway? Click

  • »
    »
    10 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    I would suggest you to use Segment Tree. The solutions using Seg Tree are consuming way lesser time than those of multiset/map. It seems that overhead in multiset/map is very high, and hence there is so much difference in time of the accepted solutions. Maybe there is a good deal of optimization required wih multiset/map. Refer to my solution. It takes 3.9 sec with multiset.