Errichto's blog

Codeforces Round #318 [RussianCodeCup Thanks-Round]
By Errichto, 9 years ago, In English

Hello Codeforces community!

Codeforces Round #318 (for both divisions) will take place on August, 29 at 19:30 MSK. It is the Thanks-Round devoted to Russian Code Cup. You will be given 5 problems and 2 hours to solve them. Scoring will be announced close to the round. I strongly recommend you to read all problems.

RussianCodeCup is the largest open programming competiton for Russian-speaking participants by Mail.Ru Group. Its history started in 2011. And since the first championship RCC offers great problems and generous prizes. This year finals will be held on September, 19th. Wish good luck to all the finalists! Thank you, RussianCodeCup, for your gift on the 5th anniversary of Codeforces!

I am honoured to be a problem setter for this round. I wouldn't do it alone. I want to thank Zlobober for his great help with problems preparation and MikeMirzayanov (and all people working on Codeforces and Polygon) for this awesome site. It's an amazing place to learn and compete. My big thanks to winger and AlexFetisov for their help with testing a round. And to Delinur for translating statements. As you see, not only a setter creates a round.

It's my first Codeforces round but not my first problems here. You can check out A, C and D from VK Cup 2015 — Round 2. Also you might remember some of my problems in TC rounds. I'm very happy with finally preparing a full round for Codeforces and I hope you will enjoy it. I tried my best to prepare nice and diverse problemset, you will judge it. In all problems you will have to help Limak who is quite unusual bear.

I wish you great fun and no frustrating bugs. Looking forward to seeing you!

UPD: Scoring is 500-1000- 1750 -2000-2500 in div1 and 500-1000-1500-2000- 2750 in div2. Enjoy a round!

UPD: Editorial

UPD: Contest is over. The winners:

Div1:

  1. Marcin_smu
  2. mnbvmar
  3. subscriber
  4. LoneFox
  5. Shef

Div2:

  1. cescmentation_folch (5 problems solved!)
  2. fhxb520630 (5 problems solved!)
  3. bugCollector
  4. Sehnsucht
  5. okaduki1

And note from an author. There were some wrong solutions passing. Sorry for that. I tried my best to create strong tests but I failed a bit. Did you like this round? What do you think about problems?

Thanks for participating!

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

Comments Comments (212)
| Write comment?
»
9 years ago, # |
  Vote: I like it +216 Vote: I do not like it

No T-shirts ?

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

You solve a lot of users' problems in the blogs...

Wish we can solve your problems too ;)

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

Maybe we should study your previous problems well, to get a whole look of the style of your problems. Maybe?

→ Reply
»
9 years ago, # |
  Vote: I like it -48 Vote: I do not like it

Good luck to all participants (Codeforces Round # 318 — Russian Code Cup). I wish you a good mood during the contest and rankings.

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

    translate: I need upvotes , plz :)

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

      translate: I need upvotes , plz :)

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

        translate: I need downvotes._.

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

          translate : I have nothing to do

          → Reply
»
9 years ago, # |
  Vote: I like it -62 Vote: I do not like it

Considering the previous round i think it will be better to do dynamic scoring.

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

    Considering your downvotes I think it will be better advertisement if they do static scoring.

    → Reply
»
9 years ago, # |
← Rev. 3   Vote: I like it +3 Vote: I do not like it

I think someone is getting ready to get first in this contest. to : sorry_dreamoon Be careful. You have a new mission : Antoniuk

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

I hoped this Contest for T-Shirts but ... TT.TT

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

LOL Guys you are so worried about T-shirts as if you can win them)

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

I wish you great fun and no [frustrating bugs]. Oh yeah we all know where this will be going.

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

This round takes place at the same time as the "Red de Programacion Competitiva" marathon :(

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

I think that I love This contest

→ Reply
»
9 years ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

Actually although all problem statements in qualification and elimination rounds was in Russian two Japanese coders advanced to finals (rng_58 from third place and anta from 21st) :-)

→ Reply
»
9 years ago, # |
  Vote: I like it -8 Vote: I do not like it

Is the statement in Russian only?!?!

→ Reply
»
9 years ago, # |
← Rev. 2   Vote: I like it -22 Vote: I do not like it

the stupid one who saw he can't translate, to have upvotes i wish you can translate this comment ************

→ Reply
»
9 years ago, # |
  Vote: I like it -8 Vote: I do not like it

Problems will be in English? or not?

→ Reply
»
9 years ago, # |
  Vote: I like it -7 Vote: I do not like it

Excuse me if I am wrong, but this guy prepared for VK Cup Round 2 one easiest and two hardest problems? If he did than this is real intriging.

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

    I had some tasks and they chose the most interesting ones, that's it.

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

