### Supermagzzz's blog

By Supermagzzz, 21 month(s) ago, translation,

1520A - Do Not Be Distracted!

Authors: MikeMirzayanov

Tutorial
Solution

1520B - Ordinary Numbers

Authors: MikeMirzayanov

Tutorial
Solution

Authors: MikeMirzayanov

Tutorial
Solution

1520D - Same Differences

Authors: MikeMirzayanov

Tutorial
Solution

1520E - Arranging The Sheep

Authors: Supermagzzz, Stepavly

Tutorial
Solution

1520F1 - Guess the K-th Zero (Easy version)

Authors: Supermagzzz, Stepavly

Tutorial
Solution

1520F2 - Guess the K-th Zero (Hard version)

Authors: MikeMirzayanov

Tutorial
Solution

1520G - To Go Or Not To Go?

Authors: Supermagzzz, Stepavly, Aris

Tutorial
Solution

• +125

| Write comment?
 » 21 month(s) ago, # |   +7 There is some issue with the editorials. Supermagzzz pls check.
 » 21 month(s) ago, # |   -44 Editorial is not perfect. please look into it and upload all c++ solutions with proper explanations.
 » 21 month(s) ago, # |   +4 The tutorials aren't visible.
 » 21 month(s) ago, # |   +3 You can read this article to read editorials now.Write a new blog on CF (you don't have to post it), add a line [tutorial: ] (e.g. [tutorial: 1336A]), and preview it.
•  » » 21 month(s) ago, # ^ |   +14 this is so pog
•  » » » 21 month(s) ago, # ^ |   -8 you are so pog
 » 21 month(s) ago, # |   +10 My solution to problem G:The main observation is that we don't ever need to use more than 2 teleportations (because going from point $a -> b$ and then from $b -> c$ is strictly worse than going directly from $a -> c$). Therefore, we can calculate for each portal the cost required to use it as the first one, which is $dist(start, portal) * w + a[i][j]$ and in similar way the cost to go from a portal to the end as $dist(portal, end) * w + a[i][j]$ (by using bfs). The solution is either $dist[start][end] * w$ or the smallest cost to access a portal from the start plus the smallest cost to go from a portal to the end.Code : https://codeforces.com/contest/1520/submission/115344755.
•  » » 21 month(s) ago, # ^ |   0 Sorry cuz I'm not really familier with C++, I read your code but haven't got it. I have a question is How you ensure the nearest portal from start and the nearest portal from end is not the same one?
•  » » » 21 month(s) ago, # ^ |   +1 You don't need to check for that case because going from $(1, 1)$ to $(n, m)$ without using any portal will be strictly cheaper than using the same portal twice.
 » 21 month(s) ago, # |   0 Can we solve E with ternary search?
