_Kuroni_'s blog

By _Kuroni_, history, 3 months ago, In English,

Disclaimer: Please don't try this at home. I just find this occasion quite hilarious and want to share with you guys :D

So yesterday I was hanging out with my folks, and there were some mild alcohol here and there (I drank some apple cider, please don't call the police I just reached 18) and I was a bit drowsy but definitely not drunk. I was just chilling when I checked on my phone and realized it was a mere 7 minutes until Codeforces Round #573 (Div. 1). If it was for any normal human being, they would probably skipped the contest and continue the fun. However, because I am not drunk at all, I decided that I should run home and participate. So I excused myself out of the party and sprinted as fast as I can.

On the path back home, there were 2 paths, one is clear and nicely lighted but a little bit further, and one involved running through a badly-lighted park but it was shorter in distance. As a programmer, I applied the Dijkstra algorithm immediately and sprinted through the park with maximum power. Little did I know, the shorter path does not always have the lower weight. There was a giant boulder in the middle of the park, and since the park was a little dark and I am definitely not drunk, I scratched my knee onto the boulder. It kinda hurt, but I just shrugged and ran through the rest of the park. Upon reaching home, I was greeted with this (mild bleeding warning).

However, it turns out my dedication was paid off, since I probably peaked my all-time performance, solving 4 problems in div 1 for the first time and at one point even reached the 8th place with a +221 predicted delta. There's not much to say afterwards, I regained my grandmaster status with no failed system test :D

So you could say I literally traded my red blood for my red grandmaster status. Please don't do this unless you are definitely not drunk.

Read more »

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

By _Kuroni_, history, 5 months ago, In English,

Hello everyone, this is the editorial for Codeforces Round #558 (Div. 2). I hope you enjoy the problem as well as I did!

1163A - Eating Soup

Author: _iloveNQ_

Tutorial
Implementation

1163B2 - Cat Party (Hard Edition)

Author: _Shirone_

Tutorial
Implementation

1163C2 - Power Transmission (Hard Edition)

Author: LunarStellarshot

Tutorial
Implementation

1163D - Mysterious Code

Author: _Kuroni_

Tutorial
Implementation

1163E - Magical Permutation

Author: _Kuroni_

Tutorial
Implementation
Implementation with DFS

1163F - Indecisive Taxi Fee

Author: _Kuroni_

Tutorial
Implementation

Read more »

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

By _Kuroni_, history, 5 months ago, In English,

Hi Codeforces!

I'm glad to introduce you to Codeforces Round #558 (Div. 2), which will take place on May/09/2019 18:05 (Moscow time).

You will have 6 problems and 2 hours to solve them. Two problems will have subtasks. Round will be rated for everyone with rating below 2100. Participants from the first division can also participate out of competition as usual.

The problems were prepared by me, _iloveNQ_, _Shirone_, and LunarStellarshot. I would like to thank _kun_ for his immense help during the round preparation, 300iq, mohammedehab2002, and Um_nik for testing them, and of course MikeMirzayanov for the Codeforces and Polygon platforms.

In the contest, you will meet Kuro, Shiro, Katie, and Selena, the four naughty but smart cats who love playing and asking questions. I hope you will find our problems interesting.

I will be in the community Discord server after the contest to discuss the problems with you. You can find the server here!

Good luck!

UPD1: Problem B and C will have 2 subtasks. The scoring distribution will be 500 — (750 + 500) — (1000 + 750) — 2250 — 2750 — 3250.

UPD2: The contest will be delayed by 15 minutes due to technical reasons. Sorry for the inconvenience :(

UPD3: Final standings!

Div. 1:

  1. ainta (the only contestant to finish all problems!)

  2. dreamoon_love_AA

  3. hank55663

  4. tfg

  5. pmnox

Div. 2:

  1. xht37

  2. Ekoos

  3. beka_asd

  4. bbao69

  5. OIerDb

The editorial is available here. Thank you for participating!

Read more »

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