### 616A - Comparing Two Long Integers

Note that solutions in Java with BigInteger class or input() function in Python2 will fail in this problem. The reason is the next: standard objects stores numbers not in decimal system and need a lot of time to convert numbers from decimal system. Actually they are working in *O*(*n*^{2}), where *n* is the legth of the number.

To solve this problem you should simply read the numbers to strings and add leading zeroes to the shorter one until the numbers will be of the same length. After that you should simply compare them alphabetically.

Complexity: *O*(*n*).

### 616B - Dinner with Emma

Firstly you should find the minimum value in each row and after that you should find the maximum value over that minimums. It's corresponding to the strategy of Jack and Emma.

Complexity: *O*(*nm*).

### 616C - The Labyrinth

Let's enumerate all the connected components, store their sizes and for each empty cell store the number of it's component. It can be done with a single dfs. Now the answer for some impassable cell is equal to one plus the sizes of all different adjacent connected components. *Adjacent* means the components of cells adjacent to the current impassable cell (in general case each unpassable cell has four adjacent cells).

Complexity: *O*(*nm*).

### 616D - Longest k-Good Segment

This problem is given because on the Codeforces pages we often see questions like "What is the method of the two pointers?". This problem is a typical problem that can be solved using *two pointers* technique.

Let's find for each left end *l* the maximal right end *r* that (*l*, *r*) is a *k*-good segment. Note if (*l*, *r*) is a *k*-good segment then (*l* + 1, *r*) is also a *k*-good segment. So the search of the maximal right end for *l* + 1 we can start from the maximal right end for *l*. The only thing that we should do is to maintain in the array *cnt*_{x} for each number *x* the number of it's occurrences in the current segment (*l*, *r*) and the number of different numbers in (*l*, *r*). We should move the right end until the segment became bad and then move the left end. Each of the ends *l*, *r* will be moved exactly *n* times.

Complexity: *O*(*n*).

### 616E - Sum of Remainders

Unfortunately my solution for this problem had overflow bug. It was fixed on contest. Even so I hope you enjoyed the problem because I think it's very interesting.

Let's transform the sum . Note that the last sum can be accumulated to only value *min*(*n*, *m*), because for *i* > *n* all the values will be equal to 0.

Note in the last sum either or . Let's carefully accumulate both cases. The first sum can be simply calculated by iterating over all . We will accumulate the second sum independently for all different values . Firstly we should determine for which values *i* we will have the value . Easy to see that for the values *i* from the interval . Also we can note that the sum of the second factors in with fixed first factor can be calculaed in constant time — it's simply a sum of arithmetic progression . So we have solution with complexity .

Complexity: .

### 616F - Expensive Strings

This problem was prepared by Grigory Reznikow gritukan. His solution uses suffix array.

This problem is a typical problem for some suffix data structure. Four competitors who solved this problem during the contest used suffix automaton and one competitor used suffix tree. My own solution used suffix tree so I'll describe solution with tree (I think it's simple except of the building of the tree).

Let's build the new string by concatenation of all strings from input separating them by different separators. The number of separators is *O*(*n*) so the alphabet is also *O*(*n*). So we should use *map<int, int>* to store the tree and the complexity is increased by *O*(*logn*). Let's build the suffix tree for the new string. Let's match all the separators to the strings from the left of the separator. Let's run dfs on the suffix tree that doesn't move over separators and returns the sum of the costs of the strings matched to the separators from the subtree of the current vertex. Easy to see that we should simply update the answer by the product of the depth of the current vertex and the sum in the subtree of the current vertex.

Complexity: *O*(*nlogn*).

the equation in second sentence in solution of problem E why m*(m+1)/2 ?? I think it should m*n

me too.

Thanks. Fixed it.

Problem E is indeed a nice one I think, which helps find what a stupid ACMer I am. :P But fortunately, I learn a lot from this one. Thank you!

Problem E was a better modified version to the problem www.spoj.com/problems/SUMPRO

Problem F could be done with suffix array or just with suffix automaton or with the suffix tree?

Yes.

Can someone explain the solution for problem F using suffix array.

Concatenate strings and build suffix array and build lcp table. Answer will be max value of "min element of lcp table in [

L+ 1,R]" * "sum ofc_{i}in [L,R]". Note that we can't try all [L,R] because there is a chance that we won't add somec_{i}. If we think lcp table as histogram, we can only try rectangles which isn't cover by another rectangle. There is onlyO(LEN) pairs of [L,R] so we can try all of them. Here's my code.O(N*log^{2}(N)) : http://codeforces.com/contest/616/submission/15309183O(N*log(N)) : http://codeforces.com/contest/616/submission/15309267Problem C java tle

http://pastebin.com/E91JSjsV

my soln seems to be same as the one in editorial any inputs?

I think, it's because of adding strings when constructing answer (lines 56 & 86). As I know, it's expensive operation :) For example, try to add 1000000 digits to string.

Used printwriter in place of system.out Passed 13-14-15 Tle at 16 now Any other way to o/p large strings in java ?(with newline) Or create them without concatenation?

You can use StringBuilder. I believe that it's much faster than simple String concatenation.

StringBuilder worked thanks !!

Problem D can also be solved by a Regular sliding Window technique and Binary search on the length.

I solved it using just sliding window technique, no binary search

Someone please guide me where should I learn Suffix arrays and Suffix trees from.

Somebody can please clarify the meaning of this line of code of the solution for E?

I didn't understand why you multiply

`n(n+1) * (mod+1)/2`

[the mod part]. Using`n*(n+1)/2`

and then aplying`% mod`

would be equivalent?(

mod+ 1) / 2 is inverse element for 2 in the field modulomod.UPD: For odd

mod.Thank you so much! I'm going to search and try learn more about that

Can someone make a more easy explanation of problem E, pls ?

Can someone tell me what is the difference between declaring a function as 'inline void' instead of just 'void'? Thank you.

You can refer to google with key words "c++ inline".

My code for problem A: http://pastebin.com/fYTUiV1P

I got TLE on problem A on test 20. Can somebody help me with that? I used PrintWriter and BufferedReader in my code but still got TLE.

Thank you so much.

Your algorithm is O(N^2) because insert in StringBuilder can't possibly work faster than O(N).

Nice trick To calculate (x/2)%mod, I used to think inverse modulo would be the only way to do this, but this can be easily fashioned as ""(x*(mod+1)/2)%mod"", as (mod+1)%mod = 1 and mod is an odd prime number.

can someone explain what to do in problem E. specially the last part of the editorial when we want to calculate the second sum with the condition

`floor(n/i)<= sqrt(n)`

how did we did we do that ? i'm a little confusedI found this explanation http://math.stackexchange.com/questions/1629608/calculating-the-summation-of-n-mod-i

A similar problem can be found here http://coj.uci.cu/24h/problem.xhtml?pid=1725.

I followed the problem B's editorial, but still got wrong answer in test case 9. could anybody please verify? (http://codeforces.com/contest/616/submission/15829627)

Swap

nandmin array declaration.my bad. Thank you a million.

I did not understand solution for problem C. I've tried the following http://codeforces.com/contest/616/submission/17146817 and somehow i am getting TLE even when it is only 100 100 input which is pretty weird. I am calling DFS from every single '*' node and writing in the solution... Can someone help me out ? Cheers

How can I solve F using Suffix automaton? note: I don't know the code all people used to solve this problem, I only know the traditional one found on e_max.