This is usual round, guys. Statements will be both in English and in Russian.

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

Thank you roundwriter! Can't wait to see this round! :)

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

Lets hope Errichto prepares a great editorial as well as a great round for us . In the past few contests he has helped a lot of guys through his insightful comments . ALL THE BEST :)

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

Hopefully, it won't be another Div 0 Contest.

And don't get fooled guys. It will be like last round. In last round, there was a "PPS" stating top 20 of div 2 will get t-shirt, even though they didn't mention it before contest. I guess they are taking things another level higher. Saying no t-shirts now and then giving top contestants t-shirts later :D

Or, they won't be giving any and I am just over thinking. I won't be getting t-shirt either way...

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

Guys, can you please tell me how can i add my school in my profile . Thanks in advance .

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

    Here: Your profile > Settings > Social > Organization

    (If I understood your question hehe.)

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

'Newbie' zone.... be prepared for me.... I'm almost there... ;_;

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

someone should make codeforces fantasy league ,just like fantasy premier league in football ^.^ ,we can bet on favourite coders to win the round

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

Bear Limak will cause us trouble...

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

Looks like something interesting will happen with the bolded problem scores

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

Why 1750 and 2750 written with bold font?

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

What is the real difference between the knowledge level of a Blue guy and a Red Guy ? ?

I think knowing more algorithms and more exposure to thousands of problems!

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

    They read a problem, and by the time they've finished reading the problem statement, they have the solution. That's the difference.

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

      Even we have a solution to 2-3 problems but when it comes to 4-5th problems ,atleast I do not have any knowledge about the paradigms! Obviously they are better than me but Even I solve every problem related to the scope I have! Same is with everyone !

      I feel like there is something more than that :P

      Because I have been coding since one year and yet blue :P

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

        They can visualize problems better. They are insightful , and can code bug-free in their first attempt .

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

          Bug-free on the first attempt... I wish.

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

      Don't forget to mention: Even a green coder can solve Div2/A immediately after reading. The real difference is the complexity of the problem between that a red coder and a blue coder can code immediately. :D

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

        And I guess that comes through exposure to algorithms and problems..

        Practice and lot of practice!!

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

          Yes, I think practising improve the level of your immediately solving ability. :)

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

Ohhh, nice div1 registrants list ..

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

Where rooms?

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

There is guy who is printing "YES" or "NO" (in capital) in Bear and Poker . I tried to hack his solution and it gave me unsuccessful hacking attempt.Why? Its written in problem we have to print like this: "Yes" or "No".

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

    ?

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

      "yes" and "no "

      are usually case insensitive

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

      I think Codeforces treats "Yes" and "YES" same and vice versa for "NO".I read it somewhere in comments sometime ago .

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

        It's not that Codeforces treats them similarly. Round writers are advised (I think they are) to use the checker which is case-insensitive unless they have strong reasons to have case-sensitive output. And most of the times this checker is being used indeed so (mostly) it doesn't make sense to hack such solutions. It should have been clear today that hacking "YES" <-> "Yes" doesn't make any sense since participant's solution passed pretests which would never happen in case of case-sensitive checker.

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

    There might be some lee-way. The fact that the solution passed the pretests should have made it clear that your hack wasn't going to work though.

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

I guess you should be awarded for designing the first anti-tourist contest ever! at least till now!

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

    The first? Are you serious?

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

      Previous record was 24, now it is 168 :)

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

        and when he was ~20, rating decrease was about ~130.

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

      Of course he's serious, did you look at your own link? Notice how tourist's worst performance ever is 24th and he came 168th this round?

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

        Yes, but I think AliB's comment was posted before tourist fail D, maybe I'm wrong. Anyway, you're right.

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

not able to hack

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

dreamoon_love_AA hacked my A. Feel so honored!

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

The problems are so nice, thanks for the contest!

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

I liked the problemset, but I've no idea how to solve Div1 D or E. Anyone want to share approaches?

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

I really hate when someones solution has overflow but when you try to hack it , it passes your test but is wrong and should give overflow in this test.
UPD : 12760657 it didn't pass the full tests.

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

    Also some guy fooled me with #define Int long long, lol.

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

      You shouldn't be fooled if you know that Int is not int

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

      I wonder if this is a common thing. I always use "typedef long long Int" but I've never seen someone else do it, at least from the competitors in my country :P

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

Was this contest easy or my skills have improved ?

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

Couldn't hack (or fail) because of lags at the end :( Div1 A-C look quite easy compared to other rounds. Though I failed to implement C..

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

