Berezin's blog

Codeforces Round #220 (Div. 2)
By Berezin, 11 years ago, translation, In English

Hi! Soon Codeforces Round #220 (Div. 2) will take place, i am the author, Dmytro Berezin. This is my third round and Sereja still hopes, that this is the last :)

Everything changed since last round. Dima and Inna have thought about their behavior and asked Sereja to excuse them. They are good friends now. You should make the family happiness even stronger!

Thanks to Gerald Agapov (Gerald) for the help in round preparation, Maria Belova (Delinur) for tasks translations, Mike Mirzayanov (MikeMirzayanov) for perfect system, and Sergii Nagin (Sereja) for his agreement (not to post here another photo) to help in testing.

Points distribution will be. 500-1000-1500-2000-2500. Here we go :)

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

Comments Comments (136)
| Write comment?
»
11 years ago, # |
  Vote: I like it -123 Vote: I do not like it

Disvoit me, please.

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

    доминируй, властвуй, унижай :)

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

    why people ask this kind of stuff?

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

      I think, thay like decreasing their contribution.

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

        nope.. i don't think that is the reason.. i think that they (by mistake) left their account logged in somewhere and someone else posts this to cause their contribution to drop...

        however, i may be wrong...

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

      It is a kind of online fetish :)

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

      because they're troll :D

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

    What the hell does "disvoit" mean?

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

      means clicking on the arrow pointing down

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

        No. That's "downvote". "Disvoit" is not even a word.

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

    Give me a reason, please @@

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

translate statements via Delinur not Google translate!

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

Hope that the translation of problem statements will be good so that we can understand the problems. :)

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

plzzzzzzzzz make the statement clear enough to understand

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

Hope understanding the problem will not take too much time then solving.

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

Waiting for the interesting problems:)

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

There is a little mistype : рфму→have :)

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

The last ?..It's time to say "good bye"??? Best wishes...This round no div1.maybe it is a difficult round,I think...and I hope every one will get a high rate...

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

wish everybody will the best

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

Points distribution will be.

Oh, good! I was worried that it would not.

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

    Well, sometimes it isn't. Not before the contest, at least :D

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

    I remembered there was one Codeforces round they wrote

    Points distribution will be 500-1000-1500-2000-2500-3000

    or something like that, to indicate that there are 6 problems (instead of usual 5).

    Which means there will be no problem on today's round :p

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

Good Luck!!

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

2 minutes remaining and still "Points distribution will be."
I think it will not be

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

Is this contest actually intended for "Div 1 only?"

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

Ridicule contest... I really hate it! Problems could be for div1 !

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

    At least first two problems are very easy and can be solved by everybody.

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

      What do you mean by "very easy and can be solved by everybody"? If you mean that there are sumbissions from all colors/divisions, then yes, but to qualify them as being "very easy" when a lot of red/orange div 1 guys fails pretests, I think it's not the good expression. Just by comparing with statistics from previous contests, it seems obvious that this one is one of the hardest div 2 contest. ( yes, I'm vexed to not solve B and C :D )

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

        Thanks God! Contest is unrated!!

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

      The standings prove you wrong. Problems 1 and 2 have a lot of WA and hacks, even among high-ranked contestants. Problems 3 and 4 seem much better in that regard, and 5, once again, contains a lot of tricky situations that could lead to WA. The optimal strategy here seems to be "just pass pretests and farm hacks"...

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

        They just said that author's solution for problem B is wrong. That's the reason of so many WA.

        BTW, my statement is correct, problems can be solved by everybody, but pretests cannot be passed :)

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

          I guess it is true in that sense :D

          Still, A was also far beyond the expected level of difficulty.

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

            Yeah, A is easy, but I didn't think carefully. After I saw "pretest past" I moved to the next problem. When the test was about to end, I was hacked and I instantly found the bug, but that was too late...

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

          Oh, sorry, I know why I found the second problem harder than it was really: I was thinking we could do such operations: 243 -> 63 -> 9 :/

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

This round should have been Division 1 only.1 hour and 22 minutes passed and problems:

A) Инна и розовое пони x489

B) Инна и девять x202

C) Инна и Дима x112

D) Инна и последовательность x37

E) Инна и пупсики x2

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

Is this contest?

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

I think the problems are much harder for Div 2 contestants:(

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

A great round I will remember forever!

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

is it too hard for div 2 contestant?

there is less than 1000 that solve problem A...hahahah

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

    I thought problem A was not so much hard as it was very easy to make a minor mistake. For example my code was failing things like "1 5 1 3 1 1" for a long time because I forgot to account for when there is no move available from the first position. After I "fixed" that it failed things such as "1 5 1 1 1 1" because I was saying there is no move available from the first position, thus we should output "Poor.." :) Probably explains why many fast solutions are being hacked.

    edit: and apparently my solution failed systests regardless :) Another silly error.

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

