pedroslrey's blog

By pedroslrey, 2 months ago, In English

Hello! I created a round in ICPC style. It will be held in a private group (link), and it will start at 26/09 14:30 UTC-3 (17:30 UTC). It will last for 4 hours, and you will be given from 9 to 10 problems. I recommend this round for division 2 participants (you are still allowed to participate if you are not a div.2 participant). All the problems are authored by me.

You can participate with a team or individually.

Good luck, and have fun!

Note: To register the round, you need to join the group first. You need to register the group as a participant and not as an spectator to join the round.

UPD: To avoid problems in registering the contest, all group members are now in participant mode (except for the testers). You can roll back this action by your own. Note that if you don't submit or register for the contest your name won't appear in the leaderboard.

UPD: Registrations are open.

UPD: Contest has ended, congratulations to the winners!

UPD: Editorial

Announcement of Contest I
 
 
 
 
  • Vote: I like it
  • +87
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Can you estimate the difficulty of the problems?

Can a noob like me try them out?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    Can you estimate the difficulty of the problems?

    Easy problems will be Div. 2 B

    Can a noob like me try them out?

    I encourage you to participate. Testers feedback will appear soon!

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

    Yes, beginners will definitely enjoy the round

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

I was looking at the group members, and many of them were spectators. I don't know if they selected this mode intentionally or unintentionally. You can't join the round in spectator mode, so if you selected the wrong mode, please change it.

»
4 weeks ago, # |
  Vote: I like it +30 Vote: I do not like it

As a tester, I encourage you to participate. The problems are very very nice!

»
4 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

As a tester I enjoyed the problemset..

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice problemset! How to solve F?

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

    I'm sorry for unclear statement in problem F. The intended solution was binary search on answer, testing for each time $$$t$$$ if cars get ordered (car $$$i$$$ will be at $$$i + tv_i$$$ after $$$t$$$ seconds)

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Did anyone solve C using Union find?

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

why no editorial ??