### vovuh's blog

By vovuh, history, 2 months ago, translation,

Hello! Codeforces Round #686 (Div. 3) will start at Nov/24/2020 17:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria nooinenoojno Stepanova, Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round. Also thanks to Artem Rox Plotkin and Dmitrii _overrated_ Umnov for the discussion of ideas and testing the round!

Good luck!

UPD: I would also like to thank Ivan Gassa Kazmenko for invaluable help with the round preparation!

UPD2: Editorial is published!

• +402

 » 2 months ago, # | ← Rev. 2 →   -41 vovuh, Will it be almost-copy-pasted-part ?
 » 2 months ago, # | ← Rev. 2 →   -47 :)
 » 2 months ago, # |   -16 I was waiting for this for almost a month. I hope this time Div3 goes well for me.
 » 2 months ago, # |   +29 I wish this round becomes unrated for me soon.
•  » » 2 months ago, # ^ |   +32 I wish this "soon" may not come in between of running contest though:)
•  » » » 2 months ago, # ^ |   0 XD XD. That's the worst feeling in the world!!!
 » 2 months ago, # |   -22 After a long there is a div3 contest looking forward to it . GOOD LUCK!
 » 2 months ago, # |   -75 All the best everyone :)As a 1-gon give me some contribution Xd..
•  » » 2 months ago, # ^ |   -8 as u asked.. contribution given
 » 2 months ago, # |   -25 I am working on making a series of blogs for competitive programming topics, If anyone is interested please message me. It would be a lot of fun.
•  » » 2 months ago, # ^ |   -37 I need someone for making video editorials, and IT IS UNPAID, ONLY FOR COMMUNITY.
 » 2 months ago, # |   +14 And finally the wait is over!
 » 2 months ago, # |   +11 DIV 3 rounds can be risky for higher specialists.
•  » » 2 months ago, # ^ |   +2 Agree
•  » » 2 months ago, # ^ |   0 Why?
•  » » » 2 months ago, # ^ |   +9 Because they have the highest rating for rated participants, they need to get a really good rank to get +ve rating, which is ofc easier said than done
•  » » » 2 months ago, # ^ |   +3 They are the LGMs of Div 3
•  » » 2 months ago, # ^ |   +1 true
•  » » 2 months ago, # ^ |   +7 i think if u are thinking more about rating it will decrease your performance!!! this happens with me
•  » » » 2 months ago, # ^ |   0 it happens to me too
•  » » 2 months ago, # ^ |   +1 Yes! if you are a higher specialist, you need to get a high high high high rank that your rating can go up
 » 2 months ago, # |   +25 Again same question, Why don't we have some extra testers in these rounds(Educational/Div-3)? If I am correct this won't reduce the quality of contest, rather it would increase the contest's quality.Can we please start having some more testers in Educational/Div-3 rounds? As they are rated contests and any issue noticed during contest would just affect participants.
•  » » 2 months ago, # ^ |   +1 I just encountered one more past educational round which was unrated because of an issue with problem A statement. Educational Codeforces Round 64 (Rated for Div. 2)
•  » » 2 months ago, # ^ | ← Rev. 2 →   0 They do have 6 testers in this round. Does it affect the contest quality in anyway, if none of the testers belong to the rating range for which the contest is rated? I am guessing it might affect the order of the problems a little for easier problems, as high rated testers might not notice the difference in difficulty as much as a contestant for whom it is rated. That apart other issues related to questions should mostly be covered
•  » » » 2 months ago, # ^ |   +17 I am just trying to make a point that having a list of testers with different rating group won't adversely affect the contest quality, rather it may improve it.
 » 2 months ago, # |   -10 Ha bhai vovuh ji aajaenge thanks for inviting!
 » 2 months ago, # |   -22 Exicted for the rare div 3 round. Does div 4 round even happens? Hoping to see some nice questions
•  » » 2 months ago, # ^ |   +19 what the hell is that profile pic? get that nudity out of here
•  » » 2 months ago, # ^ |   0 this website is for education purpose ... kindly please REMOVE your DP....everyone is here to learn something please dont spoil the mood of our coders...please remove your DP or changed it to something else ..
 » 2 months ago, # |   -23 More than half of the comments are downvoted ! :-{
•  » » 2 months ago, # ^ |   +7 'Cause of people Like You
 » 2 months ago, # |   +118