This is the first time I solved A,B,C and had half an hour left. Thanks for that!

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

    D (div-1B) was super easy too. I've implemented seg. tree, but when I looked at the other solutions, I realized how stupid I was =)

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

      Just curious. What's your seg tree logic? Please share. :)

      → Reply
      • »
        »
        »
        »
        9 years ago, # ^ |
        ← Rev. 5   Vote: I like it +5 Vote: I do not like it 
        for (int i = 0; i < n; i++)
  b[i] = a[i] + i;
for (int i = 0; i < n; i++)
  c[i] = a[i] + n - 1 - i;

        For example if a equals to {2, 1, 2, 1, 2} then b and c will be:

        {2, 1, 2, 1, 2}     {2, 1, 2, 1, 2}
{0, 1, 2, 3, 4}     {4, 3, 2, 1, 0}
_______________     _______________
{2, 2, 4, 4, 6}     {6, 4, 4, 2, 2}

        Now let's build 2 segment trees using b and c to find minimum.

        It's easy to prove that:

        ans[i] = min(i + 1,
             n - i,
             a[i],
             minimum(b, i + 1, n - 1) - i,
             minimum(c, 0, i - 1) - n + 1 + i);

        And the result will be max(ans[i]).

        P. S. Yeah, I know, it's overkill ^_^

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

          Overkill or not, if it passes, its worth a try :)

          Actually, I don't see how your min(...) is so obvious. It took me hours to understand the problem setter's solution.

          edit: Instead of

          for (int i = 0; i < n; i++) c[i] = a[i] + n — 1 — i;

          why not just

          for (int i = 0; i < n; i++) c[i] = a[i] — i;

          ?

          And, min(...., tree(c,0,i-1) + i ,....).

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

    Check it again. Anyway Congrats.

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

Am I wrong or there were no -50 points if you submit a solution that fails on a pretest from problem's sample tests in previous rounds?

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

I pressed submit when there are still 20 seconds left but didn't submit my code successfully....... So sad T_T

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

    Same here. I tried to submit my code when there were still 15 seconds left, but the submission page didn't load. I just checked that my code was correct.

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

    And that code get AC....

    Edit: It' problem E T_T

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

The problem set was commendable for me, especially the idea of problem C. Cheers!

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

I was a bit late submitting div1 A because I didn't believe that it's that easy(specially after div1 A of previous round) and I must be understanding it wrong or missing something , anyone had the same situation?

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

    I had similar situation with div2 A but the constraints were too low and I got through.

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

    Yes. I questioned myself for 1 min.

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

    My first thought was that it was made this way intentionally — after all those complains which we saw several days ago: "People can't solve A and they ignore contest, their rating doesn't change — and I am losing rating with solved A".

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

    Lol no, A's are almost always trivial x_0.

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