•  » » 21 month(s) ago, # ^ |   0 Yeah, we can.
•  » » 21 month(s) ago, # ^ |   +1 don't know about ternary but did with binary search after long thinking (ofc i m grey) but i should work more to think like how the solution in editorial is posted here is my submission 115389196
•  » » 21 month(s) ago, # ^ | ← Rev. 2 →   0 Yes, it also can be solved using binary search, look at my submission if you are interested: submission
•  » » » 21 month(s) ago, # ^ |   0 it's kind of ternary search.
•  » » » » 21 month(s) ago, # ^ |   0 parveen1981 I don't know if I should call it ternary search.Ternary search splits the graph into three segments. In my submission the second mid $mid2 = mid1 + 1$ is just to determine where the "binary" search should go. The graph is similar to $y = abs(x)$ and I am searching on the minimum point. if $moves2 > moves1$ then I know I am on the right of the minimum point then I should go to the left and if $moves2 < moves1$ then I know I am on the left of the minimum point then I should go to the right.
•  » » » » » 21 month(s) ago, # ^ |   0 You are checking for two points in each iteration. In ternary search also, we check for two points. That's why I said. But your approach is slightly efficient. Thanks. From now on, I will apply same binary search as you did.
•  » » » 21 month(s) ago, # ^ |   0 Hey, could you please explain your solution?
•  » » » » 21 month(s) ago, # ^ | ← Rev. 3 →   +3 Observation 1: First if we want to make the sheeps in one row then the length of that row has to be the number of sheeps in the given string.Now let's call the number of sheeps in the string to be k.Observation 2: If we want to move the sheeps into a subsegment of length $k$ , then the first sheep that appears in the string has to be in the first position of the subsegment and the second sheep that appears in the position has to be in the second position of the subsegment and so on until we put all the sheeps in the string in the row.Now to calculate the number of moves that we need to put the sheeps in a row for a subsegment consider a subsegment of length $k$ , that starts at position $x$ and let's call the position of the first sheeps in the string to be $s_1 , s_2 , s_3 ... s_k$ then the number of moves is $abs(s_1 - x) + abs(s_2 - (x + 1)) + abs(s_3 - (x + 2)) ... abs(s_k - (x + k - 1))$.Finally, we have to calculate the minimum of that function you can use ternary search or binary search. Here is My SubmissionIt worth mentioning that there is a problem on Atcoder called Linear Approximation which is strongly related to this problem. When I put the equation of the number of moves I remembered this question then I copied my old code for it and edited a few lines and it got accepted. If anything is not clear feel free to tell me I will explain more.
•  » » 21 month(s) ago, # ^ | ← Rev. 3 →   0 Yes,we can.I did this with ternary search.You can see my sol if interested.Your text to link here...
 » 21 month(s) ago, # |   0 $F2$ and $G$ has the same codes.
 » 21 month(s) ago, # |   +8 Problem E has issues in solution code.
 » 21 month(s) ago, # |   +4 problem D was directly available here
•  » » 7 months ago, # ^ |   0 broo but it is giving an error at test case 5 why is it happening can u explain?
•  » » » 4 months ago, # ^ |   0 try long long
 » 21 month(s) ago, # |   +10 My DP solution for E: we can find all pref[i] values where pref[i] shows how many moves we need to move all sheep to the left from i to i. If a sheep doesn't stay at i position, then pref[i] = pref[i — 1] + was ( was is an amount of sheep to the left from i), else pref[i] = pref[i — 1]. Same operations we can do for suff (we go from n to 1). Then we can simply check for every i: ans = min(ans, pref[i] + suff[i + 1]).
•  » » 21 month(s) ago, # ^ | ← Rev. 2 →   +5 A similar approach: we can move each '.' either left of all left sheeps or right of all right sheeps. We just need to maintain sheeps till now and total sheeps.
 » 21 month(s) ago, # |   0 Why does my solution to 1520E - Arranging The Sheep gives WA? I did it like this: SpoilerFor the ith sheep, the number of moves so that all sheep to the right of it and all sheep to the left of it are aligned is:Moves[i] = MovesLeft[i] + MovesRight[i].With MovesLeft and MovesRight being the number of moves to align all the sheep from the left and right respectively. To calculate MovesLeft and MovesRight, one can simply do:MovesRight[0] = 0 (There's no one to the right of the 0th sheep)MovesRight[1] = MovesRight[0] + (Distance from 0 to 1) * 1MovesRight[2] = MovesRight[1] + (Distance from 1 to 2) * 2....MovesRight[i] = MovesRight[i-1] + (Distance from i to i-1) * iSimilarly to the Left Moves.Then at the end simply take the minimum of all Moves[i].Since we do only linear loops, the complexity should be around O(N), fitting the constraints.Thanks if someone had the goodwill to read :)
•  » » 21 month(s) ago, # ^ |   0 U dont have to push them all to the left or all to the right to get the answer
•  » » 21 month(s) ago, # ^ | ← Rev. 3 →   0 daviyan You made just one mistake..You initialized the value of ans as n,but in reality ans can be greater than that.So just initialize it with some higher value(say n*n) and it will work..
•  » » » 21 month(s) ago, # ^ |   +1 Indeed! It only worked with ans initialized as LLONG_MAX. Kinda sad that the error was only this little detail. Thanks a lot!
•  » » » » 21 month(s) ago, # ^ |   0 lol, I used the same approach and did the exact same mistake
 » 21 month(s) ago, # |   +5 In C, I just printed odd numbers first and then the even numbers row-wise, I thought this would be the intended solution.
