Разбор Looksery Cup 2015

Revision en3, by Monyura, 2015-06-06 20:24:55

A. Face Detection

Author: Monyura

One should iterate through each 2x2 square and check if it is possible to rearrange letters in such way they they form the word "face". It could be done i.e. by sorting all letters from the square in alphabetic order and comparing the result with the word "acef"(sorted letters of word "face").

B. Looksery Party

Author: Igor_Kudryashov

In any cases there is such set of people that if they come on party and send messages to their contacts then each employee receives the number of messages that is different from what Igor pointed. Let's show how to build such set. There are 2 cases.

There are no zeros among Igor's numbers. So if nobody comes on party then each employee receives 0 messages and, therefore, the desired set is empty.

There is at least one zero. Suppose Igor thinks that i-th employee will receive 0 messages. Then we should add i-th employee in the desired set. He will send messages to his contacts and will receive 1 message from himself. If we add other employees in the desired set then the number of messages that i-th employee will receive will not decrease so we can remove him from considering. Igor pointed some numbers for people from contact list of i-th employee and because they have already received one message we need to decrease these numbers by one. After that we can consider the same problem but with number of employees equals to n - 1. If the remaining number of employees is equal to 0 then the desired set is built.

C. The Game Of Parity

Author: olpetOdessaONU

If n = k no moves may be done. The winner is determined with starting parity of citizens' number. Otherwise let's see that the player making the last move may guarantee his victory, if there are both odd and even cities when he makes the move. He just selects the city of which parity he should burn to obtain required parity. So, his enemy's target is to destroy all the cities of some one type. Sometimes the type does matter, sometimes doesn't. It depends on the player's name and the parity of k. So the problem's solution consists in checking if "non-last" player's moves number (n - k) / 2 is enough to destroy all the odd or even cities. If Stannis makes the last move and k is odd, Daenerys should burn all the odd or all the even cities. If k is even, Daenerys should burn all the odd cities. If Daenerys makes the last move and k is even, Stannis has no chance to win. If k is odd, Stannis should burn all the even cities.

D. Haar Features

Author: Monyura

This problem had a complicated statement but it is very similar to the real description of the features. Assume that we have a solution. It means we have a sequence of prefix-rectangles and coefficients to multiply. We can sort that sequence by the bottom-right corner of the rectangle and feature's value wouldn't be changed. Now we could apply our operations from the last one to the first. To calculate the minimum number of operations we will iterate through each pixel starting from the bottom-right in any of the column-major or raw-major order. For each pixel we will maintain the coefficient with which it appears in the feature's value. Initially it is 0 for all. If the coefficient of the current cell is not equal to  + 1 for W and  - 1 for B we increment the required amount of operations. Now we should make coefficient to have a proper value. Assume that it has to be X( - 1 or  + 1 depends on the color) but current coefficient of this pixel is C. Then we should anyway add this pixel's value to the feature's value with the coefficient X - C. But the only way to add this pixel's value now(after skipping all pixels that have not smaller index of both row and column) is to get sum on the prefix rectangle with the bottom-left corner in this pixel. Doing this addition we also add X - C to the coefficient of all pixels in prefix-rectangle. This solution could be implemented as I describe above in O(n2m2) or in O(nm).

Also I want to notice that in real Haar-like features one applies them not to the whole image but to the part of the image. Anyway, the minimum amount of operations could be calculated in the same way.

E. Sasha Circle

Authors: Krasnokutskiy, 2222

Coming soon

F. Yura and Developers

Authors: Rubanenko

Let's consider following solution:

Let f(l, r) be the solution for [l, r] subarray. It's easy to see that f(1, n) is the answer for the given problem. How should one count f(l, r)? Let m be an index of the maximum value over subarray [l, r]. All the good segments can be divided into two non-intersecting sets: those that contain m and those that don't. To count the latter we can call f(l, m - 1) and f(m + 1, r). We are left with counting the number of subarrays that contain m, i.e. the number of pairs (i, j) such that l ≤ i < m < j ≤ r and g(i, m - 1) + g(m + 1, j)%k = 0 (g(s, t) defines as + as + 1 + ... + at). Let s be the sequence of partial sums of the given array, i.e. si = a1 + a2 + ... + ai. For every j we are interested in the number of such i that sj - si - am%k = 0, so if we iterate over every possible j, then we are interested in number of i that si = sj - am(modk) and l ≤ i < m. So we are left with simple query over the segment problem of form "how many numbers equal to x and belong to a given segment (l, r)". It can be done in O(q + k) time and memory, where q is the number of generated queries. Model solution processes all the queries in offline mode, using frequency array(have a look at the code for for better understanding).

One can notice that in the worst case we can generate O(n2) queries which doesn't fit into TL or ML. However, we can choose which is faster: iterate over all possible j or i. In both cases we get an easy congruence which ends up as a query described above. If we iterate only over the smaller segment, every time we "look at" the element w it moves to a smaller segment which is at least two times smaller than the previous one. So, every element will end up in 1-element length segment where recursion will meet it's base in O(log(n)) "looking at" this element.

