Gerald's blog

Codeforces Round #145 (ACM-ICPC Rules)
By Gerald, 12 years ago, translation, In English

Good day, Codeforces!

I can't wait to give you a good news that a new competition for div1 participants is appeared in the list of events. This competition is a broadcast of the Saratov Team Olympiad on Programming and therefore will be held by the ACM-ICPC rules. Especially for div1 participants, we complicate this school competition a bit, so that everyone was interested to solve the problems.

This Competition is individual, it will be rated for both divisions.

Please note that the start time of the competition is different from the usual. Also note the unusual length of the competition.

See you at Codeforces Round #145! I hope that everyone will find the time to participate in the competition.

UPD. The competition finished, the editorial will come soon.

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

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

I don't understand why there are so many negative comments about the time. This contest is a translation of the real competition for school students in Saratov, and it will be held at the same time. So the time can't be changed. If you can't participate, because you go to school and so on, you can solve a virtual contest later.

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

-

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

x( i'm at school too beside there is no point in virtual contest :((

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

I don't know what about others but for me the time is so lucky ) thanks.

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

Can anyone tell how many problems there will be for div-2? I haven't ever participated in a 3:30 long contest in Codeforces before so i do not know... Thnx..

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

    I think the author will update the number of problems in both divisions right before the contest.

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

That's a great idea...

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

It'll take place at 4AM here in Brazil. But, I found time to participate in the competition, it's a good way to learn.

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

What is it mean ACM-ICPC rules? I can't find about ACM-ICPC rules. Can you explain or give a link for me please?

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

    Here ACM-ICPC rules means, there will be no pretest or pending submission. You will get "Accepted" or "Wrong Answer" as a verdict right after submission and it will be final.

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

      But the Duration of contest or Number of problems may differ from usual. :-)

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

Why durations of div1 and div2 are different? (div1 2h, div2 3.5h)

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

    Sorry, i haven't see previous post. I know it now.

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

Will the problems be sorted according to the difficulty?

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

Love it..

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

I hope this will be a good practice session for the upcoming regional in my country next month :)

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

Can someone explain me why need big time,

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

Nice contest. It was worth waking up early.

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

Is this contest rated?(I believe it's rated contest)

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

    "This Competition is individual, it will be rated for both divisions."

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

I skipped my class to play in the contest. XD!!!!

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

Contest is over now, but I still can't see the solutions of other participants. Kindly fix this.

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

I need upsolving. pls be fast

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

Eagerly waiting for the rating to change....why is it taking so long today :(

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

:-w

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

i can't view others submissions nor has the rating changed , why is it taking so long

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

The problem E can be modeled as Minimum Arborescence.

But I used to know the algorithm of it is O(VE)...

With nothing to do at last so I write one for a try...

But to my surprise it passed...

And I found the actually complexity of that is indeed O(E logV)....

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

Will there be an editorial ?

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

Could someone please tell me how to solve Div.2 H / Div.1 D problem Merging Two Decks?

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

Many solutions to 240E - Road Repairs are wrong including mine. wuyiqi told me a test: 3 3 2 3 0 1 3 1 3 2 1

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

    It is guaranteed that there is not more than one road between the cities in each direction.

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

      I think there can be two roads between two city while they are in different directions.

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

        Some pairs of cities have monodirectional roads built between them.

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

          Many solutions to 240E — Road Repairs are wrong including mine like this: 4 4 1 2 1 2 3 0 3 4 1 4 2 0 mamy solutions output -1.but the answer is 2 1 3

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

Hi A short-solution programming contest will hold on October 24 at gpac.blog.ir For more information go to the link.

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

I'm still waiting for your editorial :(

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

Will there by editorial for this contest?

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

How's the editorial coming? I'd love to read something about E ;)

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

I found the tag "greedy" after I solved problem E in O(V+E). Is it true that there is a correct (not accepted) greedy solution for this problem? How? I hope someone or the editorial would tell me something about it.

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

    try 3 3 1 2 1 2 3 1 3 2 0

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

Could you please upload the editorial ?

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

How's the editorial coming?

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

i don't think the statement of problem e satisfy the truth.

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

There is no editorial until now !!! :/ Will it be published ??? Or already published in any other blog ???

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

Why am I getting a TLE on the 1st test case

http://ideone.com/0PewNN

Please help

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

Can anyone tell me how the answer for "Cinema" for this test case is 0, 2: 100 1 1 2 ab 17 0 0 0 0 0 0 0 0 0 0 0 2 3 4 5 6 7 abb 1 2 The 1st movie need not contain his favorite actor hence I think the answer is 2, 2. Pls. help

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

I like this contest 52150518:)

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

my AC code(cpp):52150518

→ Reply