I realised that author's solution to problem B is wrong when I tried to hack someone with the test case "18181". It should print 3, but author's answer is 2.

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

    Thanks for the spoi1er!

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

      The round is unrated. You can ignore the comments if you want.

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

contest is unrited now (i don't know it is good or not) .

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

Is the round going to be UNRATED???

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

Unrate...What a pity, even I was zero AC.But thanks for the problem writer :)

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

In problem D i keep a deque and just delete an upper_bound() ammount of elements from the front of the queue. Will anybody PLEASE tell me where i'm wrong i've been trying to find a bug for the past 40mins. I mean the source code is only like 30 lines long. Or perhaps that task also has an error?

Here's my submission (won't be available until after the contest) http://codeforces.net/contest/374/submission/5465516

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

    i did same thing... after that, i realized that it was a mistake...

    the question should be more clear... it is not deleting first k elements but is deleting the a1'th, a2'th, a3'th .. ak'th...

    i realized this only at end of contest and didn't have time to code in the answer..

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

      THANK YOU!!!

      it did seem a bit easy for D problem.

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

        You're welcome...

        However, IF, for instance the problem really was on the basis of removing first K elements, i'd not use deque since its still too time consuming (in worst case) since deque removes only 1 element at a time...

        Instead, keep a normal (statically declared) array, a start pointer and an end pointer...

        int w[2000000];
int *start = w;
int *end = w;

void appendValue(int i) {
  *end = i;
  end++;
}

void popFirst(int k) {
  start += k;
  if ( start >= end ) {
    start = 0;
    end = 0;
  }
}

        that'd be more efficient for handling such a case... however, the problem was different so even this wouldn't apply...

        :)

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

        When I first read problem D I knew I can do it, but unfortunately it also tricked me into thinking about a deque. I didn't implement that because there were parts of the statement which didn't make sense to me (eg. "If number a1 is larger than the current length of w, then nothing falls out of the sequence.") in this interpretation. Now that I know what the problem is all about, I think something like a Fenwick Tree might do the job. Maybe is even simpler, but that is the first thing that came to my mind when I saw jaybosamiya's above comment.

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

Oh my god!

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

I wonder what are the codes that actually got accepted for problem B under the bad judge doing ......

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

    I think they multiply the result by 2 for every block like "181" or "18181".

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

      Should we multiply by (LENGTH + 1) / 2?

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

        yep... for all the length's which are odd, multiply by (length+1)/2...

        not sure what the author did......

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

          when i say odd or even, i am talking about 18 having length 2 which is even and 181 having length 3 which is odd and so on... some others are using a slightly different notation... do not get confused...

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

        Yes, we can prove this by induction/recursion (though probably an easier way). When length is odd, clearly there is just one way. When length is even, we need choose (length)/2 dots from a list of (length) dots such that no two are consecutive. Say there are a_n ways to do this for string of length n. If we choose the first dot, we cannot choose the second dot, so we must now choose (length-2)/2 dots from a list of (length-2) dots. Thus a_n=a_(n-2)+1. Easy to see that a_2=2=2/2+1, so a_n=n/2+1 for n even.

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

      Ignore. (Previous one is wrong...)

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

        i didn't understand why they says "Most of the solutions that have passed the pretests are not correct",when there is easy testcase :(

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

      This is not the case; I submitted such a flawed solution but failed pretest 12.

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

Hats off to author..you really succeed to make the worst contest ever.

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

    I know the contest was hard, but still, no need to be so harsh against the authors. At least the contest was interesting. I am sure they worked really hard to create these problems. I hope the authors will host contest again, and hopefully an easier one.

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

      i hope so too... i hope they will host it again and (preferably) easier with no mistakes...

      however, i'd like it if the wording of the contests was improved a little (for example in problem D, it took me forever to understand even though I am actually very good at English)

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

Turns out that indeed it is not.

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

I think the be worst thing is the author's mood...The last round,but without give us a good impression...

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

only 400 accepted codes for problem A! (before system test)
It seems that it was a Div 1 contest!

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

I'm disappointed in the writer :,-(

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

this contest was very baaaddd!!!!!! shit............I hate that

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

the first round I did well and it's unrated @@, poor me

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

It was an extremely difficult contest for division 2 in my opinion, though A and B were certainly doable given enough time. I wonder what author's flawed solution to B was — it seemed like a relatively simple problem (my method was to find blocks of consecutive numbers that could be 9s [e.g. 818 is a block of 2, 7272727 is a block of 6, etc.]. If this block is odd length obivously there is only one way to get the maximal 9s, but if it is even you can select any length/2 numbers that are not adjacent. So for example 81818 is block of 4 so there are 3 ways, 818183333381818 is two blocks of 4 so there are 3*3=9 ways — unfortunately I spent too much time on D and didn't finish implementing this), though still hard for a div2B.

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

    I tried using dp. But got WA. Then I switched to exactly what you said. Finding blocks and multiplying to get result. Well, that got WA too. Let see if it passes after rejudge.

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

      Passed. :)

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

      LOOOL I did exactly the same thing, however my first dp solution passed after rejudging! :D

      → Reply
