### awoo's blog

By awoo, history, 20 months ago, translation, Idea: vovuh

Tutorial
Solution (vovuh)

1418B - Negative Prefixes

Idea: BledDest

Tutorial
Solution (Ne0n25)

1418C - Mortal Kombat Tower

Idea: vovuh

Tutorial
Solution (vovuh)

1418D - Trash Problem

Idea: vovuh

Tutorial
Solution (vovuh)

1418E - Expected Damage

Idea: Roms

Tutorial
Solution (Roms)

1418F - Equal Product

Tutorial

1418G - Three Occurrences

Idea: BledDest and Roms

Tutorial
Solution 1 (pikmike)
Solution 2 (pikmike)  Comments (65)
 » Thanks for the editorial, the randomized solution to G is quite interesting.
•  » » really? Is it ?
 » I think there also should be tag graphs in the problem 1418C - Mortal Kombat Tower cause I solved it with Dijkstra's algorithm.
•  » » » 20 months ago, # ^ | ← Rev. 3 →   SpoilerThere are 4 cases: Friend kills $i$'th , we kill $i+1$'th boss. Friend kills $i$'th , we kill $i+1$'th and $i+2$'th bosses. Friend kills $i$'th and $i+1$'th , we kill $i+2$'th boss. Friend kills $i$'th and $i+1$'th , we kill $i+2$'th and $i+3$'th bosses. Building Graph For case 1 : Friend kills $i$'th boss for $a_i$ and then his next turn starts at position $i+2$ (cause $i+1$'th boss is already killed by 'us') For case 2 : Friend kills $i$'th boss for $a_i$ and then his next turn starts at position $i+3$ (cause $i+1$'th and $i+2$'th bosses are killed by us) For case 3 : Friend kills $i$'th and $i+1$'th bosses for $a_i+a_{i+1}$ and then his next turn starts at position $i+3$ (cause $i+2$'th boss is killed by us) For case 4 : Friend kills $i$'th and $i+1$'th bosses for $a_i+a_{i+1}$ and then his next turn starts at position $i+4$ (cause $i+2$'th and $i+3$'th bosses are killed by us) After building graph find the shortest path with Dijkstra. )
•  » » » » Thanks. Really nice solution.
•  » » » » » You welcome. XD
•  » » » » I think you can model most dynamic programming problems like a graph problem. After all, dynamic programming states are nodes and transitions are directed edges. Together they create a DAG and in this problem you minimize the cost of the transitions.
•  » » » » » 20 months ago, # ^ | ← Rev. 2 →   I think you can model most dynamic programming problems like a graph problem.Agree. This is not my first time solving a DP problem with graphs.
•  » » Or maybe dijkstra is a DP algorithm?
•  » » » Not sure why you're getting downvoted. When running Dijkstra's on a graph, we can consider the graph as being implicitly ordered according to the eventual costs of the nodes, with edges going from low cost to high cost. This graph is acyclic, and the cost of a single node is computed in terms of the nodes which have an edge directed into it, which is literally just DP. The only thing that makes it different from a "normal" DP algorithm is that we compute the topological ordering of the nodes on the fly, rather than knowing it beforehand.
•  » » » » Maybe they don't get the idea (in a funny way), since we all know of Dijkstra as a algorithm to find shortest path in non-negative weight graph.
•  » » » I think Dijkstra's is a Greedy Algorithm
 » 20 months ago, # | ← Rev. 2 →   I think it is not right that the model solution for D heavily relies on datastructures available in a relatively small subset of available languages, even though one of them is c++
 » Can someone explain the segment tree solution of G . what i didn't understand is that valid regions depend upon the choice of right border and also on the number under consideration for eg. for the array 1 2 3 3 2 5 4 4 2 3 4 3 if we fix the right border at last index and took the number 4 under consideration then the valid/invalid regions will look like 0 0 0 0 0 0 0 1 1 1 1 0 . But these regions will change if we change the right border or the number under consideration . so there are total n*n such arrays . How can we keep track of them all with segment tree . Do we require multiple segment tree or one will suffice .
