The round statistics are nicely put by DmitriyH.

#### 427A - Police Recruits ( Author : Bidhan )

Maintain a variable, *sum*. Initially *sum*=0, it keeps the number of currently free police officers. With every recruitment operation, add the number of officers recruited at that time to *sum*. When a crime occurs, if *sum* > 0 then decrease the number of free officers by one, otherwise no officers are free so the crime will go untreated.

Model solution : 6546268

#### 427B - Prison Transfer ( Author : Bidhan )

The severity of crimes form an integer sequence. Find all the contiguous sequences without any integer greater than *t*. If the length of any sequence is *L*, then we can choose *c* prisoners from them in *L* - *c* + 1 ways.

Model solution : 6546272

#### 427C - Checkposts ( Author : Bidhan )

Find the strongly connected components of the graph. From each component we need to choose a node with the lowest cost. If there are more than one nodes with lowest cost, then there are more than one way to choose node from this component.

Model solution : 6546275

#### 427D - Match & Catch ( Author : msh_shiplu )

** O(n^{2}) dynamic programming solution :** Calculate the longest common prefix ( LCP ) for each index of

*s*1 with each index of

*s*2. Then, calculate LCP for each index of

*s*1 with all the other indexes of it's own (

*s*1 ). Do the same for

*s*2. Now from precalculated values, you can easily check the length of the shortest unique substring starting from any of the indexes of

*s*1 or

*s*2. Suppose

*i*is an index of

*s*1 and

*j*is an index of

*s*2. Find the LCP for

*i*and

*j*. Now, the minimum of the length of LCP, length of shortest unique substring starting from

*i*, length of shortest unique substring starting from

*j*is the answer for

*i*,

*j*. Now we need to find the minimum answer from all possible

*i*,

*j*pair. This problem can also be solved in by suffix array and in

*O*(

*n*) using suffix automaton.

Model solution : 6546277

#### 427E - Police Patrol ( Author : Bidhan )

Trying to place the police station on existing criminal locations is the best strategy. Calculate the cost from the leftmost criminal location, then sweep over the next locations. By doing some adjustments on the cost of the previous location will yield the cost of the current location.

Model solution : 6546283

427B — is it solvable in compiled languages without any tricks — straight search for max on each iteration? Or do we need to do some interval trees or something like that? Python solution times out.

You just have to sum L — c + 1 to ans on each iteration that finds a value greater than t. The pseudocode:

By the way, I don't get what you mean by "without any tricks".

Super. After first time-out I tried to figure our something like this, but not exactly — mine failed, most likely on situation when all numbers are equal. Hope tomorrow at CJ I will do better :)

Without any tricks — meaning just taking max() of system. O(N^2) solution. The thing you showed — this is what I call "trick" :)

I did it using segment trees 11682645 . And problem setter's solution is 16ms faster than mine and is memory efficient. I cannot understand the editorial. Please explain?

It has simple O(n) time complexity solution. Just keep an array with indices of criminals whose crime level is greater than t. Now just iterate over consecutive indices of this array, say like 1st and 2nd index, check whether the number of criminals between these 2 criminals(say it is L) is greater than c, if yes then just add L-c+1 to your answer.

why L-c+1? i don't get the idea though

Think on an array

`A_1, A_2, ....., A_l`

Our subsequences are;`A_1, A_2, ..., A_c`

`A_2, A_3, ..., A_(c+1)`

... ...`A_(l-c+1), ....., A_l`

Thus we have L-c+1 different options.

In fact at E you do not need to find the spot where you place the center. You can go with 2 pointers , one which comes from left and one from right and at every step add (a[right] — a[left]) * 2 to the solution. This is right because at each you go from the center once to right and return and then once to left and return.

I did that solution, but it failed — probably some corner case. I'll investigate today. I think you should cut m items from each head and tail until you have just a few criminals left.

There is also an elegant solution by Vladyslav that I could not understand. Any idea on how this works ?

