Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

By Vladosiya, history, 4 months ago, translation,

Hello! Codeforces Round #776 (Div. 3) will start at Mar/08/2022 17:35 (Moscow time). You will be offered 7-8 problems 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 a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7-8 problems and 2 hours and 15 minutes 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 participant of the third division, you must:

take part in at least five 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 our work. Problems have been created and written by ITMO University teams: MikeMirzayanov, MisterGu, myav, Gol_D, Aris, SixtyWithoutExam, me Vladosiya.

Also many thanks to mango_lassi, espr1t, karemo, starboy_jb, Fly_37, omikad, Katya_Goryachkina, Omja, teraqqq, Bugman, Jostic11, yorky, _4dr_ and doreshnikov for testing the contest and valuable feedback.

Good luck!

UPD: Congratulations girls on International Women's Day <3.

UPD 2: Editorial

• +201

 » 4 months ago, # |   +119 mango_lassi tested so good he got mentioned twice. ORZ
 » 4 months ago, # |   +3 Good luck to everyone !
 » 4 months ago, # |   +16 This will be an important contest for me, the wait has been long, let's hope to turn blue.
•  » » 4 months ago, # ^ |   +4 Me too.
•  » » » 4 months ago, # ^ |   +4 So glad I finally got blue
•  » » » » 4 months ago, # ^ |   0 Congrats!
•  » » 4 months ago, # ^ |   +5 This will be an important contest for me, the wait has been long, let's hope to turn Green!
•  » » 4 months ago, # ^ |   +2 You have solved so many problems, I will add you to my friend.
•  » » 4 months ago, # ^ | ← Rev. 2 →   +7 rahul_rax You became expert without participating in this round..!
•  » » » 4 months ago, # ^ |   +5 Yes, I just saw, after plage check, I got a +1 rating, and reached expert. All the best for today's round.
•  » » 4 months ago, # ^ |   +4 This round is not rated for you now
•  » » » 4 months ago, # ^ |   +4 Yes, This will be my 1st unrated round. Yaya!!
•  » » » » 4 months ago, # ^ |   +5 For me too. Congrats
•  » » » » 4 months ago, # ^ |   0 you're exactly 1600 and they wrote above, round is rated for participants upto 1600.
•  » » » 4 months ago, # ^ |   0 Bro plz tell me why my ratings not increased I have given the contest and have ratings under 1600
•  » » » » 4 months ago, # ^ |   0 Ratings are not updated for anyone till now
•  » » » » » 4 months ago, # ^ |   0 I just wanted to ask, hh
•  » » » » » 4 months ago, # ^ |   0 How much time it takes to Update ratings after Contest
•  » » 4 months ago, # ^ |   +1 Only expert for whom the round is rated.
 » 4 months ago, # |   +49 First unrated div3 for me, yay :)
 » 4 months ago, # |   0 I might become pupil after this round. I am excited :)
•  » » 4 months ago, # ^ |   0 Sure you can get what you want!
•  » » » 4 months ago, # ^ |   0 1
•  » » » 4 weeks ago, # ^ |   0 I got it
•  » » 4 months ago, # ^ |   0 all the best bro , I hope you reach green today
•  » » 4 months ago, # ^ |   0 welp , this did not age well.
 » 4 months ago, # |   +27 Guess who is skipping school tomorrow hahaha
 » 4 months ago, # |   0 First div 3 contest for me yay!! thanks to all the testers and it will be challenging as we have to solve more problems in less time!!
•  » » 4 months ago, # ^ |   0 Unfortunately Mike broke your dream :( You got plag cheater !
•  » » 4 months ago, # ^ |   0 Good luck bro
 » 4 months ago, # | ← Rev. 2 →   +15 Is this challenge suitable for beginners?
•  » » 4 months ago, # ^ |   +24 Yes, significantly easier than Div2s and Div1s I would say
 » 4 months ago, # |   0 good luck guys:)
 » 4 months ago, # |   +1 Div3 contest, long time no see
 » 4 months ago, # |   0 At long last...
 » 4 months ago, # |   +28 I am happy to participate in a contest on by birthday. I wish to be pupil after this contest. Wishing everyone positive delta. GL&HF!!
