Kirill020708's blog

By Kirill020708, 7 weeks ago, translation, In English

Hello, Codeforces! We with sdyakonov invite you to Contest, which will take place at May/21/2022 17:35 (Moscow time). We invite everyone. The contest will be not rated. The competition will be held according to ICPC rules. There will be 11 tasks in total. The contest will be of most interest to experts or below. But we invite purple and above to participate. The contest will be in this group.

Tasks have been prepared by sdyakonov, Kirill020708, onlytrall

Statements will be in English and Russian

Thanks for preparing the contest to the following people:

  1. Testers: valerikk, Sokol080808, adepteXiao, makrav.io, onlytrall, Splatjov, Gamer_kotik, MrDlop, akatevsw.
  2. Special thanks to onlytrall for test generators.
  3. sdyakonov for rejecting a large number of tasks.

Also many thanks to MikeMirzayanov for the Polygon and Codeforces systems!

Good luck!

UPD. The contest will be for 2 hours

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

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

lol can we register in teams?

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

i hope it will be a good practice for me , i'm getting ready for my icpc local qualification....

»
6 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Please make the solutions public. I wanna see other's implementation for problems i couldn't solve.

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

In Problem $$$J$$$ I wrote Dijkstra with set and found $$$min \; x$$$ such that $$$x - x / m =d$$$ using binary search, but I get TL. How to do it faster?

  • »
    »
    6 weeks ago, # ^ |
    Rev. 6   Vote: I like it +4 Vote: I do not like it

    Your solution didn't TL on some large tests, may be problem in infinite loop (also we opened tests)

    There solution with formula for searching min x in $$$O(1)$$$: [submission:157928657]

    Code
    • »
      »
      »
      6 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Excuse me, I have no prermission to see this

      • »
        »
        »
        »
        6 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        oh, sry, fixed now

        • »
          »
          »
          »
          »
          6 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          I still can't)

          I get message in bottom-right: "You are not allowed to view the contest"

          • »
            »
            »
            »
            »
            »
            6 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            You can see the submissions in submission page of a problem

          • »
            »
            »
            »
            »
            »
            6 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            don't know how to fix it( added code

          • »
            »
            »
            »
            »
            »
            6 weeks ago, # ^ |
              Vote: I like it +1 Vote: I do not like it

            A, the problem was that in binary search I give value to $$$r$$$ of segment not $$$10^9$$$, but

            while(r-r/w<d) r<<=1;
            

            The answer to problem is $$$\le 10^9$$$, however some pathes can have very big cost, and I tried to count them too.

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Numbertheory forces T_T, But the problems were good.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Last 3 problems are interesting .. saved!