I didn't believe at first, but it seems that it is always best to place the police station at n/2 (0-based index) to minimize the overall distance. Nobik_Glem is making use of that fact.

Vladyslav's solution is based on noticing that (one) best position to place the police station is on the [n/2]-th criminal's position. (I've tried to explain why in a comment below). I think DanAlex's 6533273 is more elegant.

Why we must use n/2, not (n+1)/2?

If n is odd, then n/2 is obviously better. If n is even, they both give the same result.

Some elaboration on 427E would be very helpful. Could someone please explain the solution to me?

My solution for E: If we simplify the problem for m = 1, then (one) best location is the [n/2]-th criminal's position (if n is even there are multiple best locations). If we move it by one point further from any direction, we would be farther from n/2 + n%2 criminals and closer to n/2 criminals..

Does something change when m is higher? Not at all.. We want to collect the furthest criminals together (so the total distance we travel is smallest), so we just look at the positions 0, m, 2*m and n-1, n-1-m, n-1-2*m (until these two sequences cross each other) and so on and we solve the problem for these positions and m = 1.., so the solution is still the same..

when we know the position of the police station it is easy to calculate the result. Even easier is to notice, that there is equal amount of points when we turn the car and start returning on the left and right from the police station and noticing that right — middle + middle — left == right — left, so we can calculate right — left for the interesting points (sequences 0, m, 2*m, ... for left and n-1, n-1-m, n-1-2*m, ... for right) until they meet..

i think that the hint stated in this short editorial is actually for a harder version of this problem which does not occur on a straight line but on a tree, there we have to calculate "how many nodes am i getting closer to" and "how many am i getting farther from " by traversing this path for each path (using two DFS for example), calculating total distance from every node to root of the tree and then traverse through each path and re-calculate the total distance from it by looking at the pre-calculated information. On a straight-line we know how many nodes we are getting closer and farther from so we can minimize it (by placing the optimal position to the middle straight forward)

Thanks for the explanation. It helps a lot.

My solution works with ternarySearch , in fact when you fix a point for example if x = -10^9 the answer is very huge , if x = 10^9 then the answer is very huge , then we can see a function that decrease first then increase.

You can see Yeputon's picture.

Tutorial for ternarySearch

My solution

In the contest my solution fails in test 10 because i have overflow in my variables lo , hi. I fix it and i got accepted.

Do you have any proof (formal or informal) that the function will just decrease and then increase?

Only examples that i resolved manually.

D можно сдать и бором, а в Е точка, куда ставить станцию это всегда a[(n + 1) / 2]. По крайней мере тесты такое решение прошло :)

По-моему там целый диапазон, где можно ставить.

Это правда потому что : стоим мы в искомой точке, теперь попробуем перейти на некоторое расстояние влево или вправо, если влево : то у нас справа больше вершин чем слева, значит мы ухудшим ответ, аналогично для перехода направо

I solved D in O(n^2) differently — for every suffix s of s1 one can calculate in O(n) the shortest prefix of s which appears in s1 and s2 only once. You do that by computing the shortest pref-suff tables for words s+#+s1 and s+#+s2 as if you wanted to search for s in those strings. If the desired prefix of s has length t then after some drawing it turns out that t is simply the smallest value appearing in both tables exactly one.

I have another way to solve 427B — Prison Transfer Let count the invalid value (a[i] > t) in first c numbers. Every time move to the right, we just need to check 2 numbers: the old number (the left most number of old segment) and the new number (the right most number of new segment). If invalid number is 0, that 's mean this segment is valid.

Sorry for my english, this is my AC solutions: http://codeforces.com/contest/427/submission/6526709

My solution can't passed test 142 . Why?

It looks like you use hashing modulo 2

^{64}. That isn't reliable: Anti-hashtestCan someone explain 427C ?

Fist you have to learn Strongly Connected Components SCC

Wiki

There have two famous algorithm that solve :

-Kosaraju Algorithm

-Tarjan Algorithm

MySolution (I used Tarjan)