•  » » 4 months ago, # ^ |   +2 Happy Birthday
•  » » 4 months ago, # ^ |   +40 Oh its your b'day? Here's an integer array as a gift. [1,2,3]
•  » » 4 months ago, # ^ |   +3 Thanks, @nyet and @happy_new_year_2022
 » 4 months ago, # |   +31 As a first time tester for a Codeforces round. Please give me some upvote :).Good Luck and High Rating.
 » 4 months ago, # |   +6 Good to see a contest after every one two days. Well done codeforces!!
 » 4 months ago, # | ← Rev. 2 →   0 I like div.3 thanks codeforces great site
 » 4 months ago, # |   0 Codeforces is a great platform to develop skill on coding besides build up logic.
•  » » 4 months ago, # ^ |   +26 Thanks for the information!The world would have never known, if not for you to write this useless comment
 » 4 months ago, # |   -7 Whenever You are having tough div 2 contest and you got -ve rating change then arrives Div 3 for resque . I loved them :) .
 » 4 months ago, # |   +1 Hope I can solve today's problems and get my handle colored.
 » 4 months ago, # |   +1 Very excited for div3 after a long time. All the best everyone.
 » 4 months ago, # |   0 Hey Codeforces, please add a calendar invite to every contest, it would be great.
•  » » 4 months ago, # ^ |   0 You should try this...! Spoilerlink...
 » 4 months ago, # | ← Rev. 2 →   -9 Dear contest, make me > 1700 rated pls. thx in adv, wil pay the <> by tomorrow evening
 » 4 months ago, # |   0
 » 4 months ago, # |   0 Vladosiya's Div 3 rounds are really good. Looking forward to some great problems in the contest.
 » 4 months ago, # |   +11 Nice gift for 8th of march , and here's my best wishes to you on International Women's Day 2022 ! Wishing a very happy Woman's Day to strong, intelligent, talented and simply wonderful women of this world! Don't ever forget that you are loved and appreciated. And also good luck on Div 3 !
•  » » 4 months ago, # ^ |   0 Good luck also for mediocre and normal women (not only talented and strong ones) which also deserve respect
•  » » » 4 months ago, # ^ |   0 maybe (simply wonderful) means also means what you said :) ?
 » 4 months ago, # |   0 How long have I been waiting for this moment...
 » 4 months ago, # |   0 Can anyone help me understand why untrusted people will not be included in the rankings? The round is rated for anyone having a rating less than 1600 anyway so how is the decision having any effect on rating changes?
 » 4 months ago, # |   -8 Good luck at International Women's Round #1!
•  » » 4 months ago, # ^ |   0 Actually this is not round #1 lolAnother Mar.8th Round click here
 » 4 months ago, # | ← Rev. 2 →   0 .
 » 4 months ago, # |   0 Lets Rock!! newbies
 » 4 months ago, # |   0 Finally** DIV 3** contest :)
 » 4 months ago, # |   0 Plz, no number theory in problems
•  » » 4 months ago, # ^ |   0 Plz, number theory in problems
 » 4 months ago, # |   +13 Finally my first participation as unrated one.
•  » » 4 months ago, # ^ |   -8 how to check if I am doing unrated one?
 » 4 months ago, # |   +8 implementation forces
 » 4 months ago, # |   +6 It took me 20 minutes to understand the statement output 2 numbers in next n lines of the problem C
 » 4 months ago, # |   +13 Really cool round. Thanks to creators
 » 4 months ago, # |   +3 Logic for C please?? is it implementation based problem
•  » » 4 months ago, # ^ |   +1 Take 2 * n minimums and after sort them by coordinate
•  » » » 4 months ago, # ^ |   0 how can we sort the array in a way that we would know the index of every element before sorting with O(n log n) solution ?
•  » » » » 4 months ago, # ^ |   0 Just store indexes somewhere, for example make a tuple (x, w, index)
•  » » » » 4 months ago, # ^ |   0 I used map, where key is w and value is index in not sorted vector
 » 4 months ago, # |   0 I hate test case 27 of G.
 » 4 months ago, # |   +3 when i read E I thought it's too easy but then i realized there are things i didn't count in my solution and it was too late
