Invitation to Cook-A-Code 2.0

general
, , ,
#1

Hello CodeChef Community,

We would like to invite you all to the Competitive Coding Contest Cook-A-Code 2.0 of Cerebro, the annual technical fest of IIIT Vadodara.

In teams of 1-3, participants will have 4 hours to solve 8-9 problems. The rankings and scoring will be in ICPC style. You need to have a team of 3 members exactly to be eligible for the prizes

Schedule:
Start time: 2nd April 2021, 20:00
End time: 3rd April 2021, 00:00

Link to contest page: Contest Page | CodeChef

Prizes:

Overall Winning Team:- Rs. 4800 and 250 laddus
Runner Up Team:- Rs. 3600 and 250 laddus
Second - Runner Up Team:- 250 laddus
Winning Team in IIITV Overall:- Rs. 1500 and 300 laddus
Winning Team in the First Year, IIITV (Gandhinagar Campus):- Rs. 900
Winning Team in the First Year, IIITV (Diu Campus):- Rs. 500

Steps to register for prizes:

Go to Cerebro 2021 https://cerebro.iiitvadodara.ac.in and make a team.
Afterwards, fill this form.

The registration form for the contest to be eligible for prizes: https://forms.gle/ik24sMLzZfnSqBGb8

We strongly suggest you to read all the problem statements .

5 Likes
#2

Reminder: The contest starts within 2 minutes :grin:

1 Like
#3

The editorials for the problems will be posted shortly.

1 Like
#4

waiting for the editorial thanks :smiley:

2 Likes
#5

RECIPEE Editorial - RECIPEE - Editorial

3 Likes
#6

GYMTYM Editorial Link:- Editorial - Gym Freaks

3 Likes
#7

DIVUS Editorial - DIVUS - Editorial

3 Likes
#8

NUMGME Editorial - NUMGME - Editorial

3 Likes
#9

Can someone please share the idea how to use Fenwick Tree in True Game
https://www.codechef.com/CAC22021/problems/CAC2

1 Like
#10

Basically what you can do is maintain pairs (height[i],i) and sort them by heights, and now maintain a BIT Tree over N elements of the array, where ith index of the BIT Tree denotes the ith index of the original array.
Now for every index 1<=i<=N, in pairs(described above), update the BIT array at index pair[i].second with value pair[i].first and dp[i] = Prefix sum of the elements of the BIT Tree from 1 to pair[i].second.

The answer will be the max(dp[i]) , 1<=i<=N.

2 Likes
#11

Got it thanks a lot :smiley:

#12

VIQUE Editorial - VIQUE - Editorial

3 Likes
#13

The problems have been moved to the practice section.

2 Likes
#15

CAC3 - Editorial - CAC3 - Editorial

3 Likes
#16

FELUDA Editorial- FELUDA-Editorial

2 Likes
#17

Cook - bit- editorial: Editorial - cook - a- bit

Apologies for late Editorial.

1 Like
#18

True Game Editorial - Editorial - True Game