NALP's blog

Codeforces Round #132 (Div. 2)
By NALP, 12 years ago, translation, In English

Hi!

A few hours later you're lucky to participate in Codeforces Round #132 for Div.2 participants, but traditionally the others can take part out of the competition. It has been prepared by me (NALP), Edvard Davtyan (Edvard), Vitaly Aksenov (Aksenov239), Gerald Agapov (Gerald), Mary Belova (Delinur) и Mike Mirzayanov (MikeMirzayanov).

Traditionally I wish good luck, accepted solutions and successful hacking attempts for you!

Especially, we want to wish grand results and good luck to all sportsmens, who are representing their countries on XXX Olympic Games in London!

Today it is decided to use dynamic scoring system. But the problems will be sorted from low difficulty to high by authors' opinion!

UPD: The Round is finished, thanks to all for participation! We hope you have got fun!

UPD: Congratulation to winners!

  1. yooo — solved all problems!

  2. zzy

  3. High_Rich_Handsome

  4. bookcity_clock

  5. capythm

UPD: Tutorial in English is published!

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

Comments Comments (40)
| Write comment?
»
12 years ago, # |
  Vote: I like it -9 Vote: I do not like it

good luck evryone!!!!!!!!

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

    why have -11 what said bad?????????

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

      Don’t try to understand negative votes on codeforces.

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

        pff 3ve qarTvelebi varT,axla naxeT Cem koments ra uqnan,-30 s avirtyam uceb :D

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

          mec qartveli var erti amati dedac avirtya -300 didi ambavi arc vici inglisuri kargad da verc vwer,aau ar gamigon es tore damblokaven :D

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

            mec qartveli var imedia mixvdit qartyvelebias shekrebaaa :D :D gache exla inglisurad davwer vitom ragac shriftit vlaparakobt:

            this is a shrift Iulia we talked shrift Iulia

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

      Massive anonymous trolling by scholars – common thing where negative voting is presented instead of accurate moderating.

      → Reply
  • »
    »
    12 years ago, # ^ |
    ← Rev. 3   Vote: I like it +17 Vote: I do not like it
    1. Typo "evryone": good luck everyone!!!!!!
    2. Comma: good luck, everyone!!!!!!!
    3. Capital letter: Good luck, everyone!!!!!
    4. One exclamation mark is more than enought: Good luck, everyone!

    But there is one more problem. What if every one of 2000+ registrants will leave a "good luck" comment?

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

Will the tasks contain something about the olympic games?

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

i am new on codeforces and how add blogs and also how add blog??

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

    for adding blogs click "start your own blog"

    for adding friend click on the star(next to handle)

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

When will the editoral be posted?

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

Very interesting problem set :).

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

Good problemset, nice competition , i was just surprised that task C turned out so difficult compared to task D, and they said the problemset will be sorted from low difficulty to high :)

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

About the Problem D.

Is testing guarantee ti < Ti ?

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

Contest 5^2 * 2^2 + 2^5 was great! Thanks!

Any Idea on Problem C?

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

    Editorial is ready. You can read it and you will know the idea of problem C -_-

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

      Ok thanks ;)

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

      can anyone please tellwhere i can find editorials for all rounds. it will be great help.

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

        here..But it is not updated of late

        EDIT-> Also apart from the last few rounds codeforces has added a new section named CONTEST MATERIALS on each of the problem page where the tutorial is given

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

Thanks for a very good round and problems

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

so quickly rating!

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

Are they going to post the solutions for the 5 contest problems? If so, where?

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

In problem D,why that greedy strategy is correct？

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

tutorial is not in english!!

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

    I think, it's in English :)

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

      I think you should replace the "ru" in the link by "com" :)

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

        Nevertheless, the language of the tutorial is English. Domain doesn't matter.

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

      By the way, can you tell me when will the solution of problem E be posted?

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

I have written the solution using C#

For B I got WA five times. And didn't get AC. After contest I found that when printing double type value the decimal point is replaced by comma on Codeforces. But it worked fine on my PC.

So whats the problem? How to print Double type values using C#? If my code is right why should I be the looser?

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

    You can use value.ToString(CultureInfo.InvariantCulture), or if you don't trust Mono or forget it, use value.ToString().Replace(',','.').

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

Can anyone prove why only the end points (1bus or min. # of bus with no compensation) lead to the optimal solution ?

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

    Let's define fi(c) as number of rubles, that we will spend in i-th region if c children will be in the hot bus. .
    where . This function is linear, if we omit ⌈⌉. So it reaches it's extreme values on the boundaries of the definition range. So we must check only fi(1) and fi(m). Also, we must check with no additional costi for the hot bus.

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

why There is Big Time-Gap between two Div1 Contest ? Div1 users are So Bored !

→ Reply