You are not logged in. Please login at www.codechef.com to post your questions!

×

Invitation to CodeRed- 2018 by IIIT Allahabad

6
2

alt text

Upd: Editorials are posted. Check here

Upd: Thanks for the overwhelming response, with 900+ teams getting registered for the contest :D
The detailed editorials will be posted on Monday.
Till then, kindly refer this Codeforces blog post to check out the hints. :)
Also please give the feedback pertaining to contest in the comments :D


Aparoksha, 2018 presents to you an all-new flagship event CODERED in association with ACM.
Get yourself ready to hone your programming skills and take home the respect and cash. It is a 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.
There is a slot for 40 teams in the onsite round.
The problem set for the preliminary round will comprise 6 problems of varying difficulty.

Contest link is here - CodeRed 2018

The total prize money is worth INR 50K. There is a slot of 40 teams All teams making it to the onsite round will get Codered T-shirts.
Also, top 2 teams in the online round will get INR 3K and 2K respectively, along with Codechef Laddus.

So be ready to have a nail-biting experience on Feb 17 - 9 pm to 2 am IST
Register right now at the link given here to be eligible for prize money.
Facebook Page - CodeRed Facebook Page

Problem Setter - Shivam Garg
Problem Tester - Shiv Dhingra

Edit- The contest is now of 5 hours duration.

asked 10 Feb, 11:34

shivamg_isc's gravatar image

5★shivamg_isc
621110
accept rate: 0%

edited 19 Feb, 15:35


Can you please post the editorial ?

link

answered 18 Feb, 09:20

project14's gravatar image

0★project14
111
accept rate: 0%

1

Kindly refer the above post for link to hints :)

(18 Feb, 11:09) shivamg_isc5★

Can anyone plz say that why did my solution for the 4th question(based on mo's ) time out?

I used mo's with segment tree,where seg[3:7] will denote the minimum possible ans of all nodes whose values come between the range (3,7),i mean lets say node 1- 4,node 9-6 so seg[3,7]=20

Complexity is Qsqrt(N)logN

My solution : https://www.codechef.com/viewsolution/17464016

link

answered 18 Feb, 12:11

vivek_1998299's gravatar image

6★vivek_1998299
1.5k29
accept rate: 23%

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×280
×264
×36

question asked: 10 Feb, 11:34

question was seen: 2,325 times

last updated: 19 Feb, 15:35