Блог пользователя burakcetin

Best Sample Test Ever!
Автор burakcetin, 10 лет назад, По-английски

I love the sense of humour in this sample test!!! Tell us your hack inputs. Mine was:

2

hacked

hack

  • Проголосовать: нравится
  • +110
  • Проголосовать: не нравится

»
10 лет назад, # |
← Rev. 3   Проголосовать: нравится +24 Проголосовать: не нравится

In our local contest we recently had a problem with sample tests like this: From Russian it's translated as: problem e is not that simple

obvious idea wont get AC

spoilers arent good

→ Ответить
  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +11 Проголосовать: не нравится

    I wish I sometimes clicked on "Preview" button before sending comment. Anyway, done can't be undone.

    → Ответить
  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Hmm.

    How hard was problem E?

    → Ответить
    • »
      »
      »
      10 лет назад, # ^ |
      ← Rev. 3   Проголосовать: нравится +3 Проголосовать: не нравится

      Time limit: 2 sec

      Memory limit: 256 MB

      Jury wants to present an analysis of contest to its participants. In contest there were n problem rated by difficulty from 1 to 5. Jury knows that an analysis makes participants tired, so they want to minimise their total tiredness after an editorial. Let's call tiredness from an analysis of problem rounded down halfsum of tiredness from analysis of previous problem and difficulty of this problem. More formal, t(i)=floor((t(i-1)+difficulty(i))/2). Now, jury wants you to put problems in such order that tiredness of participants after analysis of the last problem would be minimal.

      Input: On the first line there is n (n<=100) On the second line there are n numbers indicating difficulty(i) (1<=difficulty(i)<=5)

      Output: Expected sequence of problems in analysis

      As you can see, problem isn't that easy, but sample tests were like that: So there were about 30 participants who just sorted given sequence despite warning in problem that I mentioned in my previous comment.

      P.S. You can submit your solution here if you have one: http://contest.uni-smr.ac.ru/en/problemset/5962/ (site isn't fully translated, but "submit" is in English. You also need to register)

      → Ответить