Автор awoo, история, 5 лет назад, По-русски

Привет, Codeforces!

В 22.07.2019 17:35 (Московское время) состоится Educational Codeforces Round 69 (рейтинговый для Див. 2).

Продолжается серия образовательных раундов в рамках инициативы Harbour.Space University! Подробности о сотрудничестве Harbour.Space University и Codeforces можно прочитать в посте.

Этот раунд будет рейтинговым для участников с рейтингом менее 2100. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за каждую неверную посылку до посылки, являющейся полным решением, равен 10 минутам. После окончания раунда будет период времени длительностью в 12 часов, в течение которого вы можете попробовать взломать абсолютно любое решение (в том числе свое). Причем исходный код будет предоставлен не только для чтения, но и для копирования.

Вам будет предложено 6 задач на 2 часа. Мы надеемся, что вам они покажутся интересными.

Задачи вместе со мной придумывали и готовили Роман Roms Глазов, Адилбек adedalic Далабаев, Владимир vovuh Петров, Иван BledDest Андросов и Максим Neon Мещеряков. Также большое спасибо Михаилу MikeMirzayanov Мирзаянову за системы Polygon и Codeforces.

Удачи в раунде! Успешных решений!

UPD:

Так же от наших друзей и партнёров из Harbour.Space есть сообщение для вас:

Привет, Codeforces!

Надеемся ваше лето проходит просто отлично!

В прошлую пятницу закончился второй Tech Scouts Summer Camp: 70 участников, 20 стран и множество решенных задач.

Благодаря сотрудничеству между Harbour.Space и Codeforces, у нас было 6 участников с полной стипендией и мы работаем над тем, чтобы в следующем году эта цифра увеличилась.

Так же хотим напомнить вам, что мы предлагаем стипендии для обучения по нашим техническим программам, таким как Computer Science, Data Science и Cyber Security.

Получение стипендии выстроено таким образом, что не требует заявок по строгим правилам — мы верим в ваши достоинства и потенциал, потому то, что вы сообщите в заявке и будет критерием для принятия решения.

Ты можешь быть тем, кого мы ищем, но ты не узнаешь этого, пока не подашь заявку!

Подать заявку→

UPD2: В раунде будет 6 задач.

Поздравляем победителей:

Место Участник Задач решено Штраф
1 Um_nik 6 111
2 Golovanov399 6 174
3 PinkRabbitAFO 6 190
4 dreamoon_love_AA 6 198
5 _twilight 6 232
6 HIR180 6 252

Поздравляем лучших взломщиков:

Место Участник Число взломов
1 greencis 122:-29
2 Ali_ZaiBug 26
3 racsosabe 22:-7
4 plusplus6408 14
5 Flamire 14:-3
6 crvineeth97 13:-2
Было сделано 397 успешных и 420 неудачных взломов.

И, наконец, поздравляем людей, первыми решившие задачу:

Задача Участник Штраф
A dorijanlendvaj 0:01
B Um_nik 0:04
C beefman 0:06
D Um_nik 0:12
E Benq 0:11
F Um_nik 0:31

UPD3: Разбор опубликован

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

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

Hope that Pretest can be strong this edu round. (I'm so afraid of fst). :D

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

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

Typically for educational rounds (and for this one in particular), is the intention to have strong pretests to try to prevent failing systests, or to have weak pretests to encourage hacking?

Just trying to get a sense for how much I should trust the pretests tomorrow. :)

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

Is it truth, that educational contests are a bit easily than usual div2?

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

A user enters the club of young explorers and says: "I am here for the first time". Music stops, and the main young explorer comes to him and answers: "You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post."

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

Round 69. The name itself a MEME

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

Roses are red, violets are blue,

Wish you a high rating, and hacking points too! xD

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

Nice

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

Hope I can become a candidate master after the contest.I only need +21

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

Hope that the statement of the problems is very short and easy to understand. :D

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

    Me too. My English is poor, and the LaTeX in the problems makes them difficult to be translated in Baidu Translator.

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

Again

Pretest needs to be strong.

accepted needs to appear more.

TLE should not appear.

And no Queueforces or Typeforces or Hackforces or Speedforces please.

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

Every time I take part in educational rounds I couldn't solve problem D out.

But in normal round I can solve it (but somtimes fst XP).