The overall complexity is O(n × log(n) + k).

G. Happy Line

Authors: 2222, MrDindows

Let's reformulate the condition in terms of a certain height the towers, which will be on the stairs. Then an appropriate amount of money of a person in the queue is equal to the height of the tower with the height of the step at which the tower stands. And the process of moving in the queue will be equivalent to raising a tower on the top step, and the one in whose place it came up — down. As shown in the illustrations. Then, it becomes apparent that to make all of the tower on the steps to be sorted, it is enough to sort the tower without the height of step it stays. Total complexity of sorting is O(nlog(n)).

H. Degenerate Matrix

Author: Igor_Kudryashov

The rows of degenerate matrix are linear dependent so the matrix B can be written in the following way: . Suppose . Let's assume that elements of the first row of matrix A are coordinates of point a0 on two-dimensional plane and the elements of the second row are coordinates of point a1. Assume that the rows of matrix B are also coordinates of points b0 and b1. Let's note that in this case the line that is passing through points b0 and b1 is also passing through point (0, 0).

Let's find the answer — the number d — by using binary search. Suppose we are considering some number d0. We need to check if there is such matrix B that In geometric interpretation it means that point b0 are inside the square which center is point a0 and length of side is d0. In the same way the point b1 are inside the square which center is point a1 and length of side is d0. So we need to check if there is a line that is passing through point (0, 0) and is crossing these squares. In order to do this we should consider every vertex of the first square, build the line that is passing through the chosen vertex and the center of coordinate plane and check if it cross any side of the other square. Afterwards we should swap the squares and check again. Finally if there is a desired line we need to reduce the search area and to expand otherwise.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en10 English Monyura 2015-06-09 00:40:44 1 Tiny change: 'omplexity O((|A|+|B|' -> 'omplexity $O((|A|+|B|'
en9 English Monyura 2015-06-09 00:39:51 6444
ru25 Russian Monyura 2015-06-08 02:14:19 1 Мелкая правка: '}, P_0 - P{n-1}$\nОб' -> '}, P_0 - P_{n-1}$\nОб'
ru24 Russian Monyura 2015-06-08 02:13:55 2 Мелкая правка: '_0 - P{n-1]$\nОбознач' -> '_0 - P{n-1}$\nОбознач'
ru23 Russian Monyura 2015-06-08 02:12:32 6
ru22 Russian Monyura 2015-06-08 02:11:32 18995 Мелкая правка: ' + C^{4/3}$, где $С$' -
en8 English Monyura 2015-06-06 20:46:43 2 Tiny change: 'or: [user:monyura,201' -> 'or: [user:Monyura,201'
en7 English Monyura 2015-06-06 20:46:20 54 (published)
ru21 Russian Monyura 2015-06-06 20:45:32 46 (сохранено в черновиках)
ru20 Russian Monyura 2015-06-06 20:34:33 24
en6 English Monyura 2015-06-06 20:34:10 18
ru19 Russian Monyura 2015-06-06 20:32:31 0 (опубликовано)
ru18 Russian Monyura 2015-06-06 20:32:09 18
en5 English Monyura 2015-06-06 20:30:59 11
ru17 Russian Monyura 2015-06-06 20:30:31 2 Мелкая правка: 'о за $O(n^2m^2)$ или ' -> 'о за $O(n^{2}m^2)$ или '
en4 English Monyura 2015-06-06 20:29:29 640
ru16 Russian Monyura 2015-06-06 20:27:02 34
ru15 Russian Monyura 2015-06-06 20:26:08 54
en3 English Monyura 2015-06-06 20:24:55 66
en2 English Monyura 2015-06-06 20:10:05 255
ru14 Russian Monyura 2015-06-06 20:09:03 339
ru13 Russian Monyura 2015-06-06 20:05:44 3
ru12 Russian Monyura 2015-06-06 20:04:04 4 Мелкая правка: 'le="width:60%;height:60%"/>\n\n*' -> 'le="width:40%;height:40%"/>\n\n*'
ru11 Russian Monyura 2015-06-06 20:03:35 4 Мелкая правка: 'le="width:60%;height:60%"/>\n<im' -> 'le="width:40%;height:40%"/>\n<im'
ru10 Russian Monyura 2015-06-06 20:03:06 40
ru9 Russian Monyura 2015-06-06 20:02:06 248
ru8 Russian Monyura 2015-06-06 19:59:43 8
ru7 Russian Monyura 2015-06-06 19:59:10 6
ru6 Russian Monyura 2015-06-06 19:58:48 14
ru5 Russian Monyura 2015-06-06 19:58:08 52
ru4 Russian Monyura 2015-06-06 19:57:47 324
ru3 Russian Monyura 2015-06-06 19:55:39 306
en1 English Monyura 2015-06-06 19:50:58 8489 Initial revision for English translation
ru2 Russian Monyura 2015-06-06 19:47:28 84
ru1 Russian Monyura 2015-06-06 19:45:25 8862 Первая редакция (сохранено в черновиках)