Блог пользователя zscoder

Автор zscoder, история, 2 года назад, По-английски

Do you think you can solve CP problems without reading the problem statements? Let's find out!

On August 28, 2022 (Sunday) 19:30-22:00 GMT+8, I will hold an unofficial fun contest called Statement Not Found. As you can deduce from the title, there will be no problem statements (except title and samples). Your goal is to collect as many points as possible within 2.5 hours :)

Obviously, this round is unrated. It is somewhere between April Fools contest and a legitimate contest.

The contest will be OI-style, meaning there will be no time penalty. You are allowed to use any resources online to help solve the problems. There will be 12 problems.

Scoring Distribution: 200-400-700-700-700-800-800-900-1100-1100-1100-1500 (Total: 10000)

Please read all problems as problem difficulty is very subjective and a 1100-point problem might be easy for you while a 700-point problem might be difficult. The last problem is meant to be a tiebreaker.

You can participate solo or in teams of up to 3 (I would allow more team members but apparently Codeforces doesn't support it). Teams are highly recommended if you intend to solve everything in 2.5 hours. Good luck and have fun!

Twitter Announcement (Japanese)

Contest Link

Season 1 Problems

Below are hints/key insights to all the problems. Of course, please don't open this if you still plan to attempt the problems/virtually participate.

Problem A Hint 1
Problem A Spoiler
Problem B Hint 1
Problem B Hint 2
Problem B Spoiler
Problem C Hint 1
Problem C Hint 2
Problem C Spoiler
Problem D Hint 1
Problem D Hint 2
Problem D Spoiler
Problem E Hint 1
Problem E Hint 2
Problem E Spoiler
Problem F Hint 1
Problem F Spoiler
Problem G Hint 1
Problem G Hint 2
Problem G Spoiler
Problem H Hint 1
Problem H Hint 2
Problem H Hint 3
Problem H Hint 4
Problem H Spoiler
Problem I Hint 1
Problem I Hint 2
Problem I Hint 3
Problem I Hint 4
Problem I Hint 5
Problem I Spoiler
Problem J Hint 1
Problem J Hint 2
Problem J Spoiler
Problem K Hint 1
Problem K Hint 2
Problem K Spoiler
Problem L Criterion A
Problem L Criterion B & C Prerequisite
Problem L Criterion B Hint
Problem L Criterion B
Problem L Criterion C Hint
Problem L Criterion C

Top Scorers

  1. snuke, sugim48, hos.lyric 6470

  2. Golovanov399 6032.144

  3. .I., -is-this-fft- 4625

  4. Gilwall, conqueror_of_tourist, Friday1 4556.109

  5. hitonanode 4400

  6. Bench0310 3900

  7. rainboy 3600

  8. sansen 3456.109

  9. tute7627 3356.109

  10. AndreySergunin 3300

  • Проголосовать: нравится
  • +308
  • Проголосовать: не нравится

»
2 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Awesome contest idea! This sounds really fun!

»
2 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Auto comment: topic has been updated by zscoder (previous revision, new revision, compare).

»
2 года назад, # |
  Проголосовать: нравится -19 Проголосовать: не нравится

is it rated?

»
2 года назад, # |
  Проголосовать: нравится +159 Проголосовать: не нравится

Contest name suggestion: Statemen't

»
2 года назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

Starts in < 24 hours.

»
2 года назад, # |
  Проголосовать: нравится +13 Проголосовать: не нравится

~30 minutes to start!

»
2 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Wtf is this?

Can't compile file: Compiled file is too large [136700288 bytes], but maximal allowed size is 33554432 bytes [CompileRequest {id='program.cpp', description='', file='program.cpp', resources='', type='cpp.g++17'}].

(I just tried to copy some old CodeChef code that calculates the Bernoulli numbers fast...)

  • »
    »
    2 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Does it have some precomputed numbers maybe? Or, if there is something calculated in compile time in general, it may increase the size of the executable by an absurd lot

    • »
      »
      »
      2 года назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Yes, I see that this implementation of FFT contains some static arrays (for example, static point A[maxn]). Replacing them with non-static arrays or with vectors should work

»
2 года назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

Auto comment: topic has been updated by zscoder (previous revision, new revision, compare).

»
2 года назад, # |
Rev. 2   Проголосовать: нравится +10 Проголосовать: не нравится
about problem G
»
2 года назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

Thank you for the contest! GG to the winners

»
2 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Is it possible to solve J with python? My code got TLE.