•  » » 4 months ago, # ^ |   0 i thought too what ever i was thinking should work but it didn't. then i changed my perspective and did some implementation with multiset to check what would be answer if i change $i^{th}$ exam date.
•  » » » 4 months ago, # ^ |   +1 I think you should only change the smallest value but I didn't check that maybe if i delete a1 for example and put it somewhere else then maybe a2-a0 is the new smallest value
•  » » » » 4 months ago, # ^ |   0 yes you are right only difference can be made by removing minimum gaps. also need to make sure there are two ways to remove each gap that is not the left most. and also the way i implemented it didn't hurt to check every index, so to keep code a bit simple i didn't think of optimizing on that
 » 4 months ago, # | ← Rev. 2 →   +23 Problem G: Counting Shortcuts is a great extension of ABC211: Number of Shortest PathsIn fact, you only need 5 to 6 lines of code changes in the Atcoder version to get it working. I've summarized my approach for ABC211: D in this commentHow to extend it to this version?First, break it into 3 parts. If the shortest path is of length $\delta$, we need to compute paths of length $\delta - 1$, $\delta$ and $\delta + 1$. Computing $\delta - 1$ is a trick question, you should figure that out yourself. Computing $\delta$ is same as ABC211:D. So, we just need to compute paths of length $\delta + 1$.As mentioned in the previous comment, edges in a BFS tree can only exist between nodes of same level (horizontal edges) or consecutive level (vertical edges). If we observe a shortest path, it needs to descend the tree at each stage, i,e, it can only contain vertical edges. A path length of $\delta + 1$ implies that we added one extra edge in our shortest path. Notice that this extra edge cannot be a vertical edge, as we will miss the target vertex by 1 height. So, we are allowed to add one edge between nodes on the same level. This simplifies it to, How many paths from source to target are present such that you are allowed to use EXACTLY 1 edge at same level. Let's rename the DP of the previous problem to $dp\_tight$, and the DP array of the new problem to $dp\_loose$. $dp\_tight[node]$ is the number of ways to reach $node$ from $source$ when you are not allowed to use unnecessary edges.$dp\_loose[node]$ is the number of ways to reach $node$ from $source$ when you are allowed to use exactly one extra edge.To compute $dp\_loose[node]$, we need to consider every edge on the same level (horizontal edges), and increment the $dp\_loose$ of one vertex by $dp\_tight$ of the other vertex. Since we should precompute the DP values of all nodes on the same level before populating DP values of next level, we can use a temporary queue for each level (Although I think we can do it in one pass too).Time Complexity: $O(N)$ Codequeue bfs; vector level(n, -1); vector dp_tight(n, 0), dp_loose(n, 0); level[source] = 0; dp_tight[source] = 1; dp_loose[source] = 0; bfs.push(source); while(not bfs.empty()) { int q_size = bfs.size(); queue wait; while(q_size--) { auto now = bfs.front(); bfs.pop(); wait.push(now); for(auto child : adj[now]) { if (level[child] == level[now]) { add(dp_loose[child], dp_tight[now]); } } } while(not wait.empty()) { auto now = wait.front(); wait.pop(); for(auto child : adj[now]) { if (level[child] == -1) { level[child] = level[now] + 1; add(dp_loose[child], dp_loose[now]); add(dp_tight[child], dp_tight[now]); bfs.push(child); } else if (level[child] == level[now] + 1) { add(dp_loose[child], dp_loose[now]); add(dp_tight[child], dp_tight[now]); } } } } long long res = dp_tight[target] + dp_loose[target]; res %= mod; cout << res << "\n"; 
•  » » 4 months ago, # ^ |   0 I think you mean Problem G.
•  » » » 4 months ago, # ^ |   0 Thanks, corrected.
 » 4 months ago, # |   +12 Feel like output for C could have been simplified without taking away from problem difficulty. But pretty fun contest anyways.
•  » » 4 months ago, # ^ |   0 Took me eternity and 2-3 wrong submissions to figure that out on my own
 » 4 months ago, # |   +18 Anyone else ? Who wasted 10 minutes thinking about output in C because of poor language
