yash_daga's blog

Invitation to CodeChef Starters 134 (Rated till 6-Stars) — 15th May
By yash_daga, history, 2 weeks ago, In English

We invite you to participate in CodeChef’s Starters134, this Wednesday, 15th May, rated for till 6-Stars(ie. for users with rating < 2500).

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

One of the problems of this contest was also used in Code Mania Blitz, ancc IITD contest, so if you participated in that contest, please refrain from participating.

Joining us on the problem setting panel are:

Note: Some problems have subtasks

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. Hope to see you participating.

Good Luck!

  • Vote: I like it
  • +63
  • Vote: I do not like it

»
2 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it

C++23 when

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

My post contest discussion stream where I will discuss all the problems

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

How on earth have so many people solved COUNTRBS? My solution is to notice that at most one good RBS starts at each position (namely, it ends at the next occurrence of the same prefix sum if all prefix sums in between are greater) and hash all O(n) substrings, but I think the observation part is too hard for most 5* coders.

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

    I think it's scoreboard effect and the fact that you don't need to think about prefix sums. Simply find matching brackets in the string (as the string itself is a regular bracket sequence), and use your favourite way to compare two substrings.

    → Reply
»
2 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it
why WA in 3in1out
→ Reply
»
2 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Boring Contest ever

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

Very bad contest, question were some variation of standard problems. ( div2B or div2C)

Also there is issue with cc contest timer, i had 7 minutes remaining acc. to timer but when i submit my code it displayed time over.

this happend multiple times, resulting in me losing rank.

please fix it :(

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

why there is only one sample case. If you are so insecure of people guessing the solution by looking at test cases than why create such guessable problems

→ Reply
  • »
    »
    13 days ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    In case you are talking about Permutation Cycle Queries.

    My Opinion
    → Reply
»
2 weeks ago, # |
  Vote: I like it +18 Vote: I do not like it

In PRISON it should be made more clear what to output when there are no prisoners or guarenteed that there is at lease one prisoner. I chose some random negative values and got WA first.

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

Great Problemset. I learned alot.

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

3outin1 had me..loved this one

→ Reply
»
13 days ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

What a creativity in writing countRBS problem, really awesome. I mean doable with both string hashing and tree hashing

→ Reply