#include "codeforces.h"
#include <chrono>
#include <vector>
using namespace std;
using namespace std::chrono_literals;
using namespace cf;
int main() {
Blog announcement("Codeforces Round 1119 (Div. 3)");
announcement << "Hello Codeforces!\n";
announcement << "I am delighted to invite you to participate in " << Codeforces Round 1119 (Div. 3) << "!\n";
announcement << "The problems were written and prepared by " << nik_exists << ".\n\n";
announcement << ContestInfo {
.start_time = 05.09.2026 17:45 (Московское время),
.duration = 2h + 15min,
.number_of_problems = 7,
.subtasks = true // possibly not adjacent
};
announcement << RatingRules {
.rated_for_rating_below = 1600,
.unrated_registration_allowed = true,
.trusted_max_rating_below = 1900,
.trusted_min_rated_rounds = 5
};
announcement << JudgingRules {
.scoring = codeforces::ICPC,
.wrong_answer_penalty = 10min,
.open_hacking_phase = 12h,
.final_tests = after_open_hacks
};
auto is_cheater = [](User user) {
// https://codeforces.me/blog/entry/133941
if (user.used_ai_in_contest()) return true;
if (user.discussed_problems_online_before_contest_end()) return true;
if (user.violated_other_rules_im_too_lazy_to_list()) return true;
return false;
};
for (auto user : get_users(2259)) {
if (is_cheater(user)) user.send_to_cry_basement();
}
announcement << Acknowledgments {
.coordinator = cry,
.russian_translation = Vladosiya,
.red_testers = {__baozii__, AksLolCoding, awesomeguy856, nifeshe},
.golden_testers = {Arpa, Intellegent, Proof_by_QED, temporary1},
.purple_testers = {Argentum47, Euclid73, Jteh, Lilypad, SpyrosAliv, nimoxide, omsincoconut, wakanda-forever, yse},
.blue_testers = {CatsAreCool, Vladosiya, chromate00, fatespeaker, linearspace, reirugan, simplelife},
.green_testers = {hannah12345},
.codeforces_and_polygon = {KAN, MikeMirzayanov}
};
announcement << "\nBest of luck, and thank y'all so much for competing!\n";
}
EDITORIAL
Looking forward to some good problems
As a taster, I am Looking forward to tasting that fish on your rod(☉﹃☉).
No please I worked hard for it, it's the only fish I've caught in my life
Lol @More you are really a taster
orz nik_exists
Good sir nik_exists, prithee, answer me this: how comes it to pass that thou hast donned two different templates within a single blog? Speak true—hast thou been aided by that most uncanny spirit they call AI?
em dash detected, comment rejected
sorry im not shakespeare
I'm not Shakespeare as well, but I'm Sonnet 5
stop changing your pfp bro
Orz announcement by nik_exists!
Sorry sir, your code got a CE
Also sir, because your code has many > 2 words variable and comments, is it AI?
shhhhhhhhhh
😱
OUU SHII
Unusual Style Changes in Codeforces Round 1119 (Div. 3)'s Announcements
Don,t reveal it....
a cursed energy?
Such an interesting announcement! Hope the problems will be interesting as well
+1
As purple_testers[1] I suggest you all should take this high quality round.
...
Runtime error on test 1
Runtime error on pretest 1
in main(): type assertion failed, expected "codeforces::joke", found ""One of the best joke ever
Ball knower
He deserves -500 contribution?
As a tester, DO NOT CHEAT and destroy this amazing round. Good luck <3
Suggest Profile Picture i will put it if reached Puiple in this Round
The same one but spelled correctly
Puiple
As a tester, I lack the creativity to write a good tester comment.
I wish all good luck and enjoyment of the contest!
orz fatespeaker
orz fatespeaker and greateric
orz fatespeaker and greateric and sc3developer
orz fatespeaker and greateric and sc3developer and zeyd1234
orz fatespeaker and greateric and sc3developer and zeyd1234 and BlitzCurlerPremium
orz everyone except cheaters
u were only supposed to add people but u accidentally removed greateric. he fits under the second category. greateric u can respond with the link to ur apology
:sob: http://apology.greatericontop.me
DuyMinh3005
i aint falling for that! Nice try!
As not a tester and not rated nik_exists could you please explain the mysterious man in the tester list named
wfmexgdcodegcdcodeeiaTestsNumTalso orzpurple_testers[1], blue_testers[3], gray_testers[2]guys, I have a theory, since there were a bunch of shapes on the announcement of Codeforces Round 1009 (Div. 3), and this one is a bunch of code, this contest will be purely implementation and require zero mathematical thinking
w thoery.
As a tester, I have not tested the announcement blog.
as a tester, I'll leak the problems if you send me $5
i'll leak them for 3$ and a chocolate bar
double it and give it to the next person
https://codeforces.me/blog/entry/156414
You did didn't you
hehe
when i first looked at this blog i thought cf got hacked
i have not seen this kind of creative blog of a Div
When I first saw this, I thought you'd accidentally posted some AI-generated garbage.
send to cry basement ☠️
Non — C++ users reading this blog: ._.
Even though i know c++ this bounced of my head.
peak Announcement.
looking forward to some good problems (right between my midterms XD)
also peak announcement!
It is very code style
I like this kind of announcement.
u don't have any cyan testers , p.s I am willing to contribute to testing , if u need one :)
sadly codeforces author guidelines prevent me from inviting people who request to test via DM or cf comment / to only invite people I know well. sorry :(
hiii , my name is ayush anjay !! , what is ur name ?
His name is nik_exists
u his PA ?
I hope l can solve some problems
program.cpp:1:10: fatal error: codeforces.h: No such file or directory 1 | #include "codeforces.h" | ^~~~~~~~~~~~~~ compilation terminated. Command exited with non-zero status 1
why keep to clustering testers by color?
no reason in particular, i think the announcement I was referencing when writing my Div 4 announcement did that, and so I just did it again
for some reason this code is giving compilation error
just make the header file yourself
i know, js a joke bro
So you mean that I can’t be rated in div.3？
OK,I get something wrong.
To clarify, the round will be rated for anyone with a rating lower than 1600. To be included in the official standings (which simply means you appear in the standings, you still get a rank regardless of if you're trusted), you need to be considered trusted, which means that you must have a max rating below 1900 and have participated in at least 5 rated rounds.
OK,thx
orz announcement!
wow! amazing announcement
cool concept for announcement, orz
But I hope problem statements are sweet and easy to understand.
unique announcement
print('I don't know formatting nor C++ so just imagine this is a comment glazing the announcement')
cry's basement is still working
It's look like instead of problem they pasted the solution
lesss effin' goooo what an announcement!
Russian translator is also Expert... 0_0
hi
Imma rank up on this one fs.
Isn't there any weight of problem ?
Div3 / 4 rounds (or any round with ICPC scoring) do not have individual problem scoring, instead, you are ranked based on number of problems solved, then by penalty
PEAK announcement
Thanks everyone for participating in Codeforces Round 1119 (Div. 3). Although it was initially difficult to understand from the editorial when I first participating in Codeforces contests. However I found that once I got used to it, the explanations felt very easy to understand, accurate, and highly academic.
We should read the hint and solution before reading code (Sorry for my bad English)
omg didn't know this round was a div2, thank you for enlightening me
omg didn't know this round was 1117, thank you for enlightening me
Forgive him he is an old man. Don't read his rev. comment
Codeforces needs to take stricter action against cheaters.
you can kiss my ass (Donald Trump)
Blog is so orz that it got +857 Upvotes and nik_exists is 13th in top contributors list
Dude made a codeforces.h and didn't include vector in that??
Newbies is getting a headache today bro...
python users have been real quite since this dropped
No
return 0;hurtsgood
is this the best ever contest post?
yes
It's the nerdiest announcement I have ever seen.
i mean, objectively, are we not all "nerds" here?
But there will still be the nerdiest
Nik_exist got to top 10 contributor thanks to this blog
Loved the creative announcement format.
Such an interesting announcement! Hope the problems will be interesting as well
w cf announcement!!!!!! but shouldn't it be send_to_cry_basement(user) since surely nonusers are also sent to cry's basement, like mr sean p combs.
This code doesn't compile. Can somebody help me?
Lol..The code is made by creativity so you should compile the code with it.
i have by mistakenly chosen for unrated and now i am not able to make it rated for me .Please help.
You should be able to unregister. I believe if you click on participants page (by clicking on the number of people participating) there should be a blue box at the top where you can click unregister. You then should be able to reregister as rated.
This announcement has more rating points than me
This announcement is basically a Pupil :)
Updated: Specialist now :)
it bouta be specialist
Update Expert now
I Hope that we can learn something from this contest. Which this occurs when the problems are difficulty-optimized.
S/he is literally 5th in Top Contributors rn orz blog
As a participant , I hope this will increase my rating :)
is this rated for me ? im 1660
No
Acknowledgements should be Acknowledgments
technically Acknowledgements is correct in every dialect of English but American English (though I did change it since I do speak American English, idrc that much though)
Who can fly?
Very creative way of announcing the contest <3
Unusual Style Changes in Codeforces Round 1119 (Div. 3)'s Announcement
As we all know, The announcement of Codeforces Round 1119 (Div. 3)'s Announcement is very unique and well made. However, I, an unmentioned tester of the announcement code haven't been paid nik_exists life savings ($1), and so I shall expose the person behind the coding once and for all.
As a reference, here's his code:
First of all, his variable names are really long. This would be an ass excuse if he used long variables inside of his code, but he doesn't even mention them! He also uses comments which he also usually doesn't use. These 2 combined show a clear sign of AI assistance. He even uses a diffirent template, that doesn't include all the basics such as #!
Second of all, he uses the damned .violated_other_rules_im_too_lazy_to_list() thing??? (idk C++) We all know that using that module (??) is very very bad as it can cause MLE and TLE AND it doesn't include the newer rules such as being orz like [user: nick exist]. THis is a clear sign of artificial intellogonce.
Here are some other smaller things.
Really long jokes aside nik_exists is genuenily dodging negativity like droplets in the shower. Like look at what he writes and tell me he isn't tourist for blogs
shhhhh
Very persuasive reason
Cool way of dropping announcements
this code does not compile, is codeforces.h an open source library ? hahah
as a participant I can confirm that nik really exists
why contest got pushed back؟
Delayforces
yep my bedtime is delayed
issoki
why???
as a tester, i now have to wait 10 more minutes
10 min delay?
yes
The contest got delayed, I wonder what the reason could be.
why a delay??!!
It got TLE
why the competition is delayed for 10 minutes?
Thanks for the extra 10 minutes!
Why delayed?Don't waste my time to sleep.
delayYYY
What's up??
Amazing problems!
tysm!
Interesting competition, thank you very much!
D and E were amazing problems, thank you!
how the hell do you solve B??
Observe that you can always make odd numbers equal, as you can keep reducing until it's 1, then if you keep doing additional operations, then you get |1-2| = 1
But if it's even, there are two cases. If it's =0 mod 4, then you will require 2*n operations to reduce to 0, and only even operations after that can keep it at 0, for example (since you will go 0 -> |0-2| = 2 -> |2-2| = 0 -> etc)
Similarly, for 2 mod 4, you will require 2*n+1 operations to reduce to 0 (2 -> 0 -> |0-2| -> etc)
So all it is is just the max(# of elements that are =1mod2, # of elements that are =2mod4, # of elements that are =0mod4)
Don't we have to apply |ai-2| for all i at once any number of times? Let's say if have 1,3,5. Then the best solve would be 1,1,3 after subtracting -2 from each, but according to the explanation it is 3. What am i missing or reading incorrectly, can you help?
you can do:
1 3 5
(operation)
1 1 3
(operation)
1 1 1
(operation)
1 1 1
... (even if you keep doing more operations the answer is still 3)
take the max of the counts of the numbers which are: odd, 0 mod 4, 2 mod 4
The answer was $$$\max(cnt_0, cnt_2, cnt_1 + cnt_3)$$$, where $$$cnt_k =$$$ #{ $$$a_i \equiv k \pmod{4}$$$}.
Parity of the numbers does not change. So, all the odd numbers eventually reach 1. All the even numbers reach either 0 or 2. Evens divisible by 4 form one group and those not divisible by 4 form the other. Simply return the maximum group size among the three groups.
Best round ever! (especially E)
Great contest!
This is a very good contest! I enjoyed E a lot, it was amazing :)
FR!
FR!
Really enjoyed the round, hopefully I become specialist!
Thank you for the contest and 6 7 joke was really funny "... six or seven seas ..." (Problem E).
F is really nice!
B felt harder than C and D
Nice contest, enjoyed all the problems
I couldn't implement G and H in time because I wasn't really focused but is G binary searching on a min segtree of difference array prefix sums and H is counting number of 2sat arrangements?
I tried to look up how to count number of 2sat arrangements but couldn't find anything useful at least not on duckduckgo, how do we do this?
Feel like being helpful so here's solution sketches for A-F
A: Simulation, just add 1 to the output for every block that doesn't contain a 0
B: Max of the amount of odd elements, amount of even elements divisible by 4, and amount of even elements not divisble by 4
C: Replace -1 with 1 if it isn't between two 1s or -1s otherwise replace it with 0
D: If the count of 0 is 0 shove everything into A, if the count of 0 is 2 or 3 shove the first 0 into A, the rest of the 0s into B and everything else into C, otherwise impossible
E: For each non-0 or -1 element "ban" the range of elements where treasure can't be present, put treasure in all the unbanned spots, and check if the array matches up with your construction
F: Notice that the operation is equivalent to deleting the first 1 or last 0 in number of inversions, and 0s at start and 1s at end don't matter, simulate this with a deque
Counting number of 2-sat arrangements is np-hard. Considering the possible forms of pairs can be helpful.
ty, I thought you might be able to do something with DAG DP
a[j+1] — a[j] <= k => a[j] <= a[i-1] + (j-i)*k, j > i after deleting a[i]
cost = ∑ max(0, a[j] — a[i-1] — (j-i)*k), j > i
Define, b[j] = a[j] — j*k cost = ∑ max(0, b[j] — (b[i-1] — k)), j > i
This can be answered in O(logN) time using two BITs, one for sum and another for count. Proceed from right to left.
Orz announcement! nik_exists wrote the whole announcement in C++ just for it to fail compilation on pretest 1
The joke is that the announcement is written like a competitive programming submission, so naturally it deserves to be judged like one too. Sadly, it did not survive the first test.
I think I solved F like 3 minutes after the contest ended :(
codeforces has pushed me to think in ways like I have never done before. I really enjoyed these challenges. Thanks for the great problems, contest, and platform!! <3
Now that the contest is over, what's the distribution?
Any idea how long it will take before we’re able to submit the solution?
Is the hacking round open? All I see is system testing.
Solved A, B, C, D, G. G, in particular, was enjoyable :)
For question E why this approach doesn't pass. I just tried to find intervals where you must place zero and merge them.
i dont think you checked that your construction gives the right numbers
Such check is enough ? During contest, I misread test case... and gave up on that check. Thank you .
see
It just passed...
Strangely, why is the system testing period so long?
Why did the system testing stop at 100%?
Was H graph dp?
There were solutions that used graph dp, but model doesn't use it
Nice round, enjoyed the problems. I think the round was well-balanced, had interesting ideas, while also having some educational aspects in problems.
This was such a fun round for me. I really liked this collection of topics and problems. One question though, why is testing taking so long? I really want to test my H solution that I solved 10 minutes after the end of the round... :D
Easy H. Good problemset otherwise
very cool contest announcement！
Hello Codeforces team,
My submissions in Codeforces Round 1119 (Div. 3) — were marked as “Skipped” with the message: “Your submission in contest has been skipped due to rule violation.”
I have not received any separate message explaining which rule was violated or stating that my solutions significantly coincided with another participant's solutions.
I wrote my solutions myself during the contest and did not intentionally violate any contest rules.
Could you please clarify which specific rule was violated and, if possible, manually review my submissions?
My submission IDs are:
389482042, 389497102, 389530884, 389536163, 389543036, 389550466, 389551674
Please also let me know if any additional information, source code, explanation, or other action is required from my side to help resolve this issue. I am happy to provide whatever is needed.
Thank you.
I participated in Codeforces Round 1119 (Div. 3) with the intention of participating in rated mode. I did not intentionally choose unrated registration. However, my contest history shows no rank/rating change. Could you please check my registration status and, if possible, count my participation as rated? My handle is ny97325
There's no rating change yet. You should wait a couple more hour and your rating will change.
Hi senior, may I ask around what time the ratings will be released?
Maybe 3-4 more hours
Hello,
My handle is siddarth_56832dsds.
I received a message that my submissions in Contest 2259 were skipped due to a rules violation.
I would like to request clarification and a review of this decision. Could you please provide more information about the reason for the violation?
Thank you.
Subject: Request for review of Contest 2259 rules violation
My submissions in Codeforces Round 1119 (Div. 3) were skipped due to a rules violation.
I would like to request a review of this decision, as I believe there may have been a misunderstanding regarding my submissions.
The algorithms and approaches used in my solutions were developed by me. My submitted code also contains some pre-written templates and comments that I regularly use, which may have contributed to similarities detected in my submissions. However, I do not know the specific reason for the rules-violation decision.
I would be grateful if my submissions could be manually reviewed and if you could let me know what specifically caused the rules-violation decision.
My submissions are:
A — 389473785 B — 389490535 C — 389508799, 389510435 D — 389538097 E — 389551316
Thank you for taking the time to review my case.
Codeforces should add report button to point out users who are using Ai to inflate the ranks.
I believe that would be hard to implement.
Probably best div3 ever
Hello coordinators,
My submissions for yesterday's contest (problems A, B, C, and E) were all marked as "Skipped" due to a rules violation (Handle: jahans_02).
I wrote all of my solutions completely from scratch during the round using VS Code on my local machine. I did not use any online compilers, share my code with anyone, or look at any external sources during the contest.
Could the coordinators or system administrators please review my case to check if this was an automated false positive? I am happy to explain the logic behind any of my solutions if needed.Thank you for your time and help!
My submissions in contest 2259 — Codeforces Round 1119 (Div. 3) were skipped because of a rules violation.
The affected submissions are:
389481263 — A 389497868 — B 389530416 — C 389531630 — C 389548022 — D 389568061 — E
All of these submissions were made during the contest.
I am not aware of violating any contest rules, and I would like to understand what caused this decision. If this was a false positive, I would greatly appreciate a manual review of my submissions.
Could the admins please review my case and clarify which rule was considered violated?
Thank you.
same happened with me
Could the coordinators or system administrators please review my case to check if this was an automated false positive? I am happy to explain the logic behind any of my solutions if needed.Thank you for your time and help!
can someone explain why this went wrong?389560130
look into hash collisions, which can result in access in Counter / set / dict to blow up to O(n) per insert / lookup
'E' gave me severe headaches
I think this contest is absolutely amazing.
I have a genuine question why this announcement got 1.8K up votes i agree the contest is good but for any contest announcement i never saw these many upvotes till now
I think e is a good problem
As a newbie, I hope everyone have great fun and higher ratings!
Someone pls help im too low on rating
Me too, I'm very noob.
Its quite crazy to see how nik_exists has climbed up the top contributor ladder with just one blog post O.O
He deserves it not gonna lie
Yeah man, he really did deserve it this was maybe the best blog I have ever seen on CF
I didn't want to say anything about it before contest just in case I jinxed myself, but it's kinda crazy how many upvotes this contest got. think it's the highest upvoted announcement of this year and probably top 10 of all time
Bro peaked with a blog post, its all downhill from here XD
low.
Great Contest
absolute cinema
bro used "golden_testers" instead of "yellow_testers" btw