I_love_natalia's blog

By I_love_natalia, 12 years ago, translation, In English

On April 6th, III (XIV) Volga Region Open Team Student Programming Contest was held in Samara State University. And now, we invite everyone who haven't already participated in the championship to join the Codeforces training contest version on April 28th (11:00 — 16:00 MSK, UTC+4). We believe that participants of any level will find problems that will be interesting for them. The contest will probably be mostly interesting to participants with violet and orange levels (difficulty is 4 stars).

This contest uses ACM ICPC rules. Use text files input.txt and output.txt instead of stdin/stdout.

Please, do not use the Internet, prewritten code and other sources: participants of the championship could not use any of these.

Contest was prepared by Dmitry Matov (Nerevar), Constantine Drozdov (I_love_natalia), Andrey Gaidel (Shlakoblock), Elena Rogacheva (elena), Sergei Shteiner (steiner), Dmitry Novikov, Alexander Efimov, Gennady Gutman.

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

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

Will the problem be in English or Russian?

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

I wonder why there is 2 extra minutes

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

    At the contest (in Samara) technical hitch occured, and the jury decided to add 2 minutes.

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

This 2 minutes can be useful to the Samara's contestents.

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

    Actually, last Accepted in Samara was at 4:59:48.

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

Knowing where to start reading the problem is a good skill used today :)

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

    I totally agree with you. Stories don't make much sense but the problems are good. I really enjoyed the contest :)

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

pva701 and mexmans, your solutions of F are incorrect. Both of them fail on this test:

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

    I still don't clearly understand the task in F. Do we start with the letter z or a random letter of the latin alphabet. At each step are we allowed to replace only the letter 'z' or any letter in the text?

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

      We start with letter 'z' and each step we replace any letter 'z' in the text with the pattern.

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

Can anyone explain the sample of Problem B?

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

    I think the answer of the sample is 19 as the problem describes

    • »
      »
      »
      12 years ago, # ^ |
      Rev. 2   Vote: I like it +8 Vote: I do not like it
      At the beginning:      00000 00000 00000
      After query 1 (1 6):   11111 10000 00000 (+6)
      After query 2 (4 8):   11122 22200 00000 (+5)
      After query 3 (2 7):   13322 22200 00000 (+2)
      After query 4 (10 12): 13322 22204 44000 (+3)
      After query 5 (7 13):  13322 25554 44500 (+4)
      6+5+2+3+4 = 20
      
»
12 years ago, # |
  Vote: I like it +11 Vote: I do not like it

No offense. The statement in english is quite confuse.

  1. In problem D, all the number should be 'non-negative' not 'positive'. And in input description, M should be the number of 'portions' not 'days'.

  2. In problem J, the range of U,

    Unable to parse markup [type=CF_TEX]

    is wrong.

Especially for D, the confusion and rejudgement drove me crazy for quite a long time.

Anyway, preparing contest is a huge and tough job, we can never ask for a perfect contest. Thanks for this contest. These two gyms really delighted my weekend. :)

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Как решать B?

How to solve B?