Gerald's blog

CROC-MBTU 2012, Final Round (Online version, Div. 2)
By Gerald, 12 years ago, translation, In English

Good day!

For technical reasons, we've decided to move the start time of the online version of the round. Online version will be held as separate competition CROC-MBTU 2012, Final Round (Online version, Div. 2). Please register for this competition.

This round will be usual rating round for the Div. 2 participants.

UPD. The online version of the round will come soon. Let me remind you that this contest will hold by usual Codeforces rules. The score distribution is 500-1000-1500-1500-2000.

Enjoy contest!

Announcement of CROC-MBTU 2012, Final Round
  • Vote: I like it
  • +59
  • Vote: I do not like it

Comments Comments (70)
| Write comment?
»
12 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Any difference between CROC-MBTU 2012, Final Round and CROC-MBTU 2012, Final Round (Online version, Div.2)? Can we participate both? Will both rated for Div.2?

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

    No, the first one will be local competition.

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

      .

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

        Firstly clarify which one are you talking about .There are 2 contests here:

        Final Round — There is no self registration allowed in this. So if you cant register on your own , there is no scope to unregister .

        Online Round — If you are talking about this ,then find yourself in this page [link] and click the cross symbol.

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

I wish it could be rating for Div.1 participants ...

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

    Sorry ... I made a mistake ... It seems also being rating for Div1 ....

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

      Actually it seems that is going to be rated only for Div2 contestants.

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

Is it a school competition?

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

Problems won't be same,will they? And,will borh contest be rated?

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

is the contest OPPA ACM ICPC STYLE ?

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

No email has been issued for this rated div 2 contest.

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

How many problems?

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

    If they follow a parallel structure of the contests, there should be 8 problems, as many as in the qualification round.

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

      In the qualification round there were ACM-ICPC rules, but today there will be Codeforces format.

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

        have a nice exam and successful hackings :D

        wish you high ratings

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

Wow Amazing system testing speed.

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

Wow Very fast judging!!! :)

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

ORZ.I make a lot of mistakes...I'd better go to sleep...

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

Very fast!!!

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

so quick testing!! thanx! )

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

Wow! What a fast system testing!!! :-o

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

This was an ideal contest ..

Nice and clear problem statement , no problems in server , good compilation of problems and above all extremely fast system test.

Btw , why dont they use such system testing in normal rounds ?

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

    System test is faster because the number of participants is low.

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

Very quick system testing! Less than 5 minutes!

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

Could have solved all the problems for the first time .... forget to use long long for the last problem and the output overflowed... sign... T^T

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

In CROC-MBTU 2012, Final Round (Online version, Div. 2), I try to slove 250B - Restoring IPv6, wrong on pretest 1, but I'm sure my output is the same as standard output, can anyone tell why it happend? Submission link here : 2660795

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

    Python's interpreter also agrees with ya

    "a56f:00d3:0000:0124:0001:f19a:1000:0000"=="a56f:00d3:0000:0124:0001:f19a:10 00:0000" True

    :D

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

      You print something like '\0', such symbols are not shown in web pages, but your program really outputs them.

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

      But I don't know which symbol print....

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

        You output '\0' or something in printf("%c", s[k]). j can be equal to s.length(), and k can be equal to j.

        edit: oops I didn't notice your blog post

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

    The puts ("") looks suspicious to me.

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

nobody hacks succesfuly. lol

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

can anyone explain why TLE for pretest2 in problem B ?!??? is it a problem with I/O ?

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

    It's a case like "::a56f:d3:0:0124:01:f19a:1000" or "a56f:d3:0:0124:01:f19a:1000::"

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

      My implementation successfully and in time!! passed these test-cases, i think something's wrong with problem B!

      http://codeforces.me/contest/250/submission/2662494

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

        It give WA for this input.

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

          yes you're right, it's WA but not TLE ! I modify my code and now it's true but again TLE.

          (there are about 50 submissions for this problem with Time Limit error)

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

      It can be say Wrong Answer in worst case, but "TLE" doesn't make any sense at all for this problem !

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

        Try to debug your program with that test case and see on which line your program loops in an infinite cycle.

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

wrong answer 1st lines differ — expected: 'a56f:00d3:0000:0124:0001:f19a:1000:0000', found: 'a56f:00d3:0000:0124:0001:f19a:1000:0000'

why???what problem at B???

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

Problem D should have had more points, as of this moment C solved by 467 persons where as D is solved by 150 people.

Dynamic score distribution may have been a better option.

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

rating still not updated :/

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

PLEASE HELP!!

My A solution is still not Judged!!! While the contest is already over and the rating got calculated my solution is not Judged and I didn't get its points!!

check this image http://www.shabmasry.com/uploadscript/images/Untitled-jbaaurg.png

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

qwevlad This handle is a cheater.

He provided 1 hack for serg_pet and 2 hacks for IVLUKR.

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

I look forward to the editorial / contest analysis to be published soon for this contest.

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

Can anyone tell me how to solve Div 2 Problem C. ???

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

    First, you should minimize the sequence and eliminate the consecutive duplicates. e.g. For Sample 1, change

    1 1 2 3 2 3 3 1 1 3

    to

    1 2 3 2 3 1 3

    This can be done in O(n)

    Then for each number, if the two numbers beside it is the same, then excluding this number will get 2 fewer stress; otherwise, there will be only 1 fewer stress.

    For the first one and the last one, excluding these two numbers will always get 1 fewer stress.

    So excluding 1 will get 3 fewer stress;

    excluding 2 will get 3 fewer stress;

    excluding 3 will get 4 fewer stress.

    This can be done in O(n) again.

    Since excluding 3 can get more fewer stress, answer is 3.

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

    Also remember that the genres are 1-index based, while you are likely dealing with 0-based array indices.

    → Reply