•  » » 2 months ago, # ^ |   0 oh your face looks nice though
 » 2 months ago, # |   +6 Is there a way to participate after the 9:35 UTC-5? Sadly, these competitions always happen during my school hours and I really want to participate. :(
•  » » 2 months ago, # ^ |   0 no option except to go for virtual
•  » » 2 months ago, # ^ |   +11 well div3 happens not so often . and i think you can take holiday that day . Afterall it will be worth it . coz we do it that way .
 » 2 months ago, # |   -10 Does anyone know that whether Technocup Elimination Round will be rated or not
 » 2 months ago, # |   -9 yay DIV 3 round
 » 2 months ago, # |   -12 Is this Rated for me? guys?
•  » » 2 months ago, # ^ |   0 Yes, it is.
•  » » 2 months ago, # ^ | ← Rev. 6 →   -21 nice
 » 2 months ago, # |   0 Can't wait to see the problems! Good luck everyone! :D
 » 2 months ago, # |   +1 Wish you all the best ♥
 » 2 months ago, # |   -32 Is it rated?
•  » » 2 months ago, # ^ |   +2 wtf you stole my comment
 » 2 months ago, # |   -13 When will div. 4 return ?
•  » » 2 months ago, # ^ |   +20 i think never :D
•  » » 2 months ago, # ^ |   +1 There's an unofficial Div. 4 round tomorrow. You can check it out here
•  » » » 7 weeks ago, # ^ |   0 ye but it was unrated
 » 2 months ago, # |   0 I hope in this round I can boost my ratings. Best of luck Coders :)
•  » » 2 months ago, # ^ |   0 How was your initial rating(before any competition) 1500? When I gave my first contest, it started from 0. Good luck
•  » » » 2 months ago, # ^ |   0 https://codeforces.com/blog/entry/77890 check it out...
 » 2 months ago, # |   0
 » 2 months ago, # |   0 Good Luck for Everyone :)
 » 2 months ago, # |   0 It's valuable for waiting such long time :)
 » 2 months ago, # |   +5 Finally wait is over. Hope I can get rating above 1000 today:)
•  » » 2 months ago, # ^ |   0 You will man. You will. You once solved 3 questions in div 2. That's surely above 1000. Good luck.
•  » » » 2 months ago, # ^ |   0 Thanks man.
 » 2 months ago, # |   0 Hope the proverb "2 ghante mein rating double" gets true for all my indian fellows and friends.
 » 2 months ago, # | ← Rev. 2 →   0 .
•  » » 2 months ago, # ^ |   0 Good luck, pal.
•  » » » 2 months ago, # ^ | ← Rev. 2 →   0 .
•  » » » » 2 months ago, # ^ |   0 That's great. I hope you are able to crack it.
 » 2 months ago, # |   0 Lol!! why lot of comments are hidden this time...Sadly my mouse isn't working to view them...Any way to see them with keyboard :)
 » 2 months ago, # |   +2 Hope I can reach green this time
 » 2 months ago, # |   0 What is the points distribution for the problems? Or are there none for Div. 3 contests.
 » 2 months ago, # |   0 I want to be pupil! please pray for me! I want to pupil. I cry and cry! please pray for me ! may GOD help me to become pupil! please pray for me.
 » 2 months ago, # |   0 int rating=1134; rating+=150; 
•  » » 2 months ago, # ^ |   +1 cout << "Congratulation! you have reached pupil." << '\n'
•  » » » 2 months ago, # ^ |   +14 damn where is ;
•  » » » » 2 months ago, # ^ |   +10 That's the reason still I am pupil :)
•  » » » » 2 months ago, # ^ | ← Rev. 3 →   -8 .
•  » » » 2 months ago, # ^ |   0 IDE --compilation error
 » 2 months ago, # |   +8 This comment section is shit.
 » 2 months ago, # |   0 Finally a round which is made for me :)
 » 2 months ago, # |   0 5 minutes remaining Be Ready
 » 2 months ago, # |   -7 Good Luck and high rating to all the participants
 » 2 months ago, # |   0 If I submit multiple Accepted solutions, which one will be taken as my final solution (that is, used for others to hack?)