Ah, wish all would solve D this time!

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

    congratulations !! how did you solve d?

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

      YES!!! Hope no fst!

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

        what was your approach to solve it?

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

          My English is poor sry.

          An O(nm) solution:

          Let dp[i][j] be the maximum cost when choosing a[i] as the end of a subarray and the length of the subarray is n (n mod m == j).

          So when j = 0 ,dp[i][j] = dp[i — 1][m — 1] + a[i];

          when j = 1 ,dp[i][j] = max(a[i] ,dp[i — 1][j — 1] + a[i]) — k;

          else dp[i][j] = dp[i — 1][j — 1] + a[i]

          The answer is the maximum of the dp array.

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

            why?Could you post a blog? I'm going to study in your blog, thanks.You can just publish it in Chinese.I am also a Chinese competitor.

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

          And it's nearly 1 am in China, I have to go to bed so I can't leave more details. Bye.

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

        Hi,what is fst?

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

          FST is short for 'fail system tests'. In Codeforces-format contests, tests are split into pretests and system tests. Before the contest ends, submissions are judged with pretests. Then the latest submissions with 'Passed Pretests' verdict will be judged with system tests, which are stronger. FST means that your submission passed the pretests, yet failed during system testing.

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

Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

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

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

    Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

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

      "I don't know." * 7 * 20.

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

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

      Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?

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

        It's so long that I don't want to count how many questions there is.

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

        Are you a repeater or something?

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

          Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am. Yes, I am.

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

        you can compress it as for(i=0;i<200;i++) { cout<<"Is it rated? Is pretest strong? Is system test quick? Is TLE rare? Is statement short? Is Editorial ready right after the contest? Is it Hackforces or Queryforces or neither?"<<endl; cout<<'\n'; }

        looks like someone need to learn about loops .....

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

          But maybe that comment is easier to send and harder to read than this one.

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

Waiting for another queryforces

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

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

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

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

Спросите у харбор спейс, если я им 125е отдал, а меня не не дали сколаршип, то деньги вернут?

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

I think the setter got lost making testcase 1 of problem C :p

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

used a linked list for the first time in my life

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

How to solve C & D??

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

    Problem C.

    Sort the array find all differences of $$$a_i - a_{i-1}$$$ and sort them because we need to take away $$$k$$$ biggest ones. And choose first $$$n - k$$$ differences.

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

      Why does this work?

      taking difference?

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

        Array is sorted

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

        basically u have to choose k-1 indexes from the array so that k subarray can be formed. now choose those k-1 indexes efficiently as ex. if k=3, so choose 2 indexes ,let it be i & j so cost is a[i]-a[0]+a[j]-a[i+1]+a[n]-a[j+1]. now write these terms efficiently so (a[i]-a[i+1])+(a[j]-a[j+1])+(a[n]-a[0]) now for to minimise this expression ,first two brackets should be min. as last bracket is always constant so sort the array(array of differences of a[i]-a[i+1]) and take 2 values (means if k=3) and then add (a[n]-a[0]).. this is yur minimum answer.

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

      why first n-k???

      if we need to make k subarrays then the cost of k elements form ai−ai−1 will be needed. No?

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

        Logically, because array is sorted, it is like we are merging n — k pairs to make k subarrays

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

Problem #D was very difficult for me... R.I.P my blue dream..

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

