Reminder: in case of any technical issues, you can use the lightweight website m1.codeforces.com, m2.codeforces.com, m3.codeforces.com. ×

Tima's blog

By Tima, 21 month(s) ago, translation, In English,

Results.

Problem statements.

You can submit the problems in this group.

Bronze  ≥ 206 points.

Silver  ≥ 301.

Gold  ≥ 371.

Upd. Thanks to the new updates, now tasks are available in IOI format. Almost all solutions are rejudged, except for the AC solutions. For some reason I can't rejudge them together.

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

»
21 month(s) ago, # |
  Vote: I like it +10 Vote: I do not like it

What about un-official participants ?

»
21 month(s) ago, # |
Rev. 2   Vote: I like it +2 Vote: I do not like it

..

»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

Can you give the problems?

»
21 month(s) ago, # |
Rev. 2   Vote: I like it +12 Vote: I do not like it
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +9 Vote: I do not like it
    Are these observations true and sufficient for solving treearrray?
    • »
      »
      »
      21 month(s) ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yes

    • »
      »
      »
      21 month(s) ago, # ^ |
      Rev. 3   Vote: I like it 0 Vote: I do not like it

      Yes I used it in my solution and I got 56 points (complexity O(n^2)). But there is one more observation that if v is in the array answer can be subarray consisting only from v.

»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it
»
21 month(s) ago, # |
  Vote: I like it +5 Vote: I do not like it

Tima, Can you change style of contests (which in the group) to ACM ICPC style. And access to see code, if you solve this problem.

Sorry for my English.

  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    I think IOI format is better suited.

    • »
      »
      »
      21 month(s) ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      What about access to see code, if you get max. score. Can you do this?

    • »
      »
      »
      21 month(s) ago, # ^ |
        Vote: I like it +7 Vote: I do not like it

      I think it would be better if you make each sub-task a problem in codeforces so you can see how many sub-tasks your code passes.

»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Why there is only results of people who have got a medal?

  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Fixed. All results are available.

»
21 month(s) ago, # |
  Vote: I like it +10 Vote: I do not like it

How to solve problem A from the second day?

»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Where can I find the solutions?