•  » » 2 months ago, # ^ | ← Rev. 2 →   0 DELETED
•  » » 2 months ago, # ^ |   0 all accepted solutions can be used for hacks, and for final testing first accepted will be considered and if failed then second and so on.
•  » » » 2 months ago, # ^ |   +5 So if one of my accepted solutions survive the hacks, then I solve the problem.Is that correct?
•  » » » » 2 months ago, # ^ |   0 Yes.
•  » » » » 2 months ago, # ^ |   0 yup, this is true only for Educational and Div. 3/4 rounds. In regular div 2/1 rounds only last pretest passed submission is considered afaik.
 » 2 months ago, # |   +5 I felt like the dumbest person on the planet on reading this line after wasting 40 mins to solve a #P-complete problem.
•  » » 2 months ago, # ^ |   0 me too!! I'm too sleepy to read wrong question, trying to solve n vertices, m edges and wasting almost all time.
 » 2 months ago, # |   +3 What's the solution of E? Really liked problemsetting (especially F).
•  » » 2 months ago, # ^ |   +20 Hey, video to solutions to everything are available here if you're interested
•  » » » 2 months ago, # ^ |   +7 GOD SPEED
•  » » » 2 months ago, # ^ |   +1 I got the idea for C but completely messed up thinkin about the first and the last digit . BTW that was very fast editorial .SecondThread
 » 2 months ago, # |   0 How to solve E ? F was easier than E for me
•  » » 2 months ago, # ^ |   0 There are 2 paths between all pairs except for adjacent pairs within the root on the cycle of the almost-tree. Details and code are explained here.
•  » » 2 months ago, # ^ |   0 You have an "almost a tree"-graph. Erase the edges from the cycle, then for each pair of nodes of different components there are two paths, and for each pair of nodes of the same component there is only one path.
 » 2 months ago, # |   +1 This contest made me remember the ABC from the past when first four problems are dead easy and last two are not touchable xD
•  » » 2 months ago, # ^ |   +8 F was easy idea wise if you understand binary search & know a data structure(for range min queries like segment tree or sparse table), it was just about implementing.
•  » » » 2 months ago, # ^ |   +3 Now I am "Afraid" because I did not use a Binary search or segment tree or sparse table.
•  » » » » 2 months ago, # ^ |   +12 I agree that other approach will work. But range min query + binary search was definitely the easiest(atleast for me) in terms that it just hit me after a few minutes of reading the statement because that's what was asked to find. When we have some problem asking to find some sort of triplet/pair/quadreplet the first thing i do is fix some of them and then think.
•  » » » » 2 months ago, # ^ |   0 What was your approach?
•  » » » » » 2 months ago, # ^ |   0 It is I think same as Gassa's approach in the editorial.
 » 2 months ago, # | ← Rev. 2 →   0 Nice contest! I just want to ask what's the trick behind F. I've tried doing it using two pointers + segment tree, but that fails the test 2. My idea may be too off the right track, but that's what it is. Thanks.EDIT: Now I see instead of 2 pointers I could have used binary search to solve, better luck next time I guess.
 » 2 months ago, # |   0 Guys what does it mean that there is a penalty of 10 mins for each wrong submission???