•  » » 21 month(s) ago, # ^ |   +2 For the last few contests, the topic bicoloring has been used in many problems on cf, so this solution comes naturally to people who are regularly solving cf problems.
 » 21 month(s) ago, # | ← Rev. 2 →   0 Submission 115253830Could someone give a proof (or hint) about the correctness of this simple problem E solution? I solved it during contest based on intuition, but struggle to give a formal reasoning. The solution differs from the one given by the editoral. Any help is appreciated.Idea: discard all leading and trailing empty spaces initialise $ans=0$ for each remaining empty space at position $i$, increment $ans$ by $min(sheeps_l, sheeps_r)$ where $sheeps_l$ is the number of sheeps appears before position $i$, $sheeps_r$ is the number of sheeps appears after position $i$
•  » » 21 month(s) ago, # ^ |   0 this is the same as claiming that the middle sheep will not move
•  » » » 21 month(s) ago, # ^ | ← Rev. 2 →   +8 Could you elaborate on how the two approaches relate to each other?UPD: I got it now.
•  » » » » 21 month(s) ago, # ^ |   0 Can you tell how they relate to each other?
•  » » » » » 21 month(s) ago, # ^ | ← Rev. 2 →   +8 As we iterate through the array from left to right. We have $min(s_l,s_r) = s_l$ before the middle sheep. Hence, it is best to move the spaces that appear before the middle sheep to the left. This is equivalent to moving the sheeps that appear before the middle sheep to the right, until they meet with the middle sheep. The middle sheep does not move.Similarly, we have $min(s_l,s_r) = s_r$ after the middle sheep, so we can apply the same insight.Example: SpoilerSay after trimming leading and trailing spaces, we have $**..\underline{*}..*.*$The underlined sheep is the middle sheep. The editoral is wrong about the middle sheep number. It is not always $m=⌈\frac{n}{2}⌉$.Now let's consider spaces before the middle sheep, $**\underline{.}.\underline{*}..*.*$Obviously, 2 steps to the left. Now we have $.**\underline{.}\underline{*}..*.*$Also 2 steps to the left. $..**\underline{*}..*.*$Great, now let's consider spaces after the middle sheep. $..**\underline{*}..*\underline{.}*$Yes, 1 step to the right. $..**\underline{*}.\underline{.}**.$2 steps to the right. $..**\underline{*}\underline{.}**..$2 steps to the right. $..**\underline{*}**...$Finally, all sheeps are happily staying together.
•  » » 21 month(s) ago, # ^ |   0 I solved it using the same approach. I don't have any proof too but it makes sense when you look from the empty-spaces' point of view. You want to move the empty spaces out of the sheep so you either move them right or left.
•  » » » 21 month(s) ago, # ^ |   +3 Ah yes, for cases with consecutive sheeps on both left and right like $***\underline{.}**$, it is clear to move the space 2 steps to the right.Originally, my suscipion arises for cases such as $***\underline{.}*..*$. Instead of considering the optimal position for sheeps (as in editoral), we can consider the optimal position of empty spaces. For this case, the optimal position for the space is 2 to the right.Thanks, I think I grasped the concept.
 » 21 month(s) ago, # |   0 interactive problem in cf == Binary Search
•  » » 21 month(s) ago, # ^ |   0 No.Interactive problem in CF >= Binary Search Because F2 = Binary Search + Fenwick Tree (or Segment Tree)
•  » » » 21 month(s) ago, # ^ |   +2 F1: direct binary search. F2: binary search but with extra steps (no need fenwick tree)
 » 21 month(s) ago, # |   0 Finally i'll get 1600+ rating :)
 » 21 month(s) ago, # |   0 Weird solution for "1520A — Do Not Be Distracted!" in Editorial.Isn't this solution much faster and simpler? const set = new Set(); let flag = true; for (let i=0; i
