wuhudsm's blog

Invitation to TheForces Round #19 (Briefest-Forces)
By wuhudsm, history, 18 months ago, In English

Hello, Codeforces!

We are happy to invite you to TheForces Round #19 (Briefest-Forces), which will take place on Jul/03/2023 18:05 (Moscow time)

What is TheForces Round?

Editorial

You will have 135 minutes to solve 6 problems.

All the statements are very short and brief,and we strongly recommend you to read all problems.

The round is rated:) After the round is over,you can find your rating changes here.

Discord Server (1000+ people)

Contests' archive

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

»
18 months ago, # |
  Vote: I like it +12 Vote: I do not like it

Let's go!!

→ Reply
»
18 months ago, # |
  Vote: I like it +9 Vote: I do not like it

As a tester, prepare ur ...

→ Reply
»
18 months ago, # |
← Rev. 2   Vote: I like it +47 Vote: I do not like it

as a tester

Spoiler

If you've done all the problems you can try to think about how do you do E with minimal memory, here's an sol that does 12,000 KB

→ Reply
»
18 months ago, # |
  Vote: I like it +15 Vote: I do not like it

Cool, GL & HF.

→ Reply
»
18 months ago, # |
  Vote: I like it +17 Vote: I do not like it

Will TheForces rating change after the round? Yes, it will.

After the round, you can find your TheForces rating here

→ Reply
»
18 months ago, # |
  Vote: I like it +6 Vote: I do not like it

The registration is open!

→ Reply
»
18 months ago, # |
  Vote: I like it -14 Vote: I do not like it

TheForces is great but... Starts a little bit late. That might cause insomnia. Please upvote if you agree and downvote if you disagree.

→ Reply
»
18 months ago, # |
  Vote: I like it +6 Vote: I do not like it

All Problems are in Queue.Will it Disturb the Contest?

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The checker is broken.

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

D long queue!!!!!!!!!!!!!!!!!!!!

→ Reply
»
18 months ago, # |
  Vote: I like it +11 Vote: I do not like it

ohh, problem E is... so dirty code(for me)

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

What is wrong with this- [submission:211970161] ?

→ Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Not able to view code.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      You can copy the code from the Editorial and submit it. After you get AC, you will be able to view the test data.

      → Reply
      • »
        »
        »
        »
        18 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        can u make other submissions to view?

        → Reply
        • »
          »
          »
          »
          »
          18 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          After you get AC, you can view other submissions

          → Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I think the solution is O(n^2) with all values in the array a and c being multiples of m.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it +22 Vote: I do not like it

      m can have maximum of 1344 factors so it will be O(1344*1344).

      → Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    You forgot fast io:(

    → Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I tried it out with Fast IO. The input for this problem is very large it seems.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it -25 Vote: I do not like it

      Thanks for this info. I guess this contest is of no use then.

      → Reply
      • »
        »
        »
        »
        18 months ago, # ^ |
          Vote: I like it +5 Vote: I do not like it

        Why do you think so? I felt the problems were clever, regardless of the constraints. Fast IO is a pretty common thing, and it is assumed to be used by everyone.

        → Reply
      • »
        »
        »
        »
        18 months ago, # ^ |
        ← Rev. 2   Vote: I like it +3 Vote: I do not like it

        "I guess this contest is of no use then."

        Shouldn't you be glad that you learned about fast IO in an unrated contest?

        → Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    how it is visible but other submissions not visible

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      You can copy the code from the Editorial and submit it. After you get AC, you will be able to view the test data.

      → Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I guess that's because you don't have fast IO!

    → Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

how to solve F? i thought it was related to cycle decomposition and tried but failed...

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

what is the logic of problem A

→ Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    If $$$l_1+r_1 > l_2 + r_2$$$, then the probability of Alice's winning is higher than Bob's.

    You can check the proof in the editorial here.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
        Vote: I like it +2 Vote: I do not like it

      Just curious who choose this as problem A? It is easy to guess, but very hard to prove.

      → Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

problem E: ref: https://mirror.codeforces.com/gym/104455/submission/211981570
is there no way to make this O(7.(2n)) solution pass?

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why this contest is not added into TheForces Rounds Group?

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why the yesterday's TheForces #19 round is deleted ?

→ Reply