Dominater069's blog

Invitation to CodeChef Starters 194(Rated for all) — 13th July
By Dominater069, 10 months ago, In English

Please note the unusual day of the week for the contest.

We invite you to participate in CodeChef’s Starters 194, this Sunday, 13th July, rated for all.

Time: 8:00 PM — 11: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.

Note:

  • The contest is on a Sunday instead of the usual Wednesday, due to it being a more convenient time for some users. Only the rated for all contests may be held on Sundays instead (but upto the discretion of contest admin), the other contests on the usual Wednesday.

  • The contest is yet again based off the IOITC Camp in India. If you have participated there or seen the problems otherwise, please refrain from participating.

  • There may be a number of unusual problems, or problems with subtasks.

Good Luck!

Congratulations to Top $$$5$$$ in Division $$$1$$$.

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

»
10 months ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

Only the rated for all contests may be held on Sundays instead (but upto the discretion of contest admin), the other contests on the usual Wednesday ????? Is slightly unclear ??

→ Reply
  • »
    »
    10 months ago, hide # ^ |
     
    Vote: I like it +18 Vote: I do not like it

    the normal contests will be happening on Wednesday only, as is the usual Codechef schedule.

    Only the rated for all contests may happen on Sunday (or it may happen on Wednesday as well). This is due to several high rated users commenting that they cannot participate due to not being free on a weekday.

    → Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Contest starts in ~25mins.

→ Reply
»
10 months ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

site down?

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Facing issue while loading the contest page.

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

For this problem Munchys Modulo I thought there should be better solution than N^2, but I could not find it. After the contest I found out from editorial that actual solution is N ^ 2, got accepted right away. I could think easier approach from beginning

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

could somebody explain why in the problem D (terminal states) the following logic doesnt work : compute the number of increasing subsequences after removing all numbers that can't be deleted with the operations at all?

→ Reply
»
10 months ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

Speedrunning was nice, atleast the easy/medium version.

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

can somebody hint on how to approach the non cyclic version

→ Reply
  • »
    »
    10 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    dp

    → Reply
  • »
    »
    10 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it
    • the hint you need : notice that you can represent any sub array sum of length N / 2 as
    • first half sum + j length prefix sum in second half — j length prefix sum in first half. 0 <= j <= N / 2
    • which is [1, N / 2] + [N / 2 + 1, N / 2 + j] — [1, j]
    • [j + 1, N / 2 + j]
    • if you put all values of j, you can see we covered all the sub arrays of length N / 2
    → Reply
»
10 months ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

very very good round. appreciate..

→ Reply