•  » » 21 month(s) ago, # ^ |   0 This idea is simple to write, and maybe I would suggest writing this variant in the contest.But set takes O(NlogN) time complexity, and we can remove the logN component by using a map(or vector counter(26, 0)) to store the previous occurrence. This way the time complexity is reduced to O(26*N) which is more optimized :)
 » 21 month(s) ago, # |   +1 Let's understand what the maximum number of vertices can be in the tree. We will consider each level separately. If the level number x is less than logt≤14, then we can spend no more than x of vertices (since there are simply no more vertices). If the level number is from 15 to 18, then we can spend no more than t vertices, so each request uses only one vertex per level. By limiting the number of vertices in this way, we get that there are no more than 214−1+4⋅104=56383, which fits into the constraints.Can anyone explain these lines from the last paragraph of Tutorial of F2 more clearly?
•  » » 21 month(s) ago, # ^ |   +16 It means that, after building the binary tree, suppose1). You visit all the vertices if their level is less than 14, (such kind of total vertices are (2^14-1) )2). Also, for every query we will descend the binary tree and we will only travel one vertex at each level at most so, for levels 15 to 18, there are 4 such vertices, hence the total vertices visited would be, 4*(# of queries) = 4*10000. total visited nodes: (2^14-1)+40000.
•  » » » 21 month(s) ago, # ^ |   +39 There is also another way to solve F2, which I found nicer and easy to prove. We can divide the complete array length n into blocks of size m (for ex. m = 32 ). If for every testcase we can find in which block the answer would lie then we can just binary search on that block and it will cost at max 5 queries (if m = 32).Now, to find the required block. We can find the number of zeroes in each block during the 1st test case. After that, we can just traverse on blocks and see in which block kth zero will lie. And, finally decreases the count of zero from that block before moving to the next testcase.To get no. of zeroes in each block, we will require. n/(block size) no. of queries. This is well within the constraints. Here is the link of my submission:https://codeforces.com/contest/1520/submission/115301904The above code can be optimized using some sort of data structure to find the required block, but given the TL of 4 sec, it will pass.
•  » » » 21 month(s) ago, # ^ |   0 Thanks! I get it now.
•  » » » 21 month(s) ago, # ^ |   +1 What about 14-th level?
•  » » » » 21 month(s) ago, # ^ |   +6 Sorry, I meant 1st case for levels less that equal to 14 instead of just less than 14.
•  » » » » » 21 month(s) ago, # ^ | ← Rev. 2 →   +1 then won't there be 2^15-1 vertices?
•  » » » » » » 21 month(s) ago, # ^ |   +6 Levels starting from 1, (2^0+2^1+....2^13)these are the 14 levels.
•  » » » » » » » 21 month(s) ago, # ^ |   0 1). You visit all the vertices if their level is less than 14, Actually, why will we visit all the vertex level till 14? logt<=14 -- is said in the tutorial. But still now, I am confused why should I visit all the vertex till this level? Can you plz explain details in this point?
•  » » » » » » » » 21 month(s) ago, # ^ |   0 We are just showing the worst possible case, ofcourse it is not necessary to visit all the vertices if the 1st condition holds but in that queries total queries would be less than derived for the worst case.
 » 21 month(s) ago, # | ← Rev. 2 →   +24 In editorial of F2 it should be $2^{14}$ instead of $2^14$.To correct it the editorialist should put 14 between {}, thats how the syntax works
 » 21 month(s) ago, # | ← Rev. 2 →   0
•  » » 6 months ago, # ^ |   0 Watched your explanation for D, it's amazing!
 » 21 month(s) ago, # |   +4 G can be solved with dp?
•  » » 21 month(s) ago, # ^ |   +16 if bfs is dp yes
 » 21 month(s) ago, # |   0 weak test cases in d
•  » » 21 month(s) ago, # ^ |   0 so sad, there should be atleast some pretest for (a[i] — i) < 0
 » 21 month(s) ago, # |   0 Can I use Dijkstra to solve G?