•  » » One segment tree is enough. Consider which numbers change their segments when you proceed from some right border $r$ to $r+1$. Easy to see that it's only $a_{r+1}$. So we can actually clear the segments it contributed to and add the ones it contributes to now.
•  » » » 20 months ago, # ^ | ← Rev. 2 →   Thanks for explaining , just one query remaining. How do we update the regions when moving from r to r + 1, I mean a subarray can be bad not just because it doesn't has exactly 3 numbers of $a_{r + 1}$ but may be it doesn't have exactly three numbers of some other number . We can convert a good subarray to bad when moving from r to r + 1 , but how do we convert from bad to good. How do we know what numbers are making this a bad subarray .
•  » » » » 20 months ago, # ^ | ← Rev. 2 →   You don't exactly store if the position is bad or good in the segtree. Each position only knows the number of bad segments it's covered by. For each bad segment $[l; r]$ you add 1 on positions $[l; r]$ in a segtree to maintain these values correct. And a position is good if the number of bad segments covering it is zero. Thus, adding a bad segment is adding 1 on a segment and removing a bad segment is subtracting 1 from a segment.
•  » » » » » Got it . Thank you.
 » 20 months ago, # | ← Rev. 2 →   Such a clever and interesting approach for the problem E. I am interested to know if someone is able to solve it by going the usual way of (sum of damages for each perm / n! )
 » G and F should be swapped
 » 20 months ago, # | ← Rev. 2 →   Can someone give me links for more problems similar to G in which I can use string hashing but not of strings directly?
 » Hey awoo can you tell me more about the thinking process of G. Like how did you arrive at the conclusion that we can use numbers in base 3?
•  » » Well, this xor hashing thingy is quite a common topic. I knew it because I encountered it multiple times. Initially the problem was to count the segments with 0 or 2 occurrences, so the usual xor worked perfectly.Thus, for me the transition was only from bitwise to tritwise. BledDest suggested that idea and I found it pretty cool, props to him. Couldn't really come up with it myself.
•  » » » Sir, I want to know one thing. Experience is a very important thing in competitive programming. But How to develop the power of innovating solutions to such problems? Like someone solved problem C with Djikstra....Everything cannot be covered by experience ..how are you able to think of new solutions to new problems???
 » Hey awoo, In the post of Unofficial Editorial, I wonder whether problem D has an easier solution if we can only move one pile at a time.I think the solution aniervs posts is right, but I wonder whether you have other clever solotuion?
•  » » 20 months ago, # ^ | ← Rev. 2 →   The aniervs's solution was harder to interpret ( and I am still not able to understand it fully), but it would be great if an alternate solution of problem D is added to the editorial based on his idea just like you guys did for problem G(hashing and segment tree). It will help people like me in knowing different ways to tackle the problem. Also thanks for both unofficial editorial and this editorial... Learnt a lot!!
•  » » Idk if aniervs's solution is right, ternary search is quite hard to prove there. The function is surely convex but possibly not strictly convex which might break ternary search. Other than that I doubt it gets easier than such solution.
•  » » We (adedalic, if I am not mistaken) once set a similar problem about bringing some boxes to the same point, and we thought it was possible to solve it with ternary search. But, unfortunately, the function $f(x) = \text{minimum number of actions required to bring all items to position }x$ is not strictly convex because if there are two items in positions $x$ and $x + 1$, then $f(x) = f(x + 1)$, but it is not necessarily the local minimum. Though there might be some way to handle it.
 » Hi awoo and adedalic . The way we have pushed the divisors into the set for all the values from ceil(l/x1) + 1 to floor(r/x1) in the way mentioned in the editorial solution is not clear ? Like as i understand that why we can't directly pushed all the divisors of all the numbers in the range with simple for loop of divisors of all the valid numbers of the segments . And also in the method of the solution we are also not clearing the set for further iterations of x1 is very complex to comprehend . Thanks for reading the comment and I will be grateful if you will explain .
 » Can anyone help me identify what's wrong in my approach in C : dp[i] //denotes min coins spent if I kill the last boss dp[i] // denotes min coins spent if my friend kill the last boss . int ans(int i ,int j){ if(i<0) return 1e9 + 7 ; if(i==0) { return a[i]; // since my friend's turn is the first one } if(i==1) { if(j==0) return min(ans(0,0),ans(0,1)) ; else return a[i] + min(ans(0,0), ans(0,1)); } int& res = dp[i][j] ; if(res!=-1) return res ; if(j==0) res = min(ans(i-1,1) , ans(i-2,1)) ; else if(j==1) res = min(ans(i-1,0) + a[i], ans(i-1,0) + a[i-1] + a[i]) ; return res ; } here's my submission : 92930622