Knowing SCC then the solution is pretty easy , for every SCC choose the nodes with the min cost.

Thank you but can you explain why do we need to go for SCC? and is tarjan is efficient than kosaraju?

1.the definition of SCC is that for each pair of nodes x,y,there exist one path from u to v and a path from v to u,which is exactly the requirment of the problen. 2.asymptotically these two are equivalent in efficiency.while in practice,tarjan is faster and more space-saving than kosaraju。

Thank you :)

whats wrong in test case 71? my soln. gets ok before 71... can't figure out ???

If you're employing Kosaraju then it's very likely that you're not properly calculating finishing times in the first DFS. Try this test case: 5 [16, 4, 66, 45, 35] 5 [[0, 4], [1, 4], [2, 3], [0, 1], [0, 2]]

Is 427C solvable by using Kosaraju's algo and color the vertices belonging to same SCC wit h some color? Or is there a better way to solve this? Please post a link also to your submissions. Thanks :)

I used the same algo and it passed with good timing

this is my code: 6533487

I solved using Kosaraju's Algorithm for SCC. Here is my solution — https://codeforces.com/contest/427/submission/85106512

D — easy

O(n)suffix automaton solution. 6536429Thank you a lot for great clue. I think this was the only solution which worked for Python. I am still wrapping my head around the whole thing. It is not "easy" :) I finished course on Automata at Coursera website and I had previous exposure to Knuth–Morris–Pratt algorithm, so I think I was ready for the idea, but it is still difficult.

This is solution in Python: 6546632

Now I want to rewrite the whole thing as reasonably convenient class and add it to my toolbox. Thank you a lot!

Could you share the parts of ideas of automaton solution? : ]

BTW, are you sure your solution is also O(N)? I have spotted some sorting there.

No, it's not O(N), I do have sorting. It is possible to avoid this sorting as was done in submission above (Bugman). As for description of algorithm — this comment is good:

http://codeforces.ru/blog/entry/12082#comment-168324

I just implemented suffix automation (almost straight from the book). Actual solution part starts with line "best = 10e10"

Can you explain how to solve this problem with suffix automaton?

Here's how I solved it using Suffix Automaton. First construct the string $$$s = a +$$$ '@' $$$+ b$$$, ($$$a$$$ and $$$b$$$ are the input strings) and construct the SA for it. Let's define two notations:

$$$terminal1$$$ nodes: These are the nodes that have an outgoing transition corresponding to the '@' character.$$$terminal2$$$ nodes: These are the nodes which have been marked as terminal nodes of the string $$$s$$$ by the SA.Now, for a string to be a common substring of both $$$a$$$ and $$$b$$$ also to be unique in both $$$a$$$ and $$$b$$$, the state corresponding to the string must have exactly $$$1$$$ reachable $$$terminal1$$$ node and $$$2$$$ reachable $$$terminal2$$$ nodes.

ProofThe no. of $$$terminal1$$$ states reachable from a state corresponding to a substring $$$t$$$ tells us how many times $$$t$$$ appears as a substring (or a prefix of some suffix) in $$$a$$$, and the no. of $$$terminal2$$$ states reachable from it tells us how many times is $$$t$$$ a substring in $$$s (= a + b)$$$. If it occurs once as a substring in $$$a$$$, and 2 times in $$$s$$$, then, no. of its occurrences in $$$b = (2 - 1) = 1$$$.

Let's call it a good state. The no. of nodes of each type reachable from a particular state/node is easily computed using dp. Now, we can simply iterate over all states and for a state which is good, we know that all substrings ending at this state are common substrings in $$$a$$$ and $$$b$$$ and are also unique. The length of the smallest substring ending at the current state($$$i$$$) = $$$len(link(i)) + 1$$$, where $$$link(i)$$$ is the node being pointed by the suffix link of $$$i$$$, and $$$len(link(i))$$$ is the longest substring ending at $$$link(i)$$$.

Code

P.S.: I wanted to write the dollar symbol instead of '@', but wasn't able to do so in markdown. If you have any idea how to write a dollar symbol, please tell me.

