Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Petr's blog

A vertex-dominating week
By Petr, history, 11 years ago, In English

http://petr-mitrichev.blogspot.com/2016/02/a-vertex-dominating-week.html

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

»
11 years ago, hide # |
 
Vote: I like it +22 Vote: I do not like it

When someone takes first place in top contributors list you write blog. So again 'A week with second place in top contributors list'.

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

Does anyone know how to properly solve problem H? It looks like we screwed this one since we were the only team with >=6 problems which hasn't solved it, but I haven't heard about anyone who solved it faster than O(n3), everybody just "won with tests", solution presented on problem analysis turned out to be O(n3), not as it was intended to and nobody knew how to fix it. Maybe some people were too shy to share their solution during problem analysis or someone not present on Petrozavodsk has solved it? Maybe Egor :)?

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

    I've posted a link to a paper which provides a O(n*n) solution in the topic on the corresponding Opencup contest. Sorry for not linking here — CF textarea and search are still not that friendly to mobile devices, but you should still be able to find it.

    → Reply