•  » » 21 month(s) ago, # ^ |   0 no that gets MLE
•  » » 21 month(s) ago, # ^ |   0 Yes, 115309192
•  » » » 21 month(s) ago, # ^ |   0 Thank you!
•  » » » 21 month(s) ago, # ^ |   0 Time limit exceeded on test 134
•  » » » » 21 month(s) ago, # ^ |   +1 So sad
•  » » » » » 21 month(s) ago, # ^ |   0 dori is just geniosity
•  » » 21 month(s) ago, # ^ |   0 I managed to get it but very very tight. https://codeforces.com/contest/1520/submission/116037918
 » 21 month(s) ago, # |   +1 There is a LaTeX problem in the tutorial for F2, $2^{14}$ is mistyped as $2^1 4$ and confused me a bit at first.
 » 21 month(s) ago, # |   0 Is the solution only given in C++ ? If no, when will Java solutions be uploaded ?
•  » » 21 month(s) ago, # ^ |   +1 The solution will most likely not given in all languages. However it doesn't matter. The best approach(to learn, And get high rating in long run) is-Step1: try problems yourself(maybe you have done this while the contest is running)Step 2: view tutorial(just explanation, and only upto some lines after which you can solve it)Step 3: if you are unable to understand ask someone, or ask through a blog.Step 4: implement solution yourself.(important)
 » 21 month(s) ago, # | ← Rev. 3 →   0 Nice
 » 21 month(s) ago, # |   0 Can anyone tell why this code is giving TLE on test 125?
•  » » 21 month(s) ago, # ^ |   0 It has complexity $O(portals^2)$, which is too slow.
•  » » » 21 month(s) ago, # ^ |   0 Would this work?first sort all the portals by minimum distance of getting their from $(1,1) + a[i][j]$(value of portal) put them in list-1 say.then in list-2 sort all the portals by minimum distance of getting their from $(n,m) + a[i][j]$(value of portal)then we can pick the first item from both the list (if they are not same portal otherwise we will take 1st item from 1st list and 2nd item from 2nd list or 1st item from second list and 2nd item from 1st list and select whichever gives the minimum answer)Can you help?
•  » » » » 21 month(s) ago, # ^ |   0 You don't actually need to store the distances in a separate array and then sort it later. You can keep track of the current minimum distance and update it accordingly.You also don't have to check whether you picked the same portal twice as the cost from $(1, 1)$ to $(n, m)$ without using any portal will be strictly cheaper.115297135
 » 21 month(s) ago, # | ← Rev. 2 →   +1 In problem E: Note that in the optimal solution the sheep with the number $m = \lceil\frac{n}{2}\rceil$ will not make moves. Shouldn't $m = \lceil\frac{k}{2}\rceil$?
•  » » 21 month(s) ago, # ^ |   0 Or $m = \lfloor\frac{k}{2}\rfloor$ according to the solution code?
•  » » » 21 month(s) ago, # ^ |   0 The explanation counts the sheep starting from $1$ ($x_1, x_2, \dots$), while the code counts the sheep starting from $0$ (the variable cur).
•  » » » » 21 month(s) ago, # ^ |   0 I see. I'm wondering whether the author intends that the explanation and the code are not consistent...
 » 21 month(s) ago, # |   0 The option to submit file is not showing. I want to solve those probems which i couldn't do yesterday. When will that option be back? anyone knows it?
•  » » 21 month(s) ago, # ^ |   0 you'll be able to submit the code after the system test for this contest is over
 » 21 month(s) ago, # | ← Rev. 2 →   +18 Wanna share my miserable experience during the contest...During the last 30 min, the queue is too long, I submitted G, but knew the result after the contest ended, so I don't have chance to debug and resubmit!What a pity:<
 » 21 month(s) ago, # |   0 In F2 many people have used ordered_set, order_of_key.Can someone tell the functionality of this, or some source maybe. Thanks.
•  » » 21 month(s) ago, # ^ |   +10 Ordered_set basically a set but with 2 extra functionality: We can find the kth element in the set and find the number of elements less than k. You can read about how to use it here
 » 21 month(s) ago, # | ← Rev. 3 →   +1 My solution for C was, if n != 2, print in appropriate way all odd numbers from 1 to n^2 and afterwards all even numbers.More easy to implement & understand, I think.
 » 21 month(s) ago, # |   0 Please can anyone can explain problem e?Thanks in advance.