•  » »  else if(j==1)  res = min(ans(i-1,0) + a[i], ans(i-1,0) + a[i-1] + a[i]) ;  return res ; It should have been :-  Your code here... res=min(ans(i-1,0)+a[i],ans(i-2,0)+a[i]+a[i-1]);
•  » » » Yes , thank you ! It was a stupid mistake
•  » » There is a mistake in the line: if(i==0) ** {** ** return a[i]; // since my friend's turn is the first one** ** }**so when you are calling ans(0,0) and ans(0,1) then you will get the same result as a which shouldn't be. And really telling you only have to change only if(i==1) { if(j==0) return ans(i-1, 1); else return a[i] + ans(i-1,1); //as the first boss is only killed by the friend. }And you can write more simpler version of it like these two : 1) https://codeforces.com/contest/1418/submission/92964444 2) https://codeforces.com/contest/1418/submission/92964444
•  » » » Hello, can you please explain me what the lines for calculating first,second and min means?
 » Edit Request awooI think in problem E tutorial, you mistakenly replaced all $a_j$ for $b_j$ in every $max(K - a_j, 0)$ expression.
 » Thanks for the editorial . Greedy solution for C was really interesting.
 » @vovuh Can you explain me what is wrong with my solution although I am partitioning the two halves with respect to the mid-point and it is giving right answer for all the given test case. But it gives wrong answer on submission. Can you help me where I am wrong Please? my solution link : https://codeforces.com/contest/1418/submission/92877522[user:vovuh]
 » @vovuh Can you explain me what is wrong with my solution although I am partitioning the two halves with respect to the mid-point and it is giving right answer for all the given test case. But it gives wrong answer on submission. Can you help me where I am wrong Please? my solution link : https://codeforces.com/contest/1418/submission/92877522
 » I've implemented the same code and it gives correct answer on my machine but it shows WA on Test Case 1. 92970290. I don't understand why this is happening.
•  » » NVM I found the error, I was inserting to the multiset a value which was not initialized. This is the final submission. 92971068
 » For G you would be better off using xor instead of sum. For each value generate two random integers x and y, and cyclically put x, y, x xor y in places with this value, the hash will be prefix xor.
 » **any one can help out why i am getting tle on Problem D and tc 52? i am using treemap and treeset **public class D { static TreeMap tm; static TreeSet ts; static int mod = (int) 1e9 + 7; static int ar[]; // static Scanner sc = new Scanner(System.in); static StringBuilder out = new StringBuilder(); static HashSet gr[]; int n; static class pair implements Comparable { int f; int s; public pair(int a, int b) { f = a; s = b; } @Override public int compareTo(pair o) { // TODO Auto-generated method stub if (this.s == o.s) return o.f - this.f; return this.s - o.s; } } static int[] dp; public static void main(String[] args) throws IOException { // TODO Auto-generated method stub int tc =1;// sc.nextInt(); while (tc-- > 0) { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int q = Integer.parseInt(st.nextToken()); int ar[] = new int[n]; tm = new TreeMap<>(); ts = new TreeSet<>(); st = new StringTokenizer(br.readLine()); for (int i = 0; i < n; i++) { ar[i] = Integer.parseInt(st.nextToken()); ts.add(ar[i]); } Arrays.sort(ar); for (int i = 0; i < n - 1; i++) { int dif = ar[i + 1] - ar[i]; tm.put(dif, tm.getOrDefault(dif, 0) + 1); } if(ts.size()<=2)out.append(0+"\n"); else{ out.append(ts.last() - ts.first() - tm.lastKey() + "\n"); } while (q-- > 0) { st = new StringTokenizer(br.readLine()); int t1 = Integer.parseInt(st.nextToken()); int x1 = Integer.parseInt(st.nextToken()); int ceil=x1; int floor=x1; if (t1 == 0) { if(ts.ceiling(x1+1)!=null){ ceil=ts.ceiling(x1+1); tm.put(ceil-x1, tm.get(ceil-x1)-1); if(tm.get(ceil-x1)==0)tm.remove(ceil-x1); } if(ts.floor(x1-1)!=null){ floor=ts.floor(x1-1); tm.put(x1-floor, tm.get(x1-floor)-1); if(tm.get(x1-floor)==0)tm.remove(x1-floor); } if(floor!=x1 && ceil!=x1){ tm.put(ceil-floor, tm.getOrDefault(ceil-floor, 0)+1); } ts.remove(x1); if(ts.size()<=2){ out.append(0+"\n"); } else{ out.append(ts.last()-ts.first()-tm.lastKey()+"\n"); } } else { if(ts.ceiling(x1)!=null){ ceil=ts.ceiling(x1); tm.put(ceil-x1, tm.getOrDefault(ceil-x1, 0)+1); } if(ts.floor(x1)!=null){ floor=ts.floor(x1); tm.put(x1-floor, tm.getOrDefault(x1-floor, 0)+1); } if(ceil!=x1 && floor!=x1){ tm.put(ceil-floor, tm.get(ceil-floor)-1); if(tm.get(ceil-floor)==0)tm.remove(ceil-floor); } ts.add(x1); if(ts.size()<=2){ out.append(0+"\n"); } else{ out.append(ts.last()-ts.first()-tm.lastKey()+"\n"); } } } br.close(); } System.out.println(out); } 
•  » » It's more simpler if you use higher and lower methods instead of ceiling and floor.
•  » » » what is difference between both???
•  » » » » floor will return the greatest element less than or equal to that number while lower will return a strictly lower element. Similarly for ceiling and upper .
•  » » »
•  » »
 » i am getting runtime error in solution for problem c. can somebody help. https://codeforces.com/contest/1418/submission/92995605
•  » » Python has low recursion limit. Either do it iteratively or using another lang.
•  » » » okk thanku.
 » In problem A, if I used the predefined ceil method(Java lang), it does not give the correct output. But If I did it in the other way, it is ok. Any idea?Wrong submissionAccepted
 » 20 months ago, # | ← Rev. 2 →   Why my greedy approach is wrong for the problem C? Please give me a case that fail the solution. Thank you.
 » 20 months ago, # | ← Rev. 5 →   For Problem C. I took greedy approach., Can someone say my fault. My approach goes as.., 1. If its my turn, then I will take one and for the next one, (i) if zero, leave to my friend (ii) else, I will take it. 2. If its my friend's turn,then he will take one and for the next one, (i) if its 0 he will take it (ii) if its 1 he will leave it to me. My SubmissionThanks in Adavanced..,
 » 20 months ago, # | ← Rev. 2 →   I had read the problem 1418B - Negative Prefixes for more than 40 min and after that I had read the solution but I wasn't able to understand these lines in block ,can any one help , I think it says we need to find array so that it prefix sum array should be like starting from negative elements and once the positive element came then there should be no negative elements(all elements after that are positive) like eg [−8,−14,−13,−9,−5,2,0] and as given in solution and k is 5 , and we need to reduce the k some and propose a solution ,but that was not the case Let k be the maximum j (1≤j≤n) such that pj <0. If there are no j such that pj<0, then k=0. Your goal is to rearrange the values in such a way that k is minimum possible. thanks in advance
•  » » 20 months ago, # ^ | ← Rev. 2 →   Ok so this is what it means. Lets have this prefix sum array [-1,-4,-5,-6,7,8,9]. Here, k = 4. This is because k is the index of the "right most negative element". Another example: prefix sum array = [1,-3,4,-5,-1,2,3] Here, k = 5. The "right most negative element" is -1, and so its index is 5. You can have positive in between the negatives, it doesn't matter. What the problem is asking is you want k to be as small as possible.So you want to arrange the array such that its prefix sum array will have the smallest k, when compared to other arrangements.I hope this helps!
•  » » » Yeah , thanks bro..
 » 20 months ago, # | ← Rev. 3 →   A solution for F without any data structures, just simple math (although with many steps and cases):For easier reading, let's rename $(x_1,y_1,x_2,y_2)$ to $x,a,b,c$, so we need to find three numbers $a,b,c$ such that $xa=bc \in [l,r]; a,c \in [1,m]; b \in [x+1,n]$. In fact, we can drop the constraint on $c$, it follows from the others.So far, we have fixed a value of $x$. Now let's fix the greatest common divisor $g$ of $b,x$. There can only be a total of $n \log n$ such divisors across all values of $x$. The idea is to quickly find a solution given $g,x$ if it exists. We know that $b>x$ and since $g$ is their common divisor, we can write $b=x+yg$ for some $y>0$. The constraint on $b$ becomes $y\leq \frac{n-x}{g}$. Also, since $b$ divides $ax$, we have that $b/g$ divides $a(x/g)$ and so, since $b/g$ and $x/g$ are coprime, $b/g$ divides $a$, and so $a=(b/g)z=(x/g+y)z$ for some $z$.Let's handle two cases:1) $g > \sqrt{x}$. In this case there can be at most $x/g < \sqrt x$ different values of $y$ and we can try each. For a fixed $y$, we check whether $b$ fits the constraints and whether we can find $z$ such that $a$ also fits the constraints.2) $g \leq \sqrt{x}$. We try each value of $z$ as long as $a$ is less than $m$. In fact, from $a=(x/g+y)z$ and $y>0$ we have $z \leq \frac{m}{x/g+1}$. After fixing $z$, we look for $y$ to fulfil the linear constraints given above (a couple of integer divisions and min/max).Overall, the sum of small divisors (less than $\sqrt{x}$ for all numbers $x$ up to $n$ is asymptotically $O(n \sqrt n)$, and the sum of all values $\frac{1}{x/g+1}$ for all small divisors is asymptotically equal to $O(\sqrt n)$, so the overall complexity is $(n+m)\sqrt{n}$.
 » https://codeforces.com/contest/1418/submission/94884520 Why is the greedy approach not working in this solution for the C problem?
 » How to compute the probability of collision in problem G? Would some love to elaborate why it is the same as two vectors (out of n) colliding in a K-dimensional space with their coordinates being from 0 to 2? I will appreciate it a lot.
 » `Your code here... #include using namespace std; typedef long long int lli; void solve() { lli m = 1000000007; lli t;cin>>t; while(t--) { lli n;cin>>n; lli A[n]; FOR(i,0,n-1) { cin>>A[i]; } lli i=0,s=0; lli f=1; while(i
 » 13 months ago, # | ← Rev. 2 →   could anyone please tell me that how we are getting x-1 sticks in the first problem?I am thinking x sticks.
•  » » That is because every trade we need to give away one stick to take x sticks hence it is x-1 like u give ur 1 stick to get x sticks , out of x u give away 1 stick
•  » » » Thanks for your explanation i understood now.
 » Can Anyone tell me where i am wrong 156011618