Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

kostka's blog

Tasks from the 22nd, 23rd and 24th POI are finally translated!
By kostka, 6 years ago, In English

You asked for it and we are trying to deliver! Almost all tasks from the 22nd, 23rd and 24th Polish Olympiad in Informatics are already translated and are available on Szkopuł:

Tasks from the last edition (25th) are being translated.

Please don't be scared of Polish titles, that's because we are trying to unify all problems. The problem statements should be in English. In particular, check if your language is set to English (the flag in the upper-right corner).

Out of all 396 original tasks from all 25 editions of the Polish Olympiad in Informatics, over 83% are available in English right now. I really hope that we can reach 100% later this year to celebrate the 25th birthday of the POI, but I don't want to promise anything.

Enjoy!

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

»
6 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Great!

→ Reply
»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

anyone know if there are editorials for these tasks?

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Unfortunately, there are detailed editorials, but only in Polish: https://oi.edu.pl/l/40/

    → Reply
    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      so is there any plans to translate the editorial as well?

      → Reply
      • »
        »
        »
        »
        6 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        I'm sorry, but no. A single book in Polish is pretty problematic.

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

          Do you know an efficient way to translate them? I used to use Google translate for PDFs because translations were nice but this is no longer possible (it says that file is too big). I also tried translating line by line but it is much much harder to understand).

          → Reply
          • »
            »
            »
            »
            »
            »
            6 years ago, # ^ |
            ← Rev. 2   Vote: I like it +5 Vote: I do not like it

            Mhm... I used to translate the whole paragraphs (from Japanese) and it worked pretty well. Also, there's plenty of Poles here. Feel free to ask about any editorial and I am sure someone will answer.

            → Reply
»
6 years ago, # |
  Vote: I like it +6 Vote: I do not like it

This is a very tremendous effort. Thank you very much!

By the way, do you plan to reveal test datas for POI 23rd and afterwards?

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

    Just to clarify: I didn't translate them personally, I just complained about the lack of translations and uploaded them.

    As far as I know, the testcases will be published with editorials (I don't know when). If you need them right now for some particular reason, feel free to message me. I will check what can I do.

    → Reply
    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it -10 Vote: I do not like it

      Are you intending to translate the courses ?

      Because they seem pretty good to learn from these courses ?

      What do you think ? kostka

      → Reply
    • »
      »
      »
      19 months ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      Where are the test data after the 2014/2015 season?

      → Reply
»
6 years ago, # |
  Vote: I like it +20 Vote: I do not like it

I think translation of this task is a bit incorrect. Problem statement says you can swap two adjacent cells but according to editorial arbitrary 2 cells can be swapped.

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    Heh, I quickly checked and it looks like you are correct. I will notify the right person and we'll change that. Thank you!

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

Great job. Thank you!
I've been looking for them from two years ago!

It'd be great if adding problems of POI to Szkopuł could be done in nearly real-time, or even holding online-mirror contests, so students from other countries could use them as a good practice plan. Somehow like COCI or USACO.

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    I would like it to happen as well, but we need some manpower.

    → Reply
»
6 years ago, # |
  Vote: I like it +15 Vote: I do not like it

Any ideas on how to solve the problem Zapiekanki from 24th POI Round 3? (according to the official results no one got a full score onsite I think and I only got the O(k3) solution)

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

    You can find an editorial here (it is written in Polish) Editorial.

    → Reply
    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it +10 Vote: I do not like it

      I'm not sure if I translated it correctly but it seems like the solution described here only made use of the fact that it's hard to create strong tests for this problem?

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

        As far as i know the model solution used the fact that log n of states is sufficient. Unfortunately i cannot provide a proof. Anyway, it is not a great editorial though, sorry.

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

          Model solution is dp in O(k2) and it doesn’t use this observation (i don’t know if it is true that logn states are enough). It uses fact that in optimal solution we have blocks where we bake without any break and this blocks ends in a moment when some clients come (there is a problem that we can’t bake before moment 0 but it is possible to change all ti < d to d and add d — ti to result).

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

            Thank you for correcting me.

            → Reply
          • »
            »
            »
            »
            »
            »
            4 years ago, # ^ |
              Vote: I like it +8 Vote: I do not like it

            Is the fact correct for the sample? In the explanation, the second block ends at 18, but no client comes at 18.

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

              I can't recall the exact details right now, but I think that the first block in our group of blocks ends in a moment when a client comes.

              → Reply
      • »
        »
        »
        »
        6 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        Yeah, it is not an official editorial, just a bunch of smartasses think they are funny.

        → Reply
»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

A bit off-topic, but does the new POI site not support Java anymore?

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    No, but Java (and Python hopefully) will be supported in a near future.

    → Reply
»
6 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Does anyone have a hint for Pizza Delivery? UPD: Got AC thanks to Noam :)

→ Reply