Dominater069's blog

Invitation to CodeChef Starters 147(Rated upto 5 stars) — 14th August
By Dominater069, 34 hours ago, In English

We invite you to participate in CodeChef’s Starters147, this Wednesday, 14th August, rated upto 5 stars (i.e. for users with rating < 2200)

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

Good Luck!

Congratulations to Top 5!

  1. maspy

  2. redstar08

  3. ecottea

  4. tiger2005

  5. kdu_5

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

»
5 hours ago, # |
  Vote: I like it +1 Vote: I do not like it

contest guyss!!

→ Reply
»
5 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

problems not loading

→ Reply
»
5 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Problems not loading.

→ Reply
»
5 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

why div2 problem added on div1 and in the middle of contest. all first 3 problem removed ? is that legal ?

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

It's always a must to participate in Dominater069's round.

→ Reply
»
3 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

I used this for the last problem — https://mirror.codeforces.com/blog/entry/78931.

This is the first time I have used something from this list.

→ Reply
  • »
    »
    3 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    There is no need for it, it can be solved with any RMQ structure like segtree. You just need to construct a directed tree from the array using the RMQ structure and then do dfs + binary search on ancestors.

    https://www.codechef.com/viewsolution/1080131201

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

    even assuming you do need O(1) query, why did you need O(n) build? O(1) query normally is just sparse table

    → Reply
»
3 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Why every problem has "101" as suffix? Any special reason for that?

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

shortest distance 101 div2- 103 AC

div1 — 11 AC

→ Reply
  • »
    »
    98 minutes ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    div4 146 AC Lmao
    This actually seems like a good system to minimize the effect of cheating. They will probably get banned before ever reaching div1

    → Reply
    • »
      »
      »
      86 minutes ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      This also means that someone with a very high rating is leaking the solutions. This is so disheartening because this community has given us everything for free.

      → Reply