•  » » 2 months ago, # ^ | ← Rev. 2 →   0 Your final score time would be added with the penalties. For eg : lets say your total time is x mins and you have 2 wrong submissions then the final time penalty that would considered while ranking the leaderboard would be x + 20.
•  » » » 2 months ago, # ^ |   0 Thanks man!
 » 2 months ago, # |   -7 My Explanations for ABCD AHere given a positive integer n > 1 we want to print a permutation of distinct integers from 1 to n such that ith integer is not equal to i Consider the permutation {1,2,3 .. n} if we shift each element from 2 to n one position left and then print 1, that is {2,3,4 ...,n,1} then we are done Since here we are print the next integer for the positions 1 to n-1 and 1 at position n (n != 1),this is one of the required permutations.Topic : Constructive AlgorithmBHere we are given an array of n integers. We need to print the index of an integer which is unique and minimum among all possible such integers. So we maintain a map to track the frequency of each element. Iterate the map, check if frequency is one or not , if it is one then minimize the answer. if there is no unique element then print -1.Topic : Implementation, Brute ForceCHere we are given an array of positive integers We need to choose an element from this array of integers and use that integer to perform operations The operation is as follows: If we choose x , then remove any subbarray not containing xWe need to report the minimum number of operations So we can brute force all the distinct integers in the array and report the minimum answerTo do this , we maintain a map from integers to vector of integers. This map is from each unique integer in the array to it's indices .For example let say the array as given in the sample case is [1, 2, 3, 1, 2, 3, 1] then our map will be [{1,[0,3,5]} , {2,[1,4]}, {3,[2,5]}]To get the minimum number of operations for any given integer x (Let say), we remove all the indices which are not equal to x This can be done by doing the operation when the difference b/w consecutive indices of x is more than 1For example take [1, 1, 66, 1, 77,88 , 1, 1] with x = 1, Now we have the indices of 1 as [0 ,1 ,3 ,6 ,7 ]So we check we do the operation when consecutive indices have difference of more than 1. Here it is operation 1 — 1 and 3 (we remove 66) operation 2 — 3 and 5 (we remove 77,88)Similarly do the operation for all unique integers and report the minimum ansTopic : Implementation, Brute ForceDWe are given an integer n We need to print a sequence of maximum length such that it's product is n and for each element the next element(if exists) is divisible by the current element First we factorize the given integer n and obtain a map from prime factor to it's power. now we need to print the desired sequence. Since we need to print a sequence of maximum length, we sort the prime factors by their powers, so that we greedily have the element which occurs maximum times first. Let say we have 360,so we make a vector of pairs and sort it by power. that is {2,3} {3,2} {5,1}Now we iterate the vector of pairs, until the powers are >= 1 We insert the element until the remaining number is divisible by the current element going to be insertedFor example we have 2 , remaining is 360/2 = 180, so we insert it. ans is {2}we have 2, remaining is 180/2 = 90 , so we insert it . ans is {2,2}we have 2 remaining is 90/2 = 45 , but 45 is not divisible by 2 , so we can't insert 2 , hence we insert 90.This algorithm produces the maximum sequence since we are greedy picking the prime factor with maximum power.Topic : Greedy, Implementation, Sorting
•  » » 2 months ago, # ^ |   0 Hi, thank you so much for sharing your ideas! I had implemented the very same idea for D, but I got a WA submission. Could you please help me with this. Thanks in advance!
 » 2 months ago, # |   0 Will the formula for $E$ be: $n(n-1)-(n-no \,of\, vertices\, in \,the \,cycle)$
•  » » 2 months ago, # ^ | ← Rev. 2 →   0 No, it would just pass the sample, try on this graph: {1 2}, {2 3}, {3 4}, {4 1}, {1 5}, {5 6}
 » 2 months ago, # |   +6
•  » » 2 months ago, # ^ |   0 Ya I did that too
•  » » 2 months ago, # ^ |   0 true 100% i was like that XD
 » 2 months ago, # |   0 What is the case 7 on the problem D?
•  » » 2 months ago, # ^ | ← Rev. 2 →   0 Try for 75Answer is2 5 15
•  » » » 2 months ago, # ^ |   0 My code produces the right answer there.
•  » » » » 2 months ago, # ^ |   0 Okay. My 1st submission failed and I thought of this case. My code failed for this too. Modified the logic and it passed
•  » » » » » 2 months ago, # ^ |   0 I already know my error. It was a noob-bug during a sieve.
•  » » 2 months ago, # ^ |   0 Yes, even I got a WA on Test 7!
 » 2 months ago, # |   0 How to solve problem F? Well I applied two pointer approach so it was bound to get TLE. So, I guess it would include some binary search solution. What was your approach?
•  » » 2 months ago, # ^ |   +13 I binary sparse in answer. Good Qhuesion. Writer very very intelligent. You also sparse tabul. Else not accept.You understand me?
 » 2 months ago, # |   0 Where can I get the editorial for this contest? I am new to codeforces. Any help would be apprecited.
•  » » 2 months ago, # ^ |   0 I think tomorrow, when the hacking fase is over
•  » » 2 months ago, # ^ |   +7 Usually the editorial gets posted eventually on the problem announcement. In the meantime, there's my solution video or neal's livestream.
 » 2 months ago, # |   0 easy peasy Japanesey
 » 2 months ago, # | ← Rev. 2 →   +1 https://www.youtube.com/watch?v=7WfLE_IIDqA&t=2809s&ab_channel=AoxiangCui this Youtuber live-streamed the live contest today that's the reason there are so many submissions for problem D also.please correct me if I am wrong as I saw the video a just after the contest and it had 83 views on it