»
11 years ago, # |
← Rev. 3   Vote: I like it -6 Vote: I do not like it

.

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

Mistakes happen... Let's try to be a little more forgiving :)

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

http://tinyurl.com/worstdiv2ever

Seriously?!? In A it was easy to make small mistakes, and definitely not a division 2 500 points problem; B was buggy (but it was interesting); C took at least 150 lines to code; D and E were out of the book problems. How is this supposed to be an 'have fun' contest?

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

please dont write worst contest because everyone know

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

Let's all calm down a bit. The authors work very hard to bring you these problems for no cost whatsoever, something is hardly an easy task (try writing 5 quality problems with solutions and pretests yourself, ensuring no possible errors, and see how it goes ;)). Simply because one problem happened to be flawed this time around (out of many many contests that went perfectly smoothly) hardly means that we all need to form a lynch mob. Life goes on — wait another week or so for the next one. If you are truly deserving of gaining rating, you should be able to do so over the next contests anyway, so if you would have otherwise gained rating take solace in the fact that you'll be gaining it again soon.

(This is not to say that rolling out a bugged contest is acceptable, but once in a while something is going to slip through the cracks. It's not worth getting too upset about — you just try to minimize it and move on)

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

    "With no cost whatsoever" is a common mistake — actually, you get paid for making a round, on every serious contest site.

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

      By my statement I meant no cost to the participant (except perhaps ad revenue generated or something, though I've never seen an ad on Codeforces). I am aware that the problem writers are generally paid for the round problems. But thanks for pointing it out, it is an important thing to know.

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

I totally agree that this is a very hard contest for Div 2. But I'm also disappointing to see all of those words you used to offend the author. Perhaps less people will be interested in making new rounds after such things happened.

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

    Seeing how div 1 coders did ( or even red coders ) this is not even a usual div 1 contest. Is not to disappoint the authors, but they have to have some kind of sense of what difficult is and what is the suitable one.

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

      I think they always try to choose the most suitable ones but mistakes sometimes just happen. And it's not "have to" but "should". Do you pay something for these contests? If you do then you have the right to ask for what you expect. Otherwise, accept it and give positive feedbacks to make it better.

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

        I agree with flashmt, guys you should be really more considerate than this! Don't you ever make mistakes?!

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

        What a fabulous solution of your task D !!!
        I've learnt a lot from your code, thank you !!!

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

        Okey, so you say that we should just accept everything and say: Wow, what a great contest!.. I don't pay for these contests, but they(authors) are paid to write the contest, if they are not able to produce good tasks,no one forces them to write them. And remember that 'we' (everyone) make the contests possible, the crowd that is present makes everything realizable, interesting, fashionable.What you say, to tolerate small mistakes, is of course correct observation, but how many times has a similar thing happened before? Look at the scoreboard of today's contest and see how many people solved A, B and so on, respectively, and tell me if it makes sense to you.

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

          "How many times has a similar thing happened before?" Alright, I have been on Codeforces since its first days and I think I know this better than you do. There was worse time when 2 consecutive contests went unrated.

          If you find the problems not suitable for you, no one forces you to join. And if you are not clear about what I said, I didn't mean to support this kind of contest but to tell you guys to be more considerate in your comments. Using that harsh attitude doesn't make the problems solved faster.

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

How unfortunately it is one bad Div.2 round and how fortunately it is one unrated round!

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

What is solution of D. I think it is balanced binary tree.

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

    I think it's solvable using a BIT or a segment tree. A Balanced Binary Search Tree might also be an option but the code might get long.

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

ONLY 150 accepts for A...
900 Participants with zero score....
UNRATED contest...
=))))))))))

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