•  » » 21 month(s) ago, # ^ |   0 the task was to calculate the minimum steps for which all the * will be adjacent to each other, and at each step either you can move any * forward or backward by one position, so it let's assume the string ..*..***...*..*.... here there are 6 * and we what we want is to make their position consecutive so we have our first * at position 3(one's notation) and last one at 15'th position so can make it like ******............. or .******............ or ..******......... or ...******......... or ....******........ and upto .............****** , we can notice it won't make any sense to start before the first * and * after last * . so we can iterate through all positions from where we can start our * and just calculate the steps for each and store the minimum value.(o(n^2) solution)//optimizing it in the orignal string so, we can just precalculate the steps needed to make all the * from left of any position consecutive and the steps needed to make all * consecutive to right of any index, and we can just iterate through our precalculated values and take min(steps for left + steps for right) for entire precalculated value
 » 21 month(s) ago, # |   +2 A relatively easier approach for problem C (Not Adjacent Matrix):At first, we try to fill the array with odd elements starting from 1 till n2, then we fill the remaining cells with even elements starting from 2 till n2. The only exception is when n is 2.For reference, here is the link to my submission.
 » 21 month(s) ago, # | ← Rev. 2 →   +2 I think problem C can be easily solved by just simply printing the odd numbers till n*n and then the even numbers. For example, if n=4 1 3 5 7 9 11 13 15 2 4 6 8 10 12 14 16
 » 21 month(s) ago, # |   0 Would anyone mind explaining E tutorial again to me? I've been trying for a while but I still didn't get the formula for the final position of the sheep
•  » » 21 month(s) ago, # ^ |   0 first group sheep with contiguous segment like ******...***.**....****** here we have four groups of sheep.now it is optimal to fix a group and full its left groups and right groups towards it and minimize the answer .for clear clear concept see here 115315773
 » 21 month(s) ago, # | ← Rev. 2 →   +11 Alternate solution for F-hard if anyone is interested:Divide the array into blocks of size $20$. As a preprocess, store the number of zeros in all these blocks. It takes $200000/20==10000$ queries.Now, we can answer each query: find the block where the zero is, and use $\lceil \log 20 \rceil == 5$ per query to binary search this block. In total, we use exactly $60000$ questions in worst case.115436756 code with some comments
 » 21 month(s) ago, # |   0 Can someone explain why in problem E, not moving the middle sheep and moving other sheep towards it is the optimal solution?
•  » » 21 month(s) ago, # ^ |   0 Consider all sheeps have moved. Then there is a position where all sheeps left of it where moved right, and all sheep right of it where moved left. One of both halfs is the bigger one, WLG consider it be left.Then it would be a better solution to move all left sheeps one step less, and all right sheeps one step more.
 » 21 month(s) ago, # |   0 Hi, guys! Trying to solve F2 with multiset. I have WA on 9 test. My someone help to find the mistake please? https://codeforces.com/contest/1520/submission/115447429 (Very simple code)
•  » » 21 month(s) ago, # ^ |   0 Hello!You binary search should return r instead of l, as you only give ok position to rBut despite that, the interactor's a array changes after you giving you an answer, so there's no need to use multiset.The most serious thing is your solution needs $t \cdot \lceil\log_2 n\rceil$ times to interact, which is much bigger than the limit when $n=200000$
 » 21 month(s) ago, # |   0 weak pretests in G if you intended to make the dijkstra solution get TLE.
 » 21 month(s) ago, # |   0 In problem C, it's enough to randomize the position of each number until a valid matrix is found. There's a small probability of generating an invalid matrix.
 » 21 month(s) ago, # |   0 There is an block solution for F2.Let $w$ be the block size, it will interact $\frac n w + t\cdot\lceil \log_2 w\rceil$, with $w=8$, it will interact not more than 55000 timesUses BIT for prefix sum between blocks, the time comlecity is $O(n \log n + t \log^2 n)$115414141
 » 21 month(s) ago, # |   0 solution using Dijkstra's is Runtime error on test 146 ; PLEASE HELPmy submission : https://codeforces.com/contest/1520/submission/115467140
 » 21 month(s) ago, # |   0 Problem F-2I can't figure out why it is wrong. It gets wrong at test case 7, can you especially explain that? Because when I try, it seems fine!