How to solve problem D?

  • »
    »
    5 лет назад, # ^ |
    Rev. 5   Проголосовать: нравится +70 Проголосовать: не нравится

    There is a common approach to find a subarray with maximum sum: construct an array of prefix sums $$$p$$$, and find a pair $$$l, r$$$ such that $$$r >= l$$$ and $$$p[r] - p[l]$$$ is maximum possible. To do so, we iterate on $$$r$$$ and maintain best possible $$$l$$$.

    Let's modify it for our problem. Suppose $$$l$$$ has remainer $$$x$$$ modulo $$$m$$$. Let's remove $$$x$$$ first elements from our array, and search for best $$$l$$$ only among those that have remainder $$$0$$$ modulo $$$m$$$. To maintain that we should subtract $$$k$$$ a few times from the result, we may insert some elements equal to $$$-k$$$ so we get an array: [ $$$-k$$$, $$$a_1$$$, $$$a_2$$$, ..., $$$a_m$$$, $$$-k$$$, ..., $$$a_{m + 1}$$$, ..., $$$a_{2m}$$$, $$$-k$$$, $$$a_{2m+1}$$$, ...].

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

      Thank you, I didn't know about this approach with prefix sum. It is really cool, I will study it!

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

      During contest i thought of solution using binary search. we want to maximize:p[r]-p[l-1]-ceil(k*(r-l+1),m) so we fix l and binary search on fun(r)=p[r]-ceil(k*(r-l+1),m) for maximum value, but the problem here is p[r] is not suitable for binary search,but we could instead replace it with p2[r]=max(p[r],p[r-1]), index having negative values are not useful,as we could already have our have our maximum on lower size(r-l+1). now we can binary search on fun2(r)=p2[r]-ceil(k*(r-l+1),m). so for each l=0 to n-1,we get our maximum value. is the above solution feasible,could it work.I tried implementing it but was getting TLE.

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

        Fixing l and finding correct r value by binary searching is not possible as the values won't be monotonous always... What I mean is
        f(l, x) > f(l, x+1) < f(l, x+2).

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

          k*(r-l+1)/m is monotonous , and we are making prefix monotonous using pfx2[r]=max(pfx[r],pfx[r-1]), as you may notice considering negative values is not useful,as it will never be considered in max contribution.

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

      Can someone share code with this solution?

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

      I'm sorry but i don't really understand, how would we iterate over $$$r$$$ while maintaining the best possible $$$l$$$ ? Is this sort of like kadane's algorithm? I would really appreciate it if you could provide some link regarding this.

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

    using dp i think

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

      Why downvotes? It can be solved with DP[i][j] = maximum sum if r = i && (r-l+1)%m = j. 57555709 or is it the same thing BledDest mentioned above?

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

      It can be solved with a very simple DP, where DP[i] = maximum subarray ending at index i. Then for the transition we have two choices — the length of the max subarray ending at i is at most m, or it is more than m. First case can be computed in constant time, and for the second case we have DP[i — m] + A[i — m + 1] + ... + A[i] — k.

  • »
    »
    5 лет назад, # ^ |
    Rev. 3   Проголосовать: нравится +18 Проголосовать: не нравится

    Here's one way to solve it (57526007).

    1. Miss the constraint on $$$m$$$.
    2. Try random shits and fail.
    3. Decide to ignore the ceiling function and then fire up a CHT. To avoid fuck up, take the best among nearby $$$69$$$ lines suggested by CHT.
    4. Arsenal.
    5. Profit.

    Any hack?

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

    I couldn't solve it during the contest but later on, after fixating on the O(M*N) constraint, I solved it like this —

    If we pick 1 or 2 or .. m-1, in all cases, we have to subtract k while building the solution. So I built the solution by kind of picking bunches of m elements at a time. While iterating from left to right, solution at i represents the best possible subarray ending at i.

    When you pick m elements at a time, you get two options —

    1) Add all m to previous solution at (i-m)

    2) Leave some (k, ranging from 1 to m-1) gaps in the beginning and start a new optimal subarray from here.

    At every step, take the maximum of the two available options and keep updating the final answer at each i.

    My solution

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

Good contest, thanks)

How to solve E?

  • »
    »
    5 лет назад, # ^ |
    Rev. 3   Проголосовать: нравится +19 Проголосовать: не нравится

    if ini<outi<10^5 it is easy to solve with dp(int max_out,int is_something_used) which return pair, first value is minimum extra space, second is our answer. We can go to dp(max_out-1,is_something_used) or use some matryoshka to skip from max_out to new_ma_out. Know you can convert all values <10^9 in values <2*(n)<2*(2*10^5). This is a solution which i send and get AC 57544668

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

      This is the same idea as to build graph(two adjacent unique values(plus 0) of input in sorted array have edge with weight equal to absolute difference of values, and edges with weight equal to 0 from out_i to in_i) and that you must find number of different ways from larges value to 0 it is easily with Dijkstra.

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

Any hint for E?

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

What is the 3rd testcase for problem D?

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

Will the contest be open for virtual participation before the end of the open hacking phase, or will virtual participation only be available after the results are finalized?

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

D was a very cool problem to learn about maximum subarray sum

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

Got confused in A for a long time. Thought we can make new planks by joining other planks :(

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

Can anyone explain the proof of C?

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

    if you divide the array into k parts, then cost turns out to be : cost = An — A1 — d1-d2-d3....dk-1 where di correspond to difference between consecutive elements in elements at the partition ends: Ex. — 1 2 3 / 5 6 7/ 10 11 12, here d1 = 5-3, d2 = 10-7.

    So to minimize answer, we need to subtract maximum difference for K-1 differences from An — A1, which can be achieved just by sorting differences.

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

C was similar to global round 1 (B) quen.

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

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

Solve task D, but long type is not enough for result... Send solution (5 min after) with BigInteger and get AC (may be somebody crack my solution, but im really sad).

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

How to solve D?

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

    iterate the remainder $$$i$$$ fo $$$m$$$, and calculate the every prefix sum $$$pre[j](i\le j \le n) = \sum_{k=i}^j a[i] - \lceil {j - i + 1 \over m} \rceil$$$, so the cost of subarray[l...r]=pre[r]-pre[l-1]($$$l \bmod m = i$$$), you can find answer by maintaining maxmium pre or minimum pre.

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

Oh. In A, I always thought that two planks can put together to be a longer plank and the second maximum plank can be changed...

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

    Same here. Was lost in that almost till the end. It might have been a good problem to deal with.

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

Is there any point in problem B that input has unique numbers?

We cannot hack with repetitive numbers in test case because codeforces says it's invalid.

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

    where ai is the radius of the disk initially placed on the i-th pillar. All numbers ai are distinct.

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

Nice Contest :)

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