My final rank is 40th , and the contest is unrated !! How pathetic.. :(

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

if someone is looking for a tricky case on A, try this; 5 1 3 1 1 1

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

my AC code (5465232), get wrong answer on this test case:

input: 3 3 1 -1 3 -1 2 2 1 1 3 1 2 -2

my output: 1

correct output: 2

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

    when your submission status is "accepted" this is not mean that your solution is 100% correct,but you can say that with high probability your solution correct, so this is not mean that there was some mistake about authors work.

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

      I'm quite sure the grandmaster knows this :) He's simply pointing out an error in the strength of the testcases.

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

The comments are really harsh! Guys you should calm a bit! The contest was really interesting and I really liked the problems (and just so you know this is not my normal attitude!), despite the problem B, the contest was perfect!

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

Ufff. A very tough round...

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

For Problem D,

I preproccesed the M integers and then trying to remove elements from deque.

From amortized analysis this algo should take O(N) time.

But i am getting WA. Here is my submission: 5469909

What am i missing ??

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

The round was quite hard, but I guess it still was fun for me.

Thanks author!

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

Round statistics,
93 of 2690 successful attempts for A (500)
75 of 494 for C (1500)
24 of 165 for D (2000)

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

Nice challenge round ! I love it!!! When I had submitted problem A , I locked my solution ASAP . And I even challenge the whole room! What a success!!I was very happy.

Well , it's really a pity that the round is unrated. I believe that the naive mistakes of B can be prevented. Please pay more attention to check the problem-set and solutions next time.

Whatever , it's a really nice Div 2 round ! I am wondering if I can set a nice question as problem A and D.

Thanks.

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

I thought in 374C - Inna and Dima recursion will cause stack overflow and I used my own stack. However, after the contest I found solutions on the top of standings simply use recursion. I copied those code and tested. Those code did RE on my windows 7, but they didn't in the "Custom test" in Codeforces. Why? This is my input generator:

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int size = 499; // or 999
char str[size][size+1];
const char *dima = "DIMA";
int main(){
    freopen("cout.txt", "w", stdout);
    cout << size << " " << size << endl;
    for(int i = 0; i < size; i++){
        fill(str[i], str[i] + size, '?');
        str[i][size] = '\0';
    }
    int k = 0;
    for(int i = 0; i < size / 2; i += 2){
        for(int j = max(i - 1, 0); j < size - i; j++)
            str[i][j] = str[i+1][j] = dima[k++ % 4];
        for(int j = i + 1; j < size - i; j++)
            str[j][size - i - 1] = str[j][size - i - 2] = dima[k++ % 4];
        for(int j = size - i - 2; j >= i; j--)
            str[size - i - 1][j] = str[size - i - 2][j] = dima[k++ % 4];
        for(int j = size - i - 2; j >= i + 2; j--)
            str[j][i] = str[j][i+1] = dima[k++ % 4];
    }
    for(int i = 0; i < size; i++)
        cout << str[i] << endl;
}
→ Reply
»
11 years ago, # |
  Vote: I like it +70 Vote: I do not like it

Well, the round was unrated (however, nothing unusual for Div. 1 coders). I have wasted a plenty of time thinking where my B solution can be wrong... Mistakes happen and contest authors have to be very cautious about their tasks. However, I don't agree with people here who are complaining about the contest. I am not sure if everybody is aware how much work you have to put to prepare the contest. So only Berezin can be really sad, that this round was unrated. We just had some interesting tasks we haven't seen before (and we have them in problemset). I hope that Berezin won't give up making contests here :) I would really like to see your contests (maybe more Div. 1 contests because they are so rare). Thanks for the contest, Berezin.

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

    Yes. Had Problem B been correctly judged, this would have been a very interesting and involved Div 2. Even the simpler problems were tricky for high-rated coders to falter. I was happy to be a part of it and am not too worried that it went unrated although I would have loved it to be otherwise

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

    I agree with you.

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

Why Codefoces system stack is so huge 268435456b (256 MB), unlike Topcoder 8 MB ? http://codeforces.net/blog/entry/79 http://community.topcoder.com/tc?module=Static&d1=help&d2=generalFaq

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

    8MB stack size is default on many systems, so it's just left that way often. 256MB (limited only by memlimit) is a good choice in contests, and it's usually set that way when the people in charge realize that it should be done.

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

tutorial maybe ? i'm interested in A and B

btw, even if the problems are hard (that's what most people says), no need to get mad, just laugh it off, do yo want to stuck in div 2 forever ? always solve easy problem ? I want someday, i can solve problem that as hard or harder than these :)

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

!

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

Why such a hula-boo ? The author/writer have given many good contests in the past, why to forget that? It is unfortunate that problem B had some mistakes and the round went unrated. By the way the problems were nice, but were little difficult for div2 coders. Div 2 coders must understand that though difficult,we must have to solve it someday to become a better coder. So please stop cursing and lets work around to solve these problems in practice.

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

when will the tutorial come for this contest?

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

I think next contest — simple contest. :)

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

guys help me , what's wrong in my solution ? 5474891

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

can somebody help with my tle verdict in problem c http://codeforces.net/contest/374/submission/5475238

i am following the way given in editorial using dfs with memoised tables

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

how can i find complete test cases of problems?(exp: problem D, test 63!:D)

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

This contest is bad ,but the problems are really good.

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

Is there any way we can get editorial of GYM problems because it will help us a lot in solving the problem?

→ Reply