•  » » 4 months ago, # ^ |   0 yeah, if it weren’t for the useless output of indexes in C, I wouldn’t get a bunch of execution errors and would have passed 20 minutes earlier, perhaps there would have been enough time to solve task D
•  » » 4 months ago, # ^ | ← Rev. 2 →   0 +1 30 minutes*
•  » » 4 months ago, # ^ |   0 I got the logic really early, but spent 30 minutes after misreading allotment of index i to coordinate. I alloted them according to their position of number line and spent a lot of time there :(
 » 4 months ago, # |   +6 I will reach expert if not hacked.
•  » » 4 months ago, # ^ |   0 Congrats
•  » » 4 months ago, # ^ |   0 Can you explain your approach for E?
•  » » » 4 months ago, # ^ | ← Rev. 5 →   0 use a sorted map, such as TreeMap in Java, then maintain all the gaps' count; Try to remove a[i] for i in [1, n — 1], you will have 2 cases: case 1. insert a[i] in a gap where it has exams on both ends; you will pick the largest gap maxGap and put it in the middle to get a new gap of (maxGap — 1) / 2; case 2. insert a[i] at d with a new gap of max(0, d — a[n] — 1); take the better one of the above 2 cases and compare it with the smallest key and update answer. During step 2, remember to update your map accordingly: first remove deleted gaps and add newly generated gaps. After processing a[i], restore the map for the next element.I had this idea but forgot to take care of the special case where if we put a[i] at the end on d, it is just d — a[n] — 1 instead of (maxGap — 1) / 2. Feels bad :(I've added some comments in my submission, the idea is fairly straightforward: 148911439
•  » » » » 4 months ago, # ^ | ← Rev. 2 →   0 i tried using map in C++.... my last brain cell is trying to figure out why my code mutates the map in each iteration, tried using delete when key's value is 0, but when i add some value to it, keys are not appearing back.........edit: i mistakenly deleted the value of the map not the key T_T, still got WA tho
•  » » » » » 4 months ago, # ^ |   0 I ran into a similar key not found error during contest. I think it is because the way I updated the sorted map.
•  » » » » 4 months ago, # ^ |   0 but would'nt the complexity become more O(n*n) or O(n*nlogn)? That should give tle. You are doing this O(n) computation for every a[i].
•  » » » » » 4 months ago, # ^ | ← Rev. 2 →   0 it is O(N * logN), each iteration we uses 6 map operations (3 insert, 3 removal). Building the maps takes O(N * logN) then for each iteration, it takes 6 * log(N) time.
•  » » » 4 months ago, # ^ |   +1 I binary searched the answer (maximum μ possible by shifting the element with minimum rest days before it). You can see that for some μ: all smaller values are possible to achieve, this forms an array of True and False: T T T T T F F F F ...So now you can apply binary search to find the last T (Last T is maximum possible μ). Now, to find if the current candidate for μ is T or F. You can write a function F(M) which will return True/False if rest days before A[i] <= M for all i. You can try to achieve this by removing the element E with smallest rest days before it and placing it in between any two elements with maximum rest days.My implementation for F() is very bad and I believe you will find much better code for understanding in top standings. Please ask if there is anything you didn't understand.
 » 4 months ago, # | ← Rev. 2 →   +9 C is the one of the worst questions I have seen in a while. The last paragraph of the problem is so confusing, even looking at samples didn't help. I had the idea in 5 minutes, but took 4 WA's on test 1 just because the output formatting is wrong. Also, what does this line have anything to do with anything? The order in which you output the endpoints of a segment is not important — you can output the index of the left endpoint first and then the number of the right endpoint, or the other way around. This just makes the problem even more confusing. And lastly, would it kill you guys to give the initial points as sorted? So much extra implementation just to print the indices of the points in original order after god knows how many times I used sort().On the other hand, the problem itself and the idea behind it is nice. I just don't like the fact that I have to spend 10 minutes on thinking about the solution + implementations and then 30 minutes to properly format the output just so that it passes samples.