After thinking about subarray sum for a long time and not getting anywhere, I decided to use the ol' divide-and-conquer method to solve D. I've used this "trick" previously to solve a G from another educational round, where the solution was segment tree.

Here is the code — https://codeforces.net/contest/1197/submission/57533758

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

I submited my code and wrong answer. After that, I didn't submit any problem. So will my acount unrate in this contest?

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

    nope, the round will be still rated for you.

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

    I think that if you submit at all, the contest becomes rated for you.

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

    when u submit code with any verdict at anytime in official time of a contest, this means that you will be a participant and u will be rated after the contest also

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

I recently started on codeforces and I can only solve 2 problems atmost and after the contest 3rd seems pretty doable but I cant get it right during the contest. My rating is just getting dropped after each contest and that has got me irritated and sad. Any suggestions on how to improve??

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

    I'd say don't worry about your ratings until it stablizes. The initial ratings don't represent much about your skills anyways.
    On how to improve, you can try learning algorithms and make your own library to use in the future.

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

Any hints in problem F for one line? I know that should by some matrix multiplication.

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

    It's impossible to do it in one line, but I'll try to make it short.

    When analyzing a combination of acyclic games, we can almost always apply Sprague-Grundy theory. Let's solve the problem with the following dynamic programming: $$$z[i][j]$$$ is the number of ways to color $$$i$$$ first strips so that the Grundy value of their combination is $$$j$$$.

    To do this, we have to somehow count the number of ways to paint one strip so that its Grundy value is fixed. We can do it with auxiliary dynamic programming: $$$dp[i][last]$$$ is the number of ways to color $$$i$$$ first cells of a strip so that the tuple $$$last$$$ represents the values of Grundy of the last several cells. Since our moves are limited to shifting the chip at most $$$3$$$ cells backwards, we have to store only $$$3$$$ last Grundy values in this tuple. And since we have at most $$$3$$$ different moves, each Grundy value does not exceed $$$3$$$, so there are only $$$64$$$ different values of $$$last$$$ we are interested in.

    To speed this up, we can skip long uncolored segments by converting the transitions of this dynamic programming into a $$$64 \times 64$$$ matrix (let's call it $$$T$$$) and using binary exponentiation of this matrix. The common version of matrix exponentiation may be too slow (this solution will work in $$$O((n + m) K^3 \log A)$$$, where $$$K$$$ is the number of rows in $$$T$$$), so we should speed it up. One common way to do it is to notice that every time we need to skip a long uncolored segment, we have to multiply the transition matrix (which is the same every time we need to do so), raised to some power, by the vector of current dp values. So, instead of naively exponentiating $$$T$$$, we may precalculate $$$T$$$, $$$T^2$$$, $$$T^4$$$, $$$T^8$$$, ..., $$$T^{2^{30}}$$$ and multiply the matrices we need by this vector, and it reduces the time we spend on every uncolored segment to $$$O(K^2 log A)$$$.

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

What's wrong in this logic for problem C? Code

I used binary search.

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

I try to hack one solution of problem 'A' using this code.. But it shows "invalid input". Any Reason??

include <bits/stdc++.h>

using namespace std;

int main() {

cout << 1 << "\n";
cout << 100000 << "\n";
for(int i = 0; i < 100000; i++) {
    cout << 100000 << " ";
}
cout << "\n";

return 0; 

}

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

Problem C was very similar to this problem asked in Global round 1.

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

Why is there one person with so many hacks in problem A?

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

    I noticed that all hacked submissions in problem A are written in Java, so i think the problem is with sort (in some specific cases it can run in o(n^2) instead o(nlogn)).

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

      nice, my solution also hacked

      My thinks during 1st task: "Do not use sort, just store 3 maximum elements", but lazy won.

      Is there some info about worst cases for java Arrays sort?

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

        I think that it will run in o(n^2) for arrays that are almost sorted, but i am not certain.

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

        As far as I remember, int array in java uses QuickSort, a workaround for this is to use an Integer array which uses MergeSort instead.

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

          Yeah, I found on codeforces forum discussions. Top contest for me (life education), one hacked, other has correct solution but too late because of wrong work with types

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

From past few contest i keep getting stuck at Problem A , in most cases i was not not able to understand the problem properly , which leads me to huge time loss . Same thing happened to me today . I feel B was pretty easy . Solve it in 10 min using 2 pointer . I tried so hard to become pupil , but i am unable to achieve this simple thing too .

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

Can someone please explain how to approach for Problem E..?
Thank you.

  • »
    »
    5 лет назад, # ^ |
    Rev. 3   Проголосовать: нравится +11 Проголосовать: не нравится

    Without loss of generality the dolls are ordered such that out_1 <= out_2 ... <=out_n

    Key observation. Fix j<i and consider all arangements such that the smallest matrushka is i and the largest is j, then the arrangement amongst these that minimizes empty space is already maximal with respect to number of matrushkas.

    Now we describe a quadratic solution. Let m[i] be the minimum possible extra space in a maximal arrangement such that matrushka i is the biggest matrushka (maximal among arrangements containing only matrushka i and smaller matrushkas). Now let q[i] be the number of such arrangements. We provide a method to calculate all m[i] and q[i] increasingly:

    Step 0: initialize m[i] = INF and q[i] = 0;

    Step 1: iterate through 1 to i-1 and for each doll j that fits inside doll i do m[i]=min(m[i],m[j] + in[i] — out[j]).

    Step 2: iterate through 1 to i-1 and for each doll j that fits inside doll i such that m[j] + in[i] — out[j]=m[i] add q[j] to q[i].

    Now, in order to make this nlog(n) instead of quadratic we use a persistent segment tree and an implicit persistent segment tree.

    in order to do step 1 we just need a segment tree that saves in position out_j the value m[j] — out[j], and to find the best one that fitst we just query for range (1,in[i])

    in order to do step 2 we need persistance, let version T_k of the segment tree only contain the updates of j if out[j]<= k. Then the sum of all the q[j] we need is simply the value stored in position m[i] — in[i] of the tree T_(in[i]).

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

My A got TLE: link

Why? Is this all because I used Java?

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

    Arrays.sort uses quicksort for primitives and mergesort for objects. It's possible to hack you with an adversarial case such that quicksort takes quadratic time. You can avoid this by sorting an array of Integer rather than int.

    greencis got me with this before too — 55176174 :)

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

      Wow! I didn't know that. I guess it is the best lesson I could have learned from a div2 A problem.

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

        I was lucky to learn this lesson by submitting an unofficial solution after Educational Codeforces Round 66 (Rated for Div. 2) ended (I didn't compete in that round) and somehow still getting hacked, so I got the lesson for the low cost of 0 points. :)

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

        It seems this lesson is getting more expensive. I did the same thing in C. Go ahead and hack it.

        I literally screwed up. lol

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

          Good news, because the adversarial array would have all distinct positive integers and is the differences of the input array, the maximum input size where the input values don't exceed $$$10^9$$$ is approximately $$$N \approx \sqrt{2 \cdot 10^9} \approx 44000$$$. And it turns out $$$O(N^2)$$$ is still reasonably fast for this case. As a result, I think you will not get hacked.

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

        i know that feel, bro) in my case I also have D task AC 10 min after contest

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