Hi guys. I used java to write the solution to problem C. And I also used the SCC way , and its O(m) implementation (Tarjan algorithm). Can anyone please tell me why my solution timed out on the final tests:

https://gist.github.com/anonymous/7c8ce4e7d76f7015424d

Probably because

`Scanner`

is slow. You can see this for more information: http://acm.timus.ru/help.aspx?topic=java&locale=enThanks for your suggestion. I really didnt know that before. However even after replacing Scanner with StreamTokenizer as mentioned in the page you sent me, I still have the same time limit exceed on the same test case (test11)

I got TL11 too: 6537605.

I used Kosaraju algorithm to find strongly connected components. This algorithm consists of following parts:

1) Do DFS to find out time of leaving for every vertice. (dfs1(int) in my code)

2) Reverse graph.

3) Do DFS in reversed graph to find out SCC. (dfs2(int, int) in my code)

DFS should be started from vertices sorted in descending order by leaving time in non-reversed graph.I was sorting them in O(n^2). So when I replaced this with O(nlogn) sort, I got AC: 6537714.

I hope this information will help you. And sorry for my english.

You don't need to sort anything — simply add vertices to a new list when you leave them in the first DFS. Then visit the vertices in this list starting from the end.

Finally I got my Python to run below 2 seconds for 427C. Reading (and creating graph) took around 0.7s from the beginning (referring to largest case with 100,000 nodes). My own solution based on algorithm described here:

http://e-maxx.ru/algo/strong_connected_components

Took another 1.5s to find SCC. Then another 0.3s to finalize calculation — 2.5s total — hello TLE ! Adapting SCC calculation procedure (based on Tarjan's algorithm) from networkX dropped the time to 1.2s total — solved.

Should I continue to use Python? I don't know. I did C++ back in 90-ies (I was doing some DirectX programming) and Java in mid 2000-s. But for me it has always being hobby/recreational stuff and I am not sure that I wont to retrain in another language. But of course it is a little bit sad that solution does not pass only because of taking 0.5 seconds more then allowed because of scripting language.

I would wholeheartedly voted for using PyPy in Codeforces competitions. It is much faster, especially in Dynamic Programming tasks (really up to 10 times faster) and I think majority of Python problems would be solved immediately. PyPy has very good compatibility with Python 2. It has problems with third-party modules, but it is not an issue with Codeforces because Codeforces does not allow any third-party modules anyway.

So — can we start motion for taking on PyPy in Codeforces?

Just example — my solution above takes — at my local PC solution discussed above takes 1.64 with Python and 1.06 with PyPy. Remembering that 0.7 goes to reading the file, this is a huge difference.

It's my first time here. I am used to topcoders.com where the programming language doesn't really matter. Numbers are chosen in a way that the only thing that counts is whether you got the right algorithm or not. I wish that codeforces.com will use the same strategy. It's pretty sad as you mentioned to see solutions refused because they require a split second more.

Did you try PyPy? I use it for Google Codejam and it does miracles — I would say that if I am to use PyPy at Codeforces I would never again raise issue of Python being too slow :)

No I didn't. I am used to JAVA. I also code in C++ at work. But all my personal "toolbox" (that I gathered since years ago) is in JAVA. Thanks for your information. I'll share it around with python users that I know.

I think that this strategy can be somehow limiting for problemsetters.

A possible (but more "expensive") strategy should be writing solutions in different languages and set different TL value for each one.

I agree that this issue is important (see editorial comment for 424D - Biathlon Track for example), but I cannot figure a possible, fair solution for that, and personally I wouldn't like to see CF setting TC-like problems...

Thanks for your reply.

But I still don't understand why it would be a limitation to the creativity of problem setters (for example to put n < 10^7 instead of n < 5. 10^7 even when the latter is enough for C++)

My poor understanding is probably due to my modest experience in programming challenges.

