We will hold Codeforces Round 794 (Div. 1) and Codeforces Round 794 (Div. 2).
- Contest URLs: https://codeforces.me/contest/1685, https://codeforces.me/contest/1686
- Unusual start time: May/25/2022 20:35 (Moscow time)
- Duration: 135 minutes
- Number of Tasks: 6 for Div2, 5 for Div1
- Rated range: $$$(-\infty, 1899]$$$ for Div2, $$$[1900, \infty)$$$ for Div1
- Writer: antontrygubO_o
- Testers: malachi_toney_goat, oleh1421, Geothermal, nor, TheScrasse, timreizin, emorgan, Um_nik, 244mhq, Kuroni, competitive__programmer
- VIP-tester: errorgorn
- Coordinator and author of one problem without which round would be unbalanced: dario2994
- Creator of the amazing Codeforces and Polygon platforms: MikeMirzayanov
The point values will be:
Div2: 500 — 1000 — 1500 — 2000 — 2500 — 2500
Div1: 500 — 1000 — 1500 — (1500 + 1500) — 3500
We are looking forward to your participation!
UPD 1: Thanks to NEAR for supporting this round, details can be found in this post.
UPD 2: Editorial
UPD 3: Congratulations to winners!
Div1:
1. heuristica
2. jiangly
3. ecnerwala
4. gamegame
5. maroonrk
Div2:
1. lmqzzz
2. Teating_
3. lunchbox
4. Nida1097
5. demacia
As VIP tester, good luck to all east Asians competiting until 4am
As a Japanese, when the contest ends the sun will rise... (btw why so late unusual time?)
I think it is to prevent clashing with codechef starters 40 which is from 10:30pm — 1:30am GMT +8
You are right. And we think that it's generally not bad to have a late time round once in a while (for people from other time zones).
why is it necessary to care about codechef?
Maybe because he is a problem admin at Codechef
Because Codechef is a good platform with good problems
Noice!!
Yeah, but sadly no one recognizes it.
The only drawback is their bad plagiarism checker. Ratings of the fair contestants drop because of the massive cheater base and their plagiarism checker failing to detect them. But their problems are noice no doubt.
Me: "I'm going to propose $$$20$$$ problems on Codechef."
antontrygubO_o: "Codechef is not a rubbish bin!"
Harder problems on codechef like medium/medium-hard are quality problems in general. I don't think you can so easily throw $$$20$$$ mediums to the so-called "rubbish-bin".
In fact, I have proposed no medium/medium-hard problems.
With good loyal employees
even that is down now during the contest
Can you enter codechef？Is that Website crash？
Does that mean that there won't be any contests on cf(even if div1) at usual time or close to that on Wednesday?(since CC starters is held every Wednesday)
also the point is that if time clashes it makes more sense to change the time of cc contest rather than cf contest because certainly cf is a better platform than cc with larger amount of interested participants
funny to see cyan judging which site is better, when he can't even solve medium level problems on any of the sites.
Funny to see low-rated expert judging cyan with 50 rating difference between them.
TimDee
that's why I didn't said anything about website like which website has better problems :)
I think you have weakness in reading texts,I said better platform not better problems
it should be better if we do debate in dm instead of spamming announcement blog xD. Also what is the other thing in coding platforms other than problems, As much as I recall it was long ago when codechef contest goes unrated!
oh okk,try visiting cc now then
If I am an asshole in problem solving ,you are as asshole as me ,our rating difference is 55...also you may never reach things in future that I will do + it doesn't require to be red to understand which platform is better,,,also If I can't solve medium level prblms ,you can't also, it's funny to see someone who is just above 1600 out of nowhere insulting someone who is just few ratings less than him
I never said I am better than you :)
I don't think being higher rated ( no matter the difference ) allows you to insult anyone.
-- A non-alt account.
Fuck you, shut up, gitgud
Marinush
Success makes so many people hate you. I wish it wasn't that way. It would be wonderful to enjoy success without seeing envy in the eyes of those around you.
bleahbleah
Learn how to troll with getting upvotes
Thanks for the advice rotavirus :)
UPD: He was really rotavirus
Two back to back contests
...
...All the best everyone, may the force of positive delta be with you!
That is right! Just like sometime there are round which is from 17:35 — 19:50 GMT+8.
turns out badly, the CodeChef servers are down
codechef keeps contest according to codeforces (it is much smaller)...(see now contest is postponed..)
Land of the Rising Sun
hey mate, are u caged here too?
Nah I'm free here
why so late
⚫⁔⚫
Bro I hacked someone on C.
but there are other people also , who will get WA on C due to that testcase.
When will they rejudge.
Amazing Unusual Time
tmm
As a tester and an Anton-problem-enjoyer, I can confirm that the problems are very beautiful. I'd say some of the problems are probably the best I've seen this year, but I won't jinx the round by saying that
since quite a few problems that I had tested had to be removed, and I haven't seen many problems this year either :/
Nice
Bro i hacked somenone on C
when will other people get testted on that testcase for C problem.
1
10000
1 2 3... till 10000
:o atcoder announcement format
The last two Div2 tasks are worth the same, but there aren't two tasks in Div1 that are worth the same.
The last problem in Div2 will be the first subtask of the fourth problem in Div1.
Thanks to antontrygubO_o
for rejecting all of the problems of himselffor creating this contest.It's really an unusual time, so I can't attend :( hope others enjoy it
WOW!, Contest Announcement itself is neat, clean and precise. Looking forward for my first MIDNIGHT contest
I finally get a excuse to wake up till 1 in the night for actual reasons
"Rated range: (−∞,1899] for Div2, [1900,∞) for Div1", means "Rated range: (−∞,1899] for Div2, [1900,tourist] for Div1"?
why downvote to him...
.
My man got Time machine
use binary search
very unusual time
very unusual format
All hail our emperor anton
It's Bangladeshi mid night (at 11.35PM).....Unusual advanced time...
Unusual start time: Thursday, May 26, 2022 at 01:35UTC+8
Aha
Unusual start time: Thursday, May 26, 2022 at 00:35UTC+7
Aha
Rubbish time for Chinese users.
I think in this contest, the record would set up for the lowest number of participation.
Timings are not unusual , but absurd.
I think most of Americans can participate now, And also I am wondering that people in Los Angeles always participated in CF contests at 4 or 5 A.M
As a tester I should say: Don't even think about skipping this round. Just look at how many testers lost their opportunity to participated in a rated contest(that takes place once in eternity). Show some respect
Wish I could bro. But start time is same as my sleep time. I'd be sleepy entire contest.
How about shifting by 1 day and have usual timing
what do you do in morning by sleeping early anyway
Internship
I don't want to skip it, but look at the time. I believe most East Asian competitors have to withdraw. Anyway, that would be a good time to American participants.
how far is it (−∞) possible???
-tourist
+1/12?
Indian night owls there you go...
Hoping for strong pretests this round. Suffering from weak pretest syndrome since last few rounds.
Yes. Last 4 rounds went like trash for me.
what is -∞
The rating which is not achieved by anyone till now..
Best of luck!
Can you change the starting time, It is not suitable for most users! It would be better if the contest is held as usual, I mean at 19:35 (UTC+5) More specific time: (14:45 UTC+0)
My first midnight contest let's gooo
I agree with you. I won't do this contest because I want more sleep.
Yeah sleep is much better :)
wow, i thought that i'm on codeforces, not on atcoder
I hope my pupil friends will contribute to stock up my lost ratings, in this round despite the unusual start time.
Time can be usual?All the eastern asian countries people is sleeping.
Only the truly passionate ones will be awake.
I'd rather stay in good a sleep and put in more passion the next day
Sure you do :)
what ! 2:35 AM?!??
Honestly, with 420 problems solved, a (timezone dependent) leftover max streak of 69 from last summer (a summer of failure tho), and a new peak rating (+175 delta: you know, for kids!), I was thinking of retiring from cp on a completely middling note.
That and I still don't know if I'll be able to clear out enough time in the middle of the afternoon on a weekday tomorrow...
Buuuut, it's mildly annoying that my 'actual' peak rating was on account of the april fools contest... so, screw it, I'm in (as long as daycare doesn't crap out randomly (again)).
Place your bets on how this choice will age, but you'd probably be right to think of rancid dairy more than fine wine :P
omg ukrainian round
Why?
Because
Lol
Оу май, ты же автор!
Спасибо за контест!
я ненастоящий Антон...
Кек, а я повелся(
Hope to see brilliant problems, hope new colors for all
green after red :-)
LOL,u don't need green, red will be awesome for u and u will reach it soon, your graph is fantastic.
Thank)
Became cyan!!!
Congratulations great performance!
Thanks!
What a pity that I'm unable to take part because of the too-late time. I have class to attend the next morning
Can someone please tell what's wrong in this solution of mine , its problem D from last contest . I got a WA on test 192
Solution link
Thanks !!
You r using map<pair<int,int>,int> in place of map<pair<long long int,int>,int> AC Code
It would be funny for CF to schedule contests with time table evenly distributed among 24 clocks, this way we may have a rough statistics about each timezone's skill distributions (or non-primary account distributions, even the cheater distribution)
Anton orz
Thanks for taking some of your very precious time to delight us with this highly intelectual comment.
sleepforces
Contest should be shifted to next day.
start the contest now, codechef servers are down lmao
When you want to codeforces contest on its regular time and then it is postponed for 3 hrs , then you move to give a codechef contest and that site is down. Its like u have water but u cant drink it
well hello to everyone from codechef
Is anyone going to attend it after delay also?
Form starting it was supposed to start at 11 PM IST. Which delay are you talking about?
He is talking about the codechef one
I am talking about codeforces.
LOL.. Now this round needs to be postponed by an hour as well!
GG CC postponed and cf unusual timing, Now I can watch rcb batting with peace
what to see they are rubbish as always
upd: my bad patidar on fire
It was a perfect show boom boom patidar
bad time for Indians now ig :(
to use VPN? ¬‿¬
I hope i'll get my rating back)
kfc!
Hopefully, with unusual time comes unusual performance and I get mad positive rating points :)
You had us in the first half not gonna lie
The timing is perfect for me XD
Hi antontrygubO_o! Could you ban all r*ssians from participating? Thanks.
Hi, could you shut up? Thanks.
No, comrade Perdakov
Will the day finally come when Codeforces stops giving problems about subarrays, substrings, subsequences and bracket sequences? Come on guys, the problems are so boring that it's even not worth competing in such contests.
No
Looks like a Div3 Round by seeing A, B, and C.
Anyways the problem was very good and I enjoyed it though I made a Wrong submission on C due to a silly mistake.
done with ABC, should I even try D?
Yes
Speedforces?
Unbalancedforces
The best round for me. But I think I'll have TL in C((
The worst round in recent times
A, B, C -> DIV. 3 | D, E, F -> DIV. 1. There was no DIV. 2 today.
Free Advice:
30mins left in contest, even if you start solving now, if you could do D you'll be on top 200 :)Any way to report people like him?
You sold solution to him?)
Of course not!
Give him a lesson. Send the fake solution to him.
and get some money too!!!
Thanks dario2994. Without you, the contest would be unbalanced... orz
lol
why so unbalanced?
If you don't have enough problems on your hand make less rounds. But please make quality rounds. Anything you can assume and make a problem based on some constructions is the worst problem idea.
How to solve Div1B cleanly without a ton of if statements?
split to 4 types of sequences 1)ABAB..ABA 2)BAB...ABABAB 3)ABA...BABA 4)BABA...BABA so split to substring without duplicates of letter. 1 and 2 contribute len/2 to c or d. 3 contribute x to c and len/2-x-1 to d. 4 contribute x to d and len/2-x-1 to c.
This is the bad solution I am referring to. It frankly feels like awful bunch of cases (with a touch of greedy) and nothing else.
I used the same idea, not sure if my solution meets your standard 158450218
I did the same but got WA on 3 :( may be wrong implemented :(
How to solve Div2 D? T_T
Warning — this solution is bad, there is hopefully a better one.
Two consecutive same characters can never be part of the same word, so split on this. This leaves 3 patterns:
Try to fill required number of AB and BA from Type 3 directly first. Then use Type 2 if required. If we have excess of one and a deficit of the other even after this, then convert Type 3 pairs. Greedily use larger strings first since we'll always lose 1 A and 1 B during this interconversion, so we can get $$$\frac{|p|}{2} - 1$$$ copies of the opposite word from a Type 3 string of length $$$|p|$$$
If you have a deficit of As and Bs, get them from any extra AB / BA after this.
I arrived at the exact same solution, but rage quitted while implementing, thinking there might be a better way as it is a Div1 problem.
You can check the number of A and B at the beginning and ignore it later on. The problem basically reduces into checking if we can create enough AB and BA.
Oh, i tried doing it the other way, from Type 2, then type 3 smh
Actually, tried both ways, some impl bug...
what is the approach behind the D, Please mention if you know Thanks,
If my solution passes the system test, then D's solution is just a heavy implementation of some case analysis.
Hope your solution passes the system test
bruh, i was trying to make something smart Dx
This is how I did , Look For continuous blocks of A and B if the size of continuous block is greater than >=3 then all the middle characters must count only in a (if block is of A's) or b (if block is of B's) for example using 0 based indexing if if from i to j all are A's then all A's from i+1 to j-1 should definitely contribute of a because they are not proceeded or succeeded by B if(i==0) the first A should also contribute to a if(j==(n-1)) the last A should also. Now We are left with multiple strings of type ABABAB... or BABABA... and these strings are separated from each other by when we detect consecutive A's or B's. Now we sort these string in ascending order of size and check if it is possible to get c AB's and d BA's from them. Also if the leftout strings are odd in size then it must contribute atleast one character to a if it starts with A else to b.
i had same idea, but it still seemed kind of stupid solution to me lol
ABC (DIV2) speedforces D (DIV2), are you kidding me?
This is still an unbalanced round. For div1 users, your ranking will depend on how fast you solve div1B. For div2 users, your ranking will depend on how fast you solve div2C. Problems are good, but either too hard or too easy.
Oh yeah, another shitty speedforces round, more like ABBEFF, not ABCDEF (div 2)
How do you solve Div 1C? Spent the last hour and a half and I still can't think of a good solution :(
Answer <=2
Draw a graph of the prefix sum.'('=1 ,')'=-1
Reversing a substring is rotate the fold line of some segment by 180 degree.
Wait, how does hint 2 lead to $$$answer \leq 2$$$.
What if we also have large peaks and large troughs in the the region we fold? Isn't it possible to require upto $$$\log(n)$$$ folds in that case?
Find the peak of the prefix vals, then 2 operations: 0, peak and peak, n is enough. When you choose 2 endpoints with different values to rotate upon, only the values outside the range will 'flip' sides. So when you choose 0 and the highest value, there will be no higher value to 'flip' to the negative side.
What about ()))((((())))((())? Isn't solution to flip 2 16.
Of course, you still need to handle cases where just picking 1 reverse suffice, but at least you know that you can always solve in at most 2 reverses.
I see, makes sense, thanks!
Avengers Interviewer: What's your superpower? Me: I can solve problem D.
15min solving and rest just staring at the screen :)
btw what was the approach for solving D?
Reminded me of Round 728. Similar gradient lol.
Anyone pls tell that what was the approach to solve c:*
1.Sort the array 2.Check if length of array is odd or even 3.If Odd then output NO as you will not be able to form a circular array if length is odd, you can check this on your own. 4.If its even, then put the elements like [A[0], A[N/2+0], A[1], A[N/2+1], A[2], A[N/2+2], ...]. 5.Now check if its circular by doing if else example if (a[j]>a[j+1] and a[j]>a[j-1]) or (a[j]<a[j+1] and a[j]<a[j-1]) continue else return False, for the 0 element check it with 1st element and last element and for the last element check it with (last-1)th element and 0th element. 6.At last if all the things go correctly then output the array along with a yes else no.
Hope it helped!
pls tell that why we can't create circular array in this manner that , res[ind++]=arr[i]; res[ind++]=arr[n-1-i] why we need to take element from the mid
Try for this sample
1 2 3 4 4 4 7 8 9 10.If the middle 2 elements of the sorted are the same, then, they will occur next to each other, after rearranging, which is not expected. i.e., It will become like this
1 10 2 9 3 8 4 7 4 4.So, better to arrange it like
1 4 2 7 3 8 4 9 4 10.Is there a clean way of doing div 2D/div1B or is it just horrible implementation?
So sad, that cuz of debug stuff left, i lost +-800 places :( It could be an easy +175, but still +60, so i am fine with this :)
I'd really appreciate if anyone could enlighten me with an idea or hint for D?
I don't have the solution, but i was able to make the following observations:
Take a string: "ABAABBABAB" Since we don't have to create
AAandBB, we can effectively split the above string as[ABA][AB][BABAB]now the task has been reduced to satisfy the number of a,b,c,d(a: count of A, b: count of B, c: count of AB, d: count of BA)using these sub-strings, which are strictly alternating.Again for strings of odd length:
ABABA: we can take out singleAand reduce count ofaby 1.BABAB: we can take out singleBand reduce count ofbby 1.but taking out first character or last character causes problems:
A+BABAorABAB+AA decision has to be made to either remove first or last character. (I wasn't able to figure this out)For strings of even length:
ABABABABnotice removing AB or BA doesn't really affect the identity of string, what i mean by that is:ABABABremove either AB or BA last 2 remaining characters will always be AB for this string. ForBABABABAremove either AB or BA last 2 remaining characters will always be BA. So you can use them to satisfycandd.In the end you must have some
ABand someBAwith you and you can easily determine what to satisfy with them,ABorBAorAorB.Hope this makes sense.
guys I want to ask you, I have submit problem A late say, then get AC, after time i resubmit again does it mean i will lose points or no, or it depend if it the second submit AC or WA, please tell me about it, and sorry for the stupid question, and if the announcement don't say it will be hack duration, then if i get AC no one will hack me or I will get WA after contest by adding pretests, thanks again.
if you resubmit problem, you lose all points and get as much as it costs now
Everyone is competitive Coder, Until D arrives Just joking don't take it serious
xD
Why was the difficulty in div 2 like AABEEF
GreedyForces
This is my first codeforces contest where I solve exactly $$$0$$$ problems and guessed how to solve $$$3$$$ (with pretests passed).
i noticed that you can divide the string into blocks creating a new block once you reach two consecutive equal letters and the problem can be reduced to finding a way to get at least c ABs and at least d BAs only. Can this be done with dp or greedy?
Who knew giving the contest this late would result in a bad outcome.
Why so few construction problems? xD
In div1D, we can make a smaller answer than "choose one element from each cycle in $$$P$$$, take their max-min multiplied by 2"? I have a solution that gives exactly this minimum but it gets WA.
It is possible to archive answer: 2(#CYCLES-1). Consider p={1,3,2,4} -> cycles {1}, {2,3} {4}. One of the optimal solutions with score 4 is: {1,3,4,2}.
Came up with the exact same minimum, got tricked by the samples.
Good contest, enjoyed it!
I enjoyed it, what's the need to downvote it?
:'( ... Aise hi chalta ha cf pe
Sed.....
This contest was super unbalanced, A-B-C was like easy problems(for my level). Solving D was Like solving E
Complexed Speedforces!
How to correctly split the last sample from (div2) 1686D - Linguistics?
I thought you have to at least split into
B,BABABABAB,B,BABABABABABABA,ABABAand then I can see how to fulfill1 3 2 11, but I haven't found a valid split for1 3 3 10, yet.B = 1 B
BABABABAB = 3 ABs, 1 BA, 1 B
B = 1 B
BABABABABABABABA = 7 BAs
ABABA = 2 BAs, 1 A
Total: 1 3 3 10
Of course! Thanks. Found the bug in my ugly solution 158469628...
For segments of odd length
ABA...AI immediately take oneAand store half the length intany. While handling mytany, when using such a segment forABs, I used the remainder asAs andBs (a -= y; b -= y;instead oftany.push_back(y);)... so I couldn't take a partial segment forBAanymore...head -> desk
thanks for great contest !!!
Wow, you've done incredible job! Congrats on winning this contest!
thank you so much !
Wow orz
ACD1 are nice problems, but overall I dislike the round because all of the problems are purely ad-hoc :(. Would be really nice to have some data structure, DP or algorithmic problems.
It might be that D2 or E fits those categories, but it doesn't really help when those two problems get 5 solves total.
Div 2E / 1C Problem Title is very relevant to summarized participants' feedback
Y div2D so ugly.
weren't there just 4 cases?
3 cases, the odd-length alternating islets are interchangeable regardless of their starting letter.
'D'epressing Contest
Why hacks aren't added yet? so many wrong got ac.
looking for problems [D: F] div2 I think we are talking about the tourist S contest version
however, great contest with great ideas am waiting for the Editorial for Upsolving
people start downvoting the contest, What was the reason ACC to you?
I hacked someone on C
when will my testcase added in question C , waiting...
The problems I solved are really boring but the problems I didn't solve seem pretty good so overall 6/10 good round oomfie
I miss good div2D pblms.
I was waiting for this for a long time, since it probably is my last round before summer. Turns out I was waiting for a speedforces with a huge rating loss for me because I'm not good at solving problems fast. Wow, I feel so betrayed(( i mean that's my fault but I'm sure there is something wrong.
also, why didn't Anton invite other people apart from masters or gms to test the round? Why only 1 specialist from div2? I think that was his mistake, nobody could give appropriate feedback to div2 set, and it ended up being this.
Ratings updated preliminarily. We will remove cheaters and update the ratings again soon!
What about adding Hack test cases? There are so many wrong submissions who got ac on C.
Might have benefited from having more than one div 2 tester, just my thoughts.
This round is complete shit but heavily upvoted. The round 792 had usual problems — and it was heavily downvoted only because the author was not as famous as the author of today's round.
Guys, stop praying for your idol Anton — he might be a good contest coordinator and a good contestant himself but he is not a good problem writer. If you also didn't enjoy this round as much as I did not — hit the downvote button.
Is the round complete shit if you don't like it?
For me at least, having adhoc problems that require algorithmic thinking is better than having 5 Li-Chao Tree problems with heavy constant optimization with very tight TL, but I have to admit that the difficulty curve for this round could have definitely been better, but I still think the problems were good.
I tried to solve Problem D with DFS, and it worked well.. until I got Time Limit Exceeded on a pre-test.
and what's wrong with it?
nothing wrong with it, just sharing experience.
I feel like counting A B AB BA and ABA is enough.
Break string into substrings till 2 consecutive has not come... For example ABABABABBABAA Break down:- ABABABAB BABA A
Now you can see...
I'm getting; wrong answer Jury found the answer but participant didn't (test case 1435) 158465505 not getting why is it so?? can anyone help
if(t == (number of testcases)) print test case 1435.
Giving same error,, not working
it is the way how you can see what's wrong.
5400 ACs for div2 C. Totally seem legit to me.
It was a simple constructive problem
Hi can someone tell me that why does this solution fail the test cases in div2 C while this works fine, I mean we are doing the same thing in both of the solutions just by changing the order of fill up why is this causing an error. I can't understand what's going wrong with the first solution that the second one is taking care of.
In line 35, you first filled in by 1, 3, 5, .... Then in line 38, you filled in by 0, 2, 4, ....
This means the first element filled is NOT in the leftmost slot. The first element (which is the largest one) is begin sandwiched between 2 elements.
The test case of
1 2 3 3 4 5will cause your code to fail. You will try to fill in the array as:x 5 x 4 x 3first, then3 5 2 4 1 3. The first 3 and the last 3 will cause the array to fail.Why do we need to check the array after creating in $$$\text{DIV 2 C}$$$, isn't it enough to check whether any element came more than $$$n/2$$$ times ?? (if $$$n == even$$$)
Can anyone please help why this code gave WA??
1 1 2 3 should return YES. 1 2 2 3 should return NO.
Thanks for wasting 135 minutes of my day. What's the point of only having one Div. 2 tester? Do coordinators truly believe they are some all-knowing beings whose judgement can't be flawed and thus they don't want to deal with feedback for problems they wrote?
What happened?
The Div. 2 round was incredibly unbalanced. ABC had almost the same amount of solves, while D had much, much fewer. I remember at the 50 minutes to 1 hour mark, the solvecounts for ABC were all above 5000, while D had 20 solves. Such issues can be avoided if there are a variety of testers.
Please can anyone tell why my overall ratings is deducted by 13 ...though I was able to submit 2 accepted and one wrong code...my rank was around >7k.
Because you performed worse than you were expected for your rating. It's not like you get rating from solving anything
When will the editorial be out?
Already out
This contest was really fun!..what do you guys think
Hi, sorry if this is not the place to comment about something I'm going to write.
I think I've been falsely flagged by the system for rules violation, you can read its (system) message here:
Basically, it says that my solution for problem C 158431590 significantly coincides with superMAXX's solution 158426434 and dhruvrathi04's solution 158452721.
I guess the system flagged because of this part in the code
But isn't it a pretty common implementation for checking whether each element in the constructed array is a local minimum/maximum? what do you guys think?
MikeMirzayanov and any other Headquarters, can you take a look on this?
MikeMirzayanov and other Headquarters.
Regarding: I got a message from the system that my solution for 1686C - Circular Local MiniMax 158452721 significantly coincides with solutions superMAXX/158426434, Andyoshino/158431590, dhruvrathi04/158452721
I want to inform you that this can only be a coincidence and that you should look into the system again and rectify this error.
I had made 5 submissions for this problem during the contest and all of them had this part of the code which looked similar.
My first submission 158433352 Second Submission: 158436773 Third Submission: 158442044 Fourth Submission: 158448587 Fifth Submission: 158452721
All the codes are written by myself and I have not done any violation. I used my local system for writing the programs during the contest and did not use any online IDE.
I request you to please look into the matter once again and do the needful.
It was really a nice round .
why the graph is not showing rating of this contest now?
Removing cheaters and recalculating the rating change accordingly. It happens after every round
but this time there was no warning message about it...
ya exactly
but my ranked increased by 100 it should be reduced when cheaters are removing
In the standings, uncheck unofficial.
is this round unrated?
no
Nice contest! Thanks!
why contest has become unrated?
Congrats on becoming pupil.
congrats on becoming specialist.. :)
Thanks man!Same to you:)
:)
the contest was great but everything everywhere all at once is a terrible movie, please don't watch it!