koderkushy's blog

Invitation to CodeChef Starters 30 (Rated for Div 2, 3, & 4)
By koderkushy, history, 2 years ago, In English

Hii Codeforces!

We are pleased to invite you all to CodeChef's Starters 30, aka International Coding Marathon, in collaboration with Technex '22, IIT-BHU.

ICM is the flagship CP event of Byte the Bits, the set of programming events organized under Technex, the annual techno-management fest of the Indian Institute of Technology (BHU), Varanasi. It is scheduled for 8PM IST (in about 4 hours from now) on the CodeChef platform.

Here is the contest link: CodeChef Starters 30

The contest is rated for Divisions 2 through 4. However, it is on the challenging side and has problems that will be interesting for Division 1 participants too (Prove your solutions!).

I'd like to thank

Cash prizes for the fast and precise! (Combined ranklist for div 1 and 2)

  • Global rank 1: 10'000 INR
  • Global rank 2: 6'000 INR
  • Global rank 3: 4'000 INR

Fill out this form to avail them.

Some of our previous rounds:

The video editorials of the problems will be available on Codechef's YouTube channel as soon as the contest ends. Subscribe to get notifications about new editorials.

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.

Good luck. Let's give the CC servers some numbers to crunch!

The editorial is out.

Congratulations to the winners (Combined ranklist for div 1 and 2):

  1. noimi
  2. asdsasd
  3. tute7627
  • Vote: I like it
  • +104
  • Vote: I do not like it

Comments Comments (21)
| Write comment?
»
2 years ago, # |
  Vote: I like it +30 Vote: I do not like it

As one of the problemsetters, I assure you that the problemset is very interesting.

→ Reply
»
2 years ago, # |
  Vote: I like it +27 Vote: I do not like it

As a problemsetter, the problemset is very exciting and fun to solve.

→ Reply
»
2 years ago, # |
  Vote: I like it +43 Vote: I do not like it

As a problemsetter of atleast one of the problems, I tried making the problem statement short and interesting.

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it +33 Vote: I do not like it

As a problemsetter, the problems are very interesting and I recommend you to read all the problems.

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it +50 Vote: I do not like it
meme
→ Reply
»
2 years ago, # |
  Vote: I like it +45 Vote: I do not like it
Yet another meme
→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

it was good, thanks

→ Reply
»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

I went for shit, PRESUF had 90 AC submissions, came back and now it has 250+ XD.

→ Reply
»
2 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Calculating the LIS of a sequence with element deletions (used in solving Maximizing LIS) is also used in this Atcoder Problem

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    was elements deletion required? I just calculated lis of prefix and decreasing subsequence from suffix and calculated the maximum answer.

    → Reply
»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

In last 5 mins 100 people submitted PRESUFOP XDD

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

How to solve Prefix Suffix Operations? For N >= 2, if it's possible then the answer is obviously the sum of the difference between the corresponding extreme elements of the array, but what are the necessary conditions?

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

https://www.codechef.com/viewsolution/60546801 can anybody tell any edge case for which my solution failing in 1 case out of 5 plz tell if anyone knows any edge case??

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    your code fails in the following case:

    ??2
??1

    it becomes

    132
241

    which used 4 colours. actual answer is

    212
121
    → Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

In PRESUFOP, I assumed there is no solution when there is more than one local maximum in the difference array B — A (not counting first and last). Is this correct?

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Div-1 and Div-2 had same questions?

→ Reply
»
2 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Fun Fact: In Div4 out of the 360 people that AKED (solved all problems during the contest) more than 200 have the same institute listed on their codechef account.

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

contest is really good,i learn lot of thing, thanks for the great problemset _ /\ _

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by koderkushy (previous revision, new revision, compare).

→ Reply