•  » » 2 months ago, # ^ |   0 This is sad.
•  » » 2 months ago, # ^ |   0 Did that person now know it was a live contest? anyway, how did you find it?
•  » » 2 months ago, # ^ |   0 Oh cmon... people like us tried to solve it very sincerely.
•  » » 2 months ago, # ^ | ← Rev. 2 →   +5 Nope, she is a very experienced streamer. And the video was uploaded at the same moment when the contest ended. And it was never a live stream though
•  » » 2 months ago, # ^ |   0 Boy maybe there are so many submissions for D because it is very easy
 » 2 months ago, # |   0 where is the wrong in this code?wrong answer 161st numbers differ — expected: '2', found: '1'can I know it?http://codeforces.com/contest/1454/submission/99493118
•  » » 2 months ago, # ^ |   -23 You get wrong answer because you are wrong code. Write beautiphul code. Else not accept. You write in Jabha...hahahahahaha. I not like jabha. You not write jabha. Else I not see your code.
•  » » » 2 months ago, # ^ |   +1 her name is java my dear, not jabha haha
 » 2 months ago, # |   0 Is there anybody who solved problem D with backtracking? :)
•  » » 2 months ago, # ^ |   +11 are you a masochist person?
•  » » » 2 months ago, # ^ |   0 Excuse me, optimized brute-force.
 » 2 months ago, # |   +14 The problems were awesome!! The magic of Data Structure! ;)
•  » » 2 months ago, # ^ |   -18 Problems good. But you not good. You like InshaAllah.
 » 2 months ago, # | ← Rev. 3 →   +5 submission: 99493024 if(n==100000123) { cout<<1<
•  » » 2 months ago, # ^ |   -6 This codes are written with with the intent in hacking. There is no fault with system tests. No matter what done, these can't be avoid. Testing not culpableヽ(ಠ_ಠ) ノ. Today was good contest. I always want to give this good contest.
 » 2 months ago, # |   +4 Today contest good contest. I very very like today contest. Make tomorrow contest. I give tomorrow contest.
 » 2 months ago, # |   +3 E was an awesome problem!
•  » » 2 months ago, # ^ |   0 How did you solve?
•  » » 2 months ago, # ^ |   0 I got an AC to it, one minute after the contest.
 » 2 months ago, # |   0 Getting F a couple of minutes after the round's end :(
 » 2 months ago, # |   +5 Nice set of problems
 » 2 months ago, # | ← Rev. 2 →   +1 .
•  » » 2 months ago, # ^ |   +5 His dog was competing.
 » 2 months ago, # | ← Rev. 2 →   0 About B and C. Max n is 2*10^5. If I iterate all possible elements, it takes too much time. If I iterate only to 10^4 — I receive positive check. Is this clear ?
 » 2 months ago, # |   +1 Does E,F problems are actually meant to solved by div. 3 users ? Really, I saw some red coders took 30 minutes to solve E.So how could they expect a div. 3 Candidate to solve problems like E,F in an hour ?
•  » » 2 months ago, # ^ |   +1 Not all problems are meant to be solvable during a contest, some are their to learn from, that is all. And it is not that E and F are unsolvable by people with rating <1600.
•  » » 2 months ago, # ^ |   +7 Well, I solved both E and F in the contest and I'm a gray coder, so it is indeed possible.
•  » » » 2 months ago, # ^ |   +17 Yeah, but you are either an alt or have done lots of competitive programming on platforms other than cf.
 » 2 months ago, # |   0 I solved problems B and C without realizing that a_i <= n, and I was very wasteful in general.I was still very far from the time limit (It would be cool if someone would hack me :P).I implemented B using a map and a set and even also sort, and I implemented C using a map.Were those constraints meant to make implementation easier?
 » 2 months ago, # |   0 I learned how to play hack. After 150 failures, I succeeded twice.You also learned how to use the generator. Div3 was very useful.
 » 2 months ago, # |   0 I did D in a weird way. Checked every divisor's (except 1) highest power that divides n. Among them took the one with maximum power then generated the answer from that. Submission: 99476498
 » 2 months ago, # |   0 nice problems(specially C) but very weak test cases :(
 » 2 months ago, # |   0 i participated in this contest but in my profile it is still showing unrated, i solved 1 problem though
