Блог пользователя pvtr

Автор pvtr, история, 10 месяцев назад, По-английски

We invite you to participate in CodeChef’s Starters 122 AKA Alkhwarizm, this Wednesday, 21st February, rated for till 6-Stars (i.e. for users with rating < 2500).

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.


Alkhwarizm is a flagship coding event of Aparoksha, the annual tech fest of IIIT Allahabad.

The cash prizes are worth INR 41,000,

  • For Indian Participants (Div. 1)
    • First prize INR 15,000.
    • Second prize INR 10,000.
    • Third prize INR 5,000.
  • For IIIT-Allahabad Participants
    • First prize INR 5,000.
    • Second prize INR 4,000.
    • Third prize INR 2,000.
    • Rank 4 to 10 Aparoksha T-shirt.

Note that only Indian participants who are currently enrolled in schools or universities are eligible for prizes.

To be eligible for prizes, please fill out the following form. Meanwhile, you can view past Alkhwarizm contests — 2011, 2012, 2013, 2016, 2017, 2018, 2019.

Hope to see you participating.

Good Luck!
  • Проголосовать: нравится
  • +90
  • Проголосовать: не нравится

»
10 месяцев назад, # |
  Проголосовать: нравится +16 Проголосовать: не нравится

Excited!

»
10 месяцев назад, # |
  Проголосовать: нравится +38 Проголосовать: не нравится
»
10 месяцев назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Any prizes for Div2??

»
10 месяцев назад, # |
  Проголосовать: нравится +49 Проголосовать: не нравится

As a tester, I assure you no monkey will attack you during the contest.

»
10 месяцев назад, # |
  Проголосовать: нравится +11 Проголосовать: не нравится

Nice problems, any hints for Cursed?

  • »
    »
    10 месяцев назад, # ^ |
    Rev. 2   Проголосовать: нравится +2 Проголосовать: не нравится

    Implementation Hint :- To solve This problem we have to implement two dfs functions, first one will be used to calculate maximum points he can collect assuming all nodes are cursed, And Second one will be used to calculate impact for each node if that node is uncursed.Also don't forget case when after uncursing node it becomes profitable for node to visit i.e. when if all nodes were cursed he was not visiting node a particular but after uncursing it is profitable to visit. For details explanation you can refer Editorial.

»
10 месяцев назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Starters Div1 = Codeforces Div 1.5/Div 2

Starters Div2 = Codeforces Div 2.5/Div 3

Starters Div3/Div4= Codeforces Div 3.5 for almost every contest equivalent to codeforces division.

»
10 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Does anyone have any idea why do we need to use setprecision in https://www.codechef.com/problems/ELFMINDIST?tab=statement when we only need answer upto 1 decimal(x/x.5)

AC code: https://www.codechef.com/viewsolution/1046505555 WA code: https://www.codechef.com/viewsolution/1046504880