Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

nkamzabek's blog

By nkamzabek, history, 5 years ago, In English

I noticed that most editorials of the last educational rounds will be published 1 or 2 days after the contest. Of course, I have nothing against it, but at all one trivial question, why?

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

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

We have an internal policy that editorials should be published not later than 24 hours after a round. I don't think that writers violate it often.

  • »
    »
    5 years ago, # ^ |
      Vote: I like it -30 Vote: I do not like it

    But, what about the problems' difficulty ratings update? In some cases, it is updated after 2 or 3 days. I think the difficulty rating is an important feature to know one's progress and it should also be affected within a day or so.

»
5 years ago, # |
Rev. 2   Vote: I like it +41 Vote: I do not like it

Pffff, is that a problem? If you couldn't solve some task, you can ask me!

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

    bruh how to solve travelling salesman problem in polynomial time

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

      I don't know exact time complexity, but use treap, where every node maintains '2D-Persistent tree with FFT on each node'. To further optimization use meet-in-the-middle, but I don't know how to merge, but at all you can create a graph, after that go to Dominator tree and do some stuffs with combinatorics or Burnside's lemma. But I don't know time complexity.

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

        Are you kidding? Just use bitset

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

          Oh, yes. I wasted my 20 years to solve it, but you find solution easier. 10q!

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

      any other questions?

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

      Is P==NP?