Invitation to ALQUORA 2018

Hello Codechef Community,

Warm greetings from Team Technocracy, National Institute Of Technology, Raipur.

We are glad to invite you all to participate in ALQUORA’18. It is our annual programming competition, conducted on the eve of AAVARTAN, our annual Tech Fest.

It will be a single round IOI style Individual contest, hosted on Codechef. It will be consisting of 6 to 7 challenges, to be solved in 3 hours duration. The problems are expected to be engaging for everyone participating.

Ranking is based on IOI style, with penalty of 10 minutes for every rejected solution (except Compile Errors).

Contest Details:

Contest link: Contest Link

Date and Time: 4th October’18 22:00 hrs to 5th October’18 01:00 hrs (IST)

Languages allowed: C, C++, Java and Python.

Problem Setting Panel: Amarnath Sharma , Nagendra Jha


Registration is Required for receiving below mentioned prizes.
Top 3 Indian performers will get Codechef Laddus, Exciting Goodies and Certificates from NIT Raipur. Top performer from NITRR will also get Exciting Goodies and Certificate.

Programming Partner: Codechef

Registration Link for Prizes: Register Here.

For more details visit Aavartan Events or follow Alquora.


Good Luck to every participant. Hope you all enjoy the problemset!!
See you guys on the leader board.

For any queries:

This is gonna be lit

contest timer is on but the problems are not visible. Please look into it!


+1. Facing same problem

still can’t see problems! oh no! :stuck_out_tongue:

the contest is postponed to 10:15 PM as per the announcement


The same. what a pity.

@jjtomar +1

The contest is postponed to 10:15 PM guys as per the announcement.

My submission is running for a several minutes

It is still running, and have no test result.

is there any goodies to the india ranker’s or only laddus?

not at all organized one! The solutions of the other contestants are visible clearly! :frowning:


Yes, it was visible after 1:00 am for last 15 minutes :frowning:

Wtf!!,honest people :slight_smile:

Congratulations for your performance. You will be getting cash prize and certificates from nit raipur and laddus from codechef.

Can u please declare the goodies and laddus for rankers?

How to solve GDP problem.

@vivek_1998299 Congrats! Btw can you please explain your solution to the last problm?


For last sum ,we consider each node as B type node,obviously now if we wanna find C node for that node v ,we should just take maximum in subtree of v.

Now v is B node,max is C node

So only thing left is A node,if we have a map containing elements of path root to v,then we can find easily the largest value less than v among the parents of v,which is A.

These all can be done in a single dfd(i dont know y i used 2,should’ve done with 1).


1 Like