[In my humble opinion] I think that low constraint values force problemsetters to "live" with the fact that some solutions with greater asymptotic growth than the expected solution will get AC instead of a (possibly) desired TLE.

Some programming tasks are non-trivial just because a naive method is too slow for a possible maximal testcase with the statement constraints. With small values it would be impossible to distinguish efficient solutions from the less-eficient ones. That's why I think this is somehow limiting for problemsetters and, consequently, I think this allows CF to have more problem variety than TC has.

Quick example: Consider the problem 424B - Megacity. A quadratic/cubic/etc solution is clearly slow with these constraints, but now imagine the same problem with, let's say, 1 ≤

n≤ 100. Almost every "dirty" solution would pass.Thanks for your example. I understand your point now.

WA on test 112 in problem E :(

I had exactly the same problem.

The way test 112 is different from any other is that m = 1, so basically you "cut" away prisoners by 1. My program had two indices, i and j going from different directions and meeting in the middle.

Test 112 was the only case where left index overrun right index — after main cycle left index ended up being larger then right index. I didn't check for that and in final "adjustment" was just adding final distance between i and j. When i overrun j I ended up actually subtracting last distance from solution.

Again — this happened only in case 112. If you algorithm is different, then my hint is still — think where it can breakdown if m = 1.

My solution for problem E is pretty simple.

The best place to build the poclie station will always be the median. So just iterate from pos 0 to the median and from last position to the median in m-to-m steps while adding the absolute value of the visited positions minus the median position (*2) to the final answer.

This is my code: http://ideone.com/H9W9tP

Thank you very much, your answer really helped me, Just one question, I did this problem in java, and was using int, but some answers were wrong(I'm guessing overflowing), then changed to long and it was fine, why is this ?, int are supposed to be 2^32 which is greater than 10^9 , Sorry if my question is really dumb, I dunno much about these things...

You're welcome :)

About your question: I'm not 100% sure, but I think that when adding all distances total sum could exceed 10^9 so I it is preferible to use long, in order to avoid overflowing.

Hope it helps :)

Thank you very much for your explanation, guess you're right ! Another thing, and sorry to bother you again, why you take m steps, is it because you always will carry the m criminals in the way when you make one step ? and also how did you come up with the best position being the median, once again sorry to bother you, I'm just starting with all of these problems.

There's no bother :)

Yes, I take m steps because with that I avoid to go twice across the longest distances, so I always "pick up" criminals that are one next to other.

I remember I read once that for going through a path with the shortest distance you have to start always in the median. So I checked it and it worked with the 'm' steps too, so I supposed I could get Accepted :D

Thank you very much for the explanation :)

For 427C, I used Tarzan algorithm on Java, but always get TLE on Test case 11 http://codeforces.com/contest/427/submission/6543050 Is it because I create a inner class Node (No)? Could someone please help?

http://codeforces.com/blog/entry/12082#comment-167948

Thanks for your advice!!! I changed to use BufferedReader and got accepted. Have no idea how Scanner.in is that slow...

Tarzan — :)

I can't view the model solutions — it says "You are not allowed to view the requested page". Is that normal?

Same here :[

Fixed! :)

While solving "Prison transfer", I got accepted with the code 6547406 however using a vector, the solution 6547425 turned runtime error. Could anyone please explain why a vector wont work.

Who can explain me the algo with suffix arrays for 427D?