•  » » 2 months ago, # ^ |   0 the rating changes aren't announced yet wait a bit more :)
 » 2 months ago, # |   +1 Thanks vovuh for a round with such elegant problems. Nice learning. Very balanced set of problems which were very carefully crafted and well organized. I am sure this took a lot of efforts from you and team! Can't even emphasize enough on how much of these efforts from you guys help others like me, to enjoy and learn from CF competitions.Appreciate your efforts!! Thanks again!!
 » 2 months ago, # |   0 Hello! I have a question! If I took part here and solved tasks, then I understood that I can't solve other tasks, so I turned off my laptop and went out. And now I can't find me in the table, and I looks like that I didn't take part here. What do I need to do after finishing contest?
»
2 months ago, # |
-6

# include <bits/stdc++.h>

using namespace std; int main() { int t;cin>>t; while(t--){ int n; cin>>n; int a[n],b[n]; for(int i=0;i<n;i++){ int x;cin>>x; a[i]=x; b[i]=x; } sort(b,b+n); int flag=0; vector c;int j=0; for(int i=0;i<n-1;i++){ if(b[i] !=b[i+1]){ c.push_back(b[i]);}

}
/*int repeat=0;
if(b[n-2]==b[n-1]){
repeat=1;
}*/

//if(repeat!=1){
c.push_back(b[n-1]);

//}
/*for(long long i=0;i<c.size();i++){
cout<<c[i]<<" ";
}*/
//cout<<endl;
long long segment=0;
long long mini=INT_MAX;
for(int p=0;p<c.size();p++){
segment=0;
for(int i=0;i<n;i++){
//for(int k=i+1;k<n;k++){
if(a[i]!=c[p]){
while(a[i]!=c[p] && i<n){
i++;
}
segment++;
}
//}
}
/*if(c[p]!=a[0] || c[0]!=a[n-1] ){
segment++;
}*/
//cout<<segment<<","<<c[p]<<endl;
mini=min(mini,segment);
}
cout<<mini<<endl;

help!, its giving tle in test case-3 can anyone optimize it ,will be appreciated .......

 » 2 months ago, # |   +4 Very nice contest with interesting problems. Much thanks to vovuh and MikeMirzayanov !!!
 » 2 months ago, # |   0 Why its taking so much time for declaring results.
 » 2 months ago, # |   0 When will ratings change?
 » 2 months ago, # |   0 handle -> just_try_to_solve has coppied my solutions, as I was using ideone, My all solutions are skipped what should i do, even this person agrees that he copied, then why my solutions are skipped, Please tell something, that person who copied my solution is saying that he agrees that he copiesplease put him out of contest, not me
•  » » 2 months ago, # ^ |   0 screenshot of chat with himhttps://drive.google.com/file/d/14hzFny14-l90m8PRB_MDMfWywc9FpeTS/view?usp=sharing
•  » » 2 months ago, # ^ | ← Rev. 2 →   +6 No, you are the one who deserve to be out of contest for not reading/following the rules.
 » 2 months ago, # |   0 hello,I want to know whether the result are published for this round. because i am not seeing any up and down in my rating also a message is comming "Your rating are rolled back and will be back soon".pls help during the contest i did a misktake which is after submitting the code for first problem which passes all the pretest i submitted it again with the code of problem B and it gives a compilation error then i correctly submit the code of problem A as well as problem B.pls help me
•  » » 2 months ago, # ^ |   0 Not an issue , the most recent submissions are judged for evaluation . Ratings are rolled back quite often , there can be many reasons for it , Just chill , Ur recent submissions will be only counted.
•  » » » 2 months ago, # ^ |   0 Thanks Yash for your help.I only solved 2 problems in div 3 and gained 164+ rating .Thankyou
 » 2 months ago, # | ← Rev. 2 →   +5 Last div.3 was rated for <=1600. But how it is rated for This id ? Before participating his rating was 1601.
•  » » 2 months ago, # ^ |   0 Hacker.. :-O
•  » » 2 months ago, # ^ |   0 Before rating change of this round there was rating recalculation of the Codeforces Round #685 (Div. 2). He probably was < 1600 before recalculation
•  » » » 2 months ago, # ^ |   0 Got it , thnks