I saw many people using segment tree to solve D. Can anyone explain this in more detail? (the whole algorithm) ^^

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

When will the rating change due to this competition. Mine is same.

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

why does this binary search approach fail in problem C , I am searching for minimum possible difference almong all the different that will result in k partition. https://codeforces.net/contest/1197/submission/57575150

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

Good contest ,but...

System test and rating change are SOOOOOOOO SLOW!

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

How my solution for A was hacked. I did the same as others did.Is there anything to care about in java?

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

I am not Div. 3 any more.

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

I have a complicated feeling after the contest.

Happily,I became an expert again as soon as I wrote this.

However,because of my rating,I will be unrated if I participate in the next div3 contest.o(╥﹏╥)o

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

Will Editorial be posted?

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

I come with something for problem D but I can't develop it to a solution if anyone solves it by the help of the following please tell me:

we deal with the array as the blocks, we try each possible one let's call it j from 1 to m, and for every j we try to start from 0 to j — 1 and move by j step to partition the array.

it does nothing but I think it could be developed in some way.

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

MEMETIMEWAIT

..

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

Not sure if anyone else did this, but my solution for B actually uses Binary Indexed Trees. https://codeforces.net/contest/1197/submission/57523003

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

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

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

Can anyone explain to me what "hacking solutions" means and how to do it please?

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

    Hacking a solution means passing a custom test for someone's submission. If submission and author's code return different answers or any other failure happens then solution is hacked and the authon loses his points.