•  » » 4 months ago, # ^ |   0 agree
•  » » 4 months ago, # ^ |   0 Well, if you look at the shortest solutions the problem is very simple to code.I also did not find the simplest solution and ended up needing 60+ lines of C++.I had prefix sum array, suffix sum array, set when calculating the sums (dealing with inserting the biggest element or the same element in the heap), and then had to rediscover the pairs after finding the minimum.The complexity was $O(m \log{m})$ for initial sort, and then $O(m \log{n})$ for the suffix sums and then $O(m)$ for min, and then again $O(m \log{n})$ for discovery of pairs.I have no idea how I can simplify my thinking for the future.On every contest I participated I wrote too much code, even if it was correct, it was just too much unnecessary stuff.
 » 4 months ago, # |   +17 Question C was worded so poorly!
 » 4 months ago, # |   0 amazing problems) going to become a pupil
 » 4 months ago, # |   +6 too heavy implementations
 » 4 months ago, # |   -8 I am beginner and Today i am able to solve one problem first one. is it good for me
•  » » 4 months ago, # ^ |   0 If you at least got idea of question 2 then you are at par with average pupil I guess!
 » 4 months ago, # |   +8 ImplementationForces
 » 4 months ago, # |   0 Really amazing contest. Thanks for creating this.
 » 4 months ago, # |   0 Open hacking means if I fail in hacking a solution it would not negatively affect me?
•  » » 4 months ago, # ^ |   +1 Yes, by hacking you can only win.
•  » » » 4 months ago, # ^ |   0 thanks.
 » 4 months ago, # |   0 Can we get -1 in D?
•  » » 4 months ago, # ^ |   +5 No. It is always possible to sort the array. Think of it as bubble sort, but use rotates instead of swaps. Every time we move the greatest element to the right, and repeat the same process on the remaining elements until the array is sorted.
•  » » » 4 months ago, # ^ |   0 Can you elaborate on what do you mean by Every time we move the greatest element to the right ?
•  » » » » 4 months ago, # ^ |   0 Go in reverse. Think about how many rotations are required to move n back to the last index. Now look at the array till n-1 index only and do the same thing.
•  » » 4 months ago, # ^ |   0 no, it is always possible to sort an array by rotating its prefix. actually what i have observed, this fact is used in quite some problems. For instance, this problem
•  » » » 4 months ago, # ^ |   0 Thanks for sharing. I wrote a -1 condition in the contest without thinking much
•  » » » » 4 months ago, # ^ |   +2 It's better to have it and don't need it than need it and don't have it.
 » 4 months ago, # |   +1 Is it necessary for the answer of Problem G to module 1000000007?
•  » » 4 months ago, # ^ |   +12 YesIt is easy to construct a test case for which answer is $2^k$ if $n=3k+1$.
 » 4 months ago, # |   +3 is there a solution for E that does not involve too many caseworking? my solution had to consider like 6 cases to pass.Also, props to the very strong sample case that actually helped a lot
•  » » 4 months ago, # ^ |   +1 Binary search, to check if x is okay find first gap with length < x and try to remove one of endpoints of the gap. Try to place the removed exam in midpoint of gaps, or at the end of session.
•  » » » 4 months ago, # ^ |   0 you don't really need binary search tho
•  » » 4 months ago, # ^ |   0 you can check out my solution, I made it pretty similar to yours. solution
 » 4 months ago, # | ← Rev. 2 →   0 Problem G is very similar to this problem, with the subject of weighted directed graph;Additionally, more sophisticate version is NOIP2017-S P3953, with the restrict of weighted directed graph($w_i \ge 0$), to calculate the number of ways of path length no more than minimum_path + k.
•  » » 4 months ago, # ^ | ← Rev. 2 →   0 It is the exact same as the problem [here](https://github.com/T1duS/CompetitiveProgramming/blob/master/Olympiad/IOITC/2020/AlmostShortestPaths%20(EN).pdf ). The same link contains the intended solution as well.
 » 4 months ago, # |   +32 It's funny that there is no pretest with answer >=998244353 in G:)
•  » » 4 months ago, # ^ |   0 Yes, ridiculous
 » 4 months ago, # |   +4 Is there an O(n) time complexity solution for D?
•  » » 4 months ago, # ^ |   0 misread D's constraints, for almost 1.5 hrs was trying to find O(n) for D but couldn't:(
•  » » » 4 months ago, # ^ |   0 same bruh :( wasted lot of time
•  » » 4 months ago, # ^ |   0 Dunno, but you can do it in O(nlogn) with implicit treap.
 » 4 months ago, # |   0 is anyone else getting TLE on problem C??