We can sort the suffixes of both strings using a single suffix array (on the string

s_{1}#s_{2}#). Note that later we can recognize which string does each suffix belong to: if its index is less than |s_{1}| (0-based), than it belongs tos_{1}, if its index is greater than |s_{1}|, it belongs tos_{2}.Now suppose there is some string

tthat is a unique substring ofs_{1}and a unique substring ofs_{2}. Let's think of the corresponding prefixes ofs_{1}ands_{2}where this string starts. Since only they have the common prefixt, they have to be adjacent in the suffix array, let's say atp[i] andp[i+ 1]. Also, the longest common prefix ofp[i- 1] andp[i] is less than |t|; and the longest common prefix ofp[i+ 1] andp[i+ 2] also is less than |t|.So, this leads to a solution: iterate over all adjacent positions in the suffix array,

p[i],p[i+ 1]. Calculate:x=lcp(p[i- 1],p[i]),z=lcp(p[i],p[i+ 1]),y=lcp(p[i+ 1],p[i+ 2]).Then each prefix of

p[i] with length of at leastmax(x,y) + 1 and at mostzis unique in boths_{1}ands_{2}. So ifmax(x,y) + 1 ≤z, we can update the answer withmax(x,y) + 1.Check out my submission: 6538270.

5 years later and this comment is still useful and helped me get AC. People like you make the world a better place.

in 427C,after we choose the min node in each SCC,do we just count the number of the min nodes? and add it to the number of way?because if example test 3 my way is 3.

I found it that you need to find the numbers of min nodes in each component. Then the multiply of them is the result.

Test 3: there are 3 components - The component contains node-9 & node-10 will have 2 ways, which is equals to 10. - The component contains node-8 is only one way. - The component contains the rest nodes have 3 ways of 1-valued nodes, 1-5-7.

So the result is 2 * 1 * 3 = 6. Hope it help.

hello, i am very new to programming... could anyone tell me how to return multiple values in a recursive function in c++??

You can use std::pair;

Tell me please, how can solve the problem E by using a ternary search? (exactly, how to consider the place in the patrol car)

Am I very lucky? My E solution is simple. I just find if the capacity of patrol car is greater than or equal to the number of criminals, simply subtract two end-points and multiply by 2. If it is less than, I find the middle position and calculate from it to 2 end-points.

My submission's here: 6536182

It is correct because if you change point to the left, you make result better for left side, but you make worse for right side, and vice-versa;

My solution: 6556865

Oh thank you, I got it :)

Can someone explain the DP solution to problem D? The editorial says what has to be done. I can't understand why they are doing it that way. Any help will be appreciated. Thanks

427D :

If I correctly understand the problem statement, isn't it possible if certain substring of input string occurs twice in return value? I mean applepp / pepperoni returns 2 when I run my accepted solution. But I think "pp" occurs twice in applepp so it should not be substring because of definition. Am I right??

EP, you are rightyou still have "ep" being unique on each string.

Can problem D be solved by the Z algorithm? If so can someone explain please.

427C - Checkposts : Wrong answer on test 72, my solution 6991595, any explanation?

Just increase your INF by adding 2 ,3 more 9s & you will get AC (:

Does anyone have a proof that the function (ternary search solution) for problem E will just decrease then increase?

I tried it on many samples, but can not fine any proof for this!!

I am a beginner , if anyone can explain for 427 B , why do we select like L-C +1 ways ? How we can arrive to a constraint like it ?

Sorry, can anyone help me please.

Here is my submission for problem 427D: http://codeforces.com/contest/427/submission/26701755.

I got WA on test 17 and can't understand why. My solution:

f[i][j]: longest common string end at s1[i] and s2[j];

f1[i][j]: longest common string end at s1[i] and s1[j];

f2[i][j]: longest common string end at s2[i] and s2[j];

max1[i]: longest common string end at i with all position j in s1 except i.

max2[i]: longest common string end at i with all position j in s2 except i.

Then for all pair(i, j) have f[i][j] > max(max1[i], max2[j]): i update answer;

Can anyone help me what im doing wrong in Tarjans SCC. Im getting WA on test 95 of problem C. CODE

In 427E — Police Patrol this solution passes 69 test cases!! I am wondering now, sol1 and sol2 (appeared in previous comments) really works fine! I need a clear proof of that median approach. Can anyone give me a proof?

Someone please help me find the problem in the solution(in the part to compute the number of cases). Please check my code https://codeforces.com/contest/427/submission/76030254

Count only the number of nodes with minimum cost.

for the Checkposts question, the time constraints are so tight. A good trick is to precompute the minimum costs for each SCC by storing all the minimum costs in an array.