•  » » 21 month(s) ago, # ^ |   0 Also I realized Jury's Ans != Participant Output but still Verdict is OK.. why is this so?
•  » » » 21 month(s) ago, # ^ |   0 It shows the number of queries used and not the answerIf queries will be below 60000 and answers are correct then it will pass it
 » 21 month(s) ago, # |   0 In problem G:Here is link to my AC solution.Here is link to my WA on test case 122 solution, it's exactly similar to previous solution, only difference is value of LINF as LONG_MAX.Can anyone explain, why this error is caused????
•  » » 21 month(s) ago, # ^ |   0 long max : 2147483647 long min : -2147483648
•  » » » 21 month(s) ago, # ^ |   0 Yes, my question is why do I get WA when I use value of LINF as LONG_MAX and AC when I use value of LINF as 1e18.
•  » » » 21 month(s) ago, # ^ |   0 Also, that is not correct value of LONG_MAX. The value you have provided is value of INT_MAX.
•  » » » » 21 month(s) ago, # ^ |   0
•  » » » » » 21 month(s) ago, # ^ |   0 It's compiler issue, you are using an out dated compiler.Check this: https://ideone.com/jFV2pg
•  » » » » » » 21 month(s) ago, # ^ |   +1
•  » » » » » » » 21 month(s) ago, # ^ |   0 OH MY GOOODDDDWhat the hell is this. :(
»
21 month(s) ago, # |
Rev. 2   0

why this code is giving the wrong answer.

# include<bits/stdc++.h>

using namespace std; bool a[26],res; int main() { int t; cin>>t; while(t--) { int n; string s; cin>>n>>s;

for(int i=0;i<n;i++)
{
a[i]=false;
}
bool res=true;
for( int i=0;i<n;i++)
{
int t=s[i]-'A';
if(!a[t])
{
a[t]=true;

}
else if(s[i]^s[i-1])
{
res=false;

break;
}

}
if(res)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}

}

}

•  » » 21 month(s) ago, # ^ |   0 https://codeforces.com/contest/1520/submission/115754029says right there in your submission
 » 20 months ago, # |   0 Can anyone explain the logic for G. Thanks in advance!!
 » 20 months ago, # |   0 Anybody had different solutions to F2 and G?
•  » » 20 months ago, # ^ | ← Rev. 2 →   0 For F2, i think i had a different idea from the one mentioned in the editorial. Basically, the idea is to divide the array in buckets of size $32$. For each bucket, we'll calculate initially the amount of zeros it contains. Then, for each query, we'll find which bucket contains the given $k$ and binary search to find its exact position. The number of queries is $n/32$ for preprocessing and around $50000$ for all the other queries.Code : https://codeforces.com/contest/1520/submission/116861616
•  » » » 20 months ago, # ^ |   0 oh yess. I had the same idea, but my bucket size was 16. I implemented it and got WA, though. probably just a logic error.
 » 19 months ago, # |   0 For the problem F2-Guess the K-th Zero (hard). It is failing the 4th-test case but my output seems to be correct for the given string 00. Can someone please help me figure out the issue: Submission link: https://codeforces.com/contest/1520/submission/119638144Output on my terminal (for the 4th test case: 00): 2 2 1 ? 1 2 0 ? 1 1 0 ! 1 1 ! 1
 » 11 months ago, # |   0 I code a radix heap for my dijkstra's algorithm to solve G directly, but got tle on test 134. Can anyone tell me how to generate a test data like it, or how to hack my submission?
•  » » 11 months ago, # ^ |   0 Oh I have passed now. You can see my submission here. I have to say I was so excited when it was Accepted!
 » 10 months ago, # |   0 152820419 For problem C: Not Adjacent Matrix This is more efficient than the tutorial
 » 4 months ago, # | ← Rev. 3 →   0 I have found it where I am doing the mistake. Can anyone please explain why I am getting wrong answer in problem C. I am fulfilling those 2 conditions correctly. then why I am getting wrong answer? Each integer from 1 to n2 occurs in this matrix exactly once; If (r1,c1) and (r2,c2) are adjacent cells, then the numbers written in them must not be adjacent. My Solution: #174822501