•  » » 4 months ago, # ^ | ← Rev. 3 →   0 You got TLE because every time , u input a point , u are sorting the vector again and again Here is the accepted submission : 148914881 Also avoid using unordered_map(directly without any custom hash), You can read more about it here : https://codeforces.com/blog/entry/62393Accepted submission with map instead of unordered_map : 148914850
 » 4 months ago, # |   0 How to solve G? any hints?
•  » » 4 months ago, # ^ |   +3 dp on Bfs tree
 » 4 months ago, # |   -8 Video Editorial for A-E for anyone looking
 » 4 months ago, # | ← Rev. 2 →   0 I try to hack c but i got Unexpected verdict what is this mean ?!
 » 4 months ago, # |   +32 There is an issue with the problem G: the variable $t$ has been reused. Please fix immediately. Highest priority.
 » 4 months ago, # |   0 Hints for problem E ?
•  » » 4 months ago, # ^ | ← Rev. 4 →   0 I think the way I solve wasnt the expected solution but try this: hint 1Which exam should you remove for the optimal solution (there are one edge case but we'll discuss it later) hint 2Where should you place it? SolutionThat's pretty much the problem, you should look the one that have less rest before it and remove from the array, then let's look for the biggest gap between two exam and divide it by two (you'll split this into two with rest of equal size) or the last gap (last exam to the end) and place the exam you removed in the middle of the biggest gap (or at the day d).Sometimes (like in the sample test) it is optimal to do this process with the exam before the one with less rest, so we'll also try with it and keep the greatest value.Here is my code: 148929577
 » 4 months ago, # |   0 can we do d in o(n)?
•  » » 4 months ago, # ^ |   +3 As we think it can't be solved faster than O(n * log(n))
 » 4 months ago, # | ← Rev. 2 →   0 hope to be SpecialistOh, I submitted B for three times. I might not be Specialist
 » 4 months ago, # |   +80 The pretests of G were so weak that I used 998244353 as the modulo in this problem and passed them!But today I was hacked!
•  » » 4 months ago, # ^ |   +24 fun fact:the answers to pretests after 12 are all 1 :)
 » 4 months ago, # |   0 did rating change for anyone? pls ack (myself new to codeforces) It hasn't changed for me yet
 » 4 months ago, # |   0 My rating is 1200. Why was this round unrated for me?
 » 4 months ago, # |   -10 Is there any indication that the match has been unrated? My friends and I have found that this match is Unrated for us. A lot of thanks if you could reply to me. :(
•  » » 4 months ago, # ^ |   0 after system testing it will be rated
•  » » » 4 months ago, # ^ |   0 But I remembered that it used to show 'System Testing' rather than 'Finished' ?
•  » » » 4 months ago, # ^ |   0 What is system testing?
•  » » » » 4 months ago, # ^ |   0 That is testing your code with all successful-hacking datas.
•  » » » » » 4 months ago, # ^ |   0 thanks. how long does this usually takes?
•  » » » » » 4 months ago, # ^ |   0 I actually participate in the edu model for the first time，when usually does the rating change after the open hack？
•  » » 4 months ago, # ^ |   0 But why today System test came so late unlike before? XD
•  » » » 4 months ago, # ^ |   0 Forgive my poor English. It works as the "Educational Codeforces Round"，so you do not need to get through the System test and you cannot hack others through the contest too. However,after the contest,everyone's submissions will open to the public 12 hours.Then everyone can make a hack. But the open hack has already ended long time ago,so i don't know why either.
•  » » » » 4 months ago, # ^ | ← Rev. 2 →   0 ok
 » 4 months ago, # |   0 Why this round i have unrated?
•  » » 4 months ago, # ^ | ← Rev. 2 →   0 same...my rating hasn't changed.
•  » » » 4 months ago, # ^ |   0 same either...
•  » » » » 4 months ago, # ^ |   0 me too……
 » 4 months ago, # |   +1 In this contest, I found an act of unfair means where the user D_K_307 hacked his solution from a fake account to increase his score. Is there a way to report such things ? Proof here