I was trying something like dfs to detect 3 member cycles for Div2-B and finally the flat O(n^3) got AC Suffered 3 WA and around 1.5 hours :(.

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

So is this the first time tourist gets a three digit rank?

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

Can anyone please tell why my submission is giving runtime error? It is working fine on my local ide.

Submission link : http://mirror.codeforces.com/contest/574/submission/12757848

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

I was so glad by fast solving Div1A (3 minutes), but in result couldn't solve Div1B, though it is not much harder than Div1A:D
But really nice problems. Thanks!

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

What a contest? Tourist gets 3 digit rank, Petr only with 2 correct submissions until 1hr 45min. Kudos to the problem setter. PS: My personal opinion on the problem set is that it was very good. Since C was easy nobody would have ditched contest as a result of not solving any of them.

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

Some O(qn) solutions passed Div1 D, and one O(n2) solution passed Div1 E. I think more tight time limits for those problems are necessary.

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

    In D we didn't see any O(nq) with low constant factor and we wanted to pass (some solution with bitmasks).

    For E we had a O(n2) solution with many tricks to speed it up and it was still far from AC.

    Two big mistakes :/

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

That was a wonderful round. Fast Editorial and nice problem set.

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

Can problem B div.1 solve by divide and conquer too?

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

    I was thinking the same. Since the structure can be split on the shortest tower, given its height is less than its distance from the boundary, it looks like a D&Q problem.

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

I hope rating update is as fast as system test and editorial

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

maybe problemset was good but there is a big differece between a — b,c and d — e div 1.

→ Reply
»
9 years ago, # |
← Rev. 3   Vote: I like it +5 Vote: I do not like it

Hi,

Div2 B

can anyone tell me what's wrong with this solution? http://mirror.codeforces.com/contest/574/submission/12750750

Edit: one of my friends told me the problem... Using set.lower_bound() to search can lead to set.end() as the result which when I compare to a number can lead to false result. http://mirror.codeforces.com/contest/574/submission/12769046

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

I didn't like having to help a bear politician cheat in div 2 Problem A.

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

Could someone explain this code? http://mirror.codeforces.com/contest/573/submission/12760770

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

    I don't think that's something our mortal minds can comprehend.

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

    I guess he really is a machine like his username says.

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

    It's clearly a brute-force, but seems to be incredibly sped up. The first trick is alignment of the variables in memory (some variables are told to be aligned to 16-byte blocks) — it probably helps cache do its work more efficiently (less cache misses and so on).

    The magic part (inner loop) uses SSE (set of processor instructions which allows many operations to be done at once; why do 100 000 32-bit additions/shifts/comparisons when we can use 128-bit SSE registers to do only 25 000 operations?). You can probably decode what it does here. I guess one can write a simple brute-force and then "encode it" in terms of SSE.

    Still, a question to the author: have you worked for a CPU/GPU manufacturer?

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

      Is there a similar way to exploit SSE in Codeforces for other languages (I'm particularly interested in Java)?

      How much faster would C++ be compared to other languages for this problem?

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

        In my opinion, in Java SSE intrinsics make no sense (Java source code is compiled to Java bytecode which is then run by Java Virtual Machine; you have no access to JVM code, so you cannot optimize it by hand — for example using SSE code).

        I have no idea how other languages compare to C/C++. However, the fact is that many of them may lack support for the intrinsics and thus we won't be able to control the power of SSE.

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

      Actually alignment is required for SSE instructions to work.

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

      Thank you for your explanation. In addition, I think those techniques are not needed if our submission runs on 64-bit systems.

      I have not worked for a processor manufacturer, but I have a bit of experience of performance tuning on CPUs and GPUs.

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

Did author suppose that local optimization should pass in E?

→ Reply
  • »
    »
    9 years ago, # ^ |
    ← Rev. 3   Vote: I like it +1 Vote: I do not like it

    Sry, ignore that comment.

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

    Did author suppose that O(nq) should pass in D?

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

      :)

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

      those restriction seem to show that.

      → Reply
    • »
      »
      »
      9 years ago, # ^ |
      ← Rev. 4   Vote: I like it +11 Vote: I do not like it

      We didn't see any O(nq) solutions with low constant factor. All of them were far from AC. And we wanted some (which also had big memory complexity) to pass. It turned out to be a bad decision.

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

    I didn't.

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

It seems that the test data of E is really weak and should be fixed.

This obviously wrong solution of HYPERHYPERHYPERCUBELOVER passed 41 out of 42 tests, and the 42nd test is so small that it could be solved in O(2NN). (maybe it was added during the contest..?) He got accepted with the same solution with some minor modifications.

You can find more obviously wrong solutions which got accepted after the contest..

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

I hate to wait for rate; but it's late and it's my fate.

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

It seems that in problem C there are no tests with maximal degree 3 and answer NO: 12766417

But such test exists and is quite simple.

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

will i go with rank 108 div1?

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

    1689 not 1700 :(((((((((((((((((((((((( ;_; OH NO

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

Finally red!

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

    I know that feeling :)

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

    And at the same time a better rank than tourist , enjoy the moment :)

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

    So you joined quite recently and have become very good quite fast, could you give some background on yourself, like what age you are and so on? You obviously practice a ton, have so many solved problems having joined only 9 months ago. Anyway it is pretty inspiring to me what a lot of practice in a short amount of time can do.

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

      I'm old, I started when I was working on my masters thesis in maths since I realized that I weren't really qualified for any jobs and I didn't want to do research. But at least it shows that it is never too late to start programming!

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

Why the problemset and the gym are still blocked?

UPD working now.

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

Really nice problemset! Natural and short (but yet original) problems which were really fun to solve or interesting to know the solution :) Thumbs up!

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

screencast of the first AC in the contest (1:23, problem A)

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

Master again.

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

In future (t-shirt giving) contests, we could state that there will be t-shirts for div2 after the contest, in that way, there won't be div 1 people here, and div 2 guys can also have a chance to win t-shirts.

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

Мне кажется что это хитроумный план tourist-а, залажать на контесте. Что бы все снова начали о нем говорить, а то теперь когда он выигрывает никто не удивляется(он же Гена).

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

I tried to hack a solution of the problem C. It showed invalid input. Can someone help? Link: http://mirror.codeforces.com/contest/574/hacks/164504/test

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

    You print endl before the last number, instead of after it...

    For example, if n was 5, your code would produce:

    5
1 2 3 4
5
    → Reply
    • »
      »
      »
      9 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Oh thanks! But I tried using endl in the end also and still got Invalid input. Can you show me the code, how it should be?

      → Reply