Hello, Codeforces!
We are happy to invite you to TheForces Round #33 (Wow-Forces), which will take place on Aug/12/2024 17:35 (Moscow time)
You will have 135 minutes to solve 6 problems.
The round is TheForces rated! After the round you can find your rating changes here.
Prizes: the participant in the $$$i$$$th place will receive $$$2^{3-i}$$$ dollars $$$(1 \leq i \leq 3)$$$ as a prize. In addition, we will randomly select $$$\lfloor \frac{p}{30} \rfloor$$$ lucky participants and give each of them $$$1$$$ dollar as a prize, where $$$p$$$ is the number of participants. Please actively participate :)
For more details about TheForces Prize, read the above spoiler and join TheForces!
Problems are authored and prepared by wuhudsm,Yugandhar_Master.
We would like to thank our army of testers: Dominater069, arash., Error_Yuan, Maeda.anHiep, KUHYAKU, PK__CODER, vitosevskich,Numinous, harshith_04, krishnagopalagarwal7, Ankit_singh_sisodya, puupil, VijayBalaji, Krrishchanchal, mahendraakshansh, ZhockDen, ishat_jha, nik4o.
Also we want to thank You for participating in our round.
Discord Server (2200+ members)
UPD:
Congrats for the winners!
1 tiger2005, ORZ for the only AK!
And $$$2$$$ lucky participants:
(Pls dm wuhudsm for your prize : ) )
As a tester, I want contribution.
As a non-tester, I want contribution.
will this contest will pop up in my contest tab? or I need to go to this blog?
Only official contests come in contests tab.
I see, thanks.
As a tester, I am sad that I can't participate
As a tester, i'm still thinking what to write
Hope you will find the problemset as a set of $$$6$$$ problems.
Wow the cheaters are back XD
Not all are cheaters btw!
I don’t know what are u talking about? Is there any cheater among the problem setters or testers?
Most of their staff are either cheaters or affiliated with cheaters
I participated on their last contest and willing to participate in this one too! I need practice!
Just now I've read the blog about cheaters affiliated with TheForces... Kinda undermining my will to practice with the group contest tbh.
Registration is open
Deleted
Reminder: contest starts in $$$15$$$ minutes
Can anyone help me in B?
I was trying to negate the max element everytime and was updating the rest of the element with respect to that was my approach was wrong or Impelementation? Any insights.
I use binary search, I overkill the max then transfer usage of A to B for any elements that > 0
What do you mean by tranfer the usage of A to B? Ig i was trying to do the same.
in 1 move you can: - c[i] = c[i]-a the rest: c[j]-b
greedy way: get max c[i] = c[i]-a*res, the rest is c[j] = c[j]-b*res
transfer -a from max to others c[j] > 0: c[i] = c[i] + a-b, c[j] = c[j] -a+b
A result "median" is correct if everything in the array is <= 0
275983545
Though I cant view the subsmission, thanks anyways, ill try to implement.
too slow of solving problems, maybe I overkill A and B...