•  » » 4 months ago, # ^ |   +1 In div.3 contest you can't increase your score with hacking
•  » » » 4 months ago, # ^ |   0 Cool, but still it's a wrong practice and will be effective for some contests. I have seen some users in past too doing this.
•  » » 4 months ago, # ^ |   +1 I did not have any Idea about hacking So I just tried it in div.3 contest Beacause I don't know this. Sorry For that.
 » 4 months ago, # |   0 After the system testing. Still didn't change the rating...
•  » » 4 months ago, # ^ |   0 Waiting for the same. Expecting increase in rating but not scared if it goes unrated or something :(
•  » » » 4 months ago, # ^ |   0 ya same bro :(
•  » » » » 4 months ago, # ^ |   +1 Man I was about to go expert, why this rating haven't changed yet
•  » » » » » 4 months ago, # ^ |   0 I would be close too. :(
•  » » » » » » 4 months ago, # ^ |   0 The rating predictors ain't couting out the not-trusted participants.So, I think +10 extra will be definitely there.Hope we both get the DARk BLUE.
•  » » » » » » » 4 months ago, # ^ |   0 <3 <3
•  » » » » » » » 4 months ago, # ^ |   0 It's there in the unrated graph ;(
 » 4 months ago, # |   0 Everyone's rating hasn't been changed yet.I hope I can get to green.
 » 4 months ago, # |   +1 Mr. Vladosiya I think it is your best contest.Make more contests
•  » » 4 months ago, # ^ |   0 I agree with you.I hope that Codeforces can hold more div.3 contests.
 » 4 months ago, # | ← Rev. 2 →   +5 Waiting for rating changes with 29138 others :)__ Edit: Released yaay
 » 4 months ago, # |   +1 The system told me that I cheated because of my Problem G solution coinciding with others. However, this problem had a same version on http://poj.org/problem?id=3463 ,and I had finished the problem with the help of a blog https://www.cnblogs.com/xingxing1024/p/5224363.html .So I use the code to finish problem G.Is it illegal?
•  » » 4 months ago, # ^ |   0 The blog was posted in 2016,I cant understand why i am cancelled in this round...
•  » » 4 months ago, # ^ |   +1 my problem d is coinciding with others but i did it on my own what can i do in that case !?
 » 4 months ago, # |   0 The system told me to cheat because my g question is highly similar to others, but this question is written with reference to a board written before. The link is: https://www.acwing.com/problem/content/385/ , I did this question six months ago. I hope I can get a reply. Thank you.
 » 4 months ago, # | ← Rev. 2 →   -12 [deleted]
 » 4 months ago, # |   +1 Nice contest, I really liked it! I went from newbie all the way up to specialist :D!
 » 4 months ago, # |   0 I got my first rating from this contest :) Thanks for creating Div.3!
 » 4 months ago, # |   0 is there an Editorial?
 » 4 months ago, # |   +3 There's a piece of news floating around on Reddit that Russia is gonna cut off the global internet from 11th March. Is it correct? And is it gonna affect codeforces?
 » 4 months ago, # |   0 My solution https://codeforces.com/contest/1650/submission/148871334 for problem C of this contest coincided with the solutions of other users. So, I was skipped from the contest. But it was nothing but a coincidence because the entire solution was thought and implemented by me. So, it's a mistake from your side. My solution can't be stolen by others since I don't use any online IDE. The screenshot of my written code is attached below. Please take this into consideration.
 » 4 months ago, # |   0 In problem E can d (number of sessions) be less than n (number of exams) ?
 » 4 months ago, # |   0 12 1 7 2 6 3 5 10 1 6 2 5 3 4 -6 1 5 2 4why this output is not correct for C problem as {1,7} {2,6} {3,5} are nested
 » 4 months ago, # | ← Rev. 2 →   0 I don't use any online IDE. https://codeforces.com/contest/1650/submission/148896660 for problem C of this contest coincided with the solutions of other users. So, I was skipped from the contest,And i got minus 147 point this round it should be unrated for me But it was a coincidence because the entire solution was thought and implemented by me. So, it's a mistake from your side. My solution can't be stolen by others,take that into consideration because i got minus 147 point at this round not only was skipped for me it was skipped and my rate has been changed -147 point
 » 3 weeks ago, # |   0 one thing i am not getting according to given tutorial we have sort and remove all those (m-2*n) but how is it sure that we will be able to make pair in nested segments