### Edvard's blog

By Edvard, history, 5 years ago, translation,

### 665A - Buses Between Cities

The problem was suggested by Sergey Erlikh unprost.

Consider the time interval when Simion will be on the road strictly between cities (x1, y1) (x1 = 60h + m, y1 = x1 + ta). Let's iterate over the oncoming buses. Let (x2, y2) be the time interval when the oncoming bus will be strictly between two cities. If the intersection of that intervals (x = max(x1, x2), y = min(y1, y2)) is not empty than Simion will count that bus.

С++ solution

Complexity: O(1).

### 665B - Shopping

The problem was suggested by Ayush Anand JeanValjean01.

In this problem you should simply do what was written in the problem statement. There are no tricks.

C++ solution

Complexity: O(nmk).

### 665C - Simple Strings

The problem was suggested by Zi Song Yeoh zscoder.

There are two ways to solve this problem: greedy approach and dynamic programming.

The first apprroach: Considerr some segment of consecutive equal characters. Let k be the length of that segment. Easy to see that we should change at least characters in the segment to remove all the pairs of equal consecutive letters. On the other hand we can simply change the second, the fourth etc. symbols to letter that is not equal to the letters before and after the segment.

Greedy approach on C++

The second approach: Let zka be the minimal number of changes so that the prefix of length k has no equal consecutive letters and the symbol s'k equals to a. Let's iterate over the letter on the position k + 1 and if it is not equal to a make transition. The cost of the transition is equal to 0 if we put the same letter as in the original string s on the position k + 1. Otherwise the cost is equal to 1.

DP solution on C++

Complexity: O(n).

### 665D - Simple Subset

The problem was suggested by Zi Song Yeoh zscoder.

Consider the subset A that is the answer to the problem. Let a, b, c be the arbitrary three elements from A and let no more than one of them is equal to 1. By the pigeonhole principle two of three elements from a, b, c have the same parity. So we have two integers with even sum and only one of them is equal to 1, so their sum is also greater than 2. So the subset A is not simple. In this way A consists of only two numbers greater than one (with a prime sum) or consists of some number of ones and also maybe other value x, so that x + 1 is a prime.

We can simply process the first case in O(n2) time. The second case can be processed in linear time. Also we should choose the best answer from that two.

To check the value of order 2·106 for primality in O(1) time we can use the simple or the linear Eratosthenes sieve.

C++ solution

Complexity: O(n2 + X), where X is the maximal value in a.

### 665E - Beautiful Subarrays

The problem was suggested by Zi Song Yeoh zscoder.

The sign is used for the binary operation for bitwise exclusive or.

Let si be the xor of the first i elements on the prefix of a. Then the interval

Unable to parse markup [type=CF_TEX]

is beautiful if . Let's iterate over j from 1 to n and consider the values sj as the binary strings. On each iteration we should increase the answer by the value zj — the number of numbers si (i < j) so . To do that we can use the trie data structure. Let's store in the trie all the values si for i < j. Besides the structure of the trie we should also store in each vertex the number of leaves in the subtree of that vertex (it can be easily done during adding of each binary string). To calculate the value zj let's go down by the trie from the root. Let's accumulate the value cur equals to the xor of the prefix of the value sj with the already passed in the trie path. Let the current bit in sj be equal to b and i be the depth of the current vertex in the trie. If the number cur + 2i ≥ k then we can increase zj by the number of leaves in vertex , because all the leaves in the subtree of tha vertex correspond to the values si that for sure gives . After that we should go down in the subtree b. Otherwise if cur + 2i < k then we should simply go down to the subtree and recalculate the value cur = cur + 2i.
C++ solution

Comlpexity by the time and the memory: O(nlogX), where X is the maximal xor on the prefixes.

### 665F - Four Divisors

The editorial for this problem is a little modification of the materials from the lecture of Mikhail Tikhomirov Endagorion of the autumn of 2015 in Moscow Institute of Physics and Technology. Thanks a lot to Endagorion for that materials.

Easy to see that only the numbers of the form p·q and p3 (for different prime p, q) have exactly four positive divisors.

We can easily count the numbers of the form p3 in , where n is the number from the problem statement.

Now let p < q and π(k) be the number of primes from 1 to k. Let's iterate over all the values p. Easy to see that . So for fixed p we should increase the answer by the value .

So the task is ot to find — the number of primes not exceeding , for all p.

Denote pj the j-th prime number. Denote dpn, j the number of k such that 1 ≤ k ≤ n, and all prime divisors of k are at least pj (note that 1 is counted in all dpn, j, since the set of its prime divisors is empty). dpn, j satisfy a simple recurrence:

1. dpn, 1 = n (since p1 = 2)

2. dpn, j = dpn, j + 1 + dpn / pj⌋, j, hence dpn, j + 1 = dpn, j - dpn / pj⌋, j

Let pk be the smallest prime greater than . Then π(n) = dpn, k + k - 1 (by definition, the first summand accounts for all the primes not less than k).

If we evaluate the recurrence dpn, k straightforwardly, all the reachable states will be of the form dpn / i⌋, j. We can also note that if pj and pk are both greater than , then dpn, j + j = dpn, k + k. Thus, for each n / i it makes sense to keep only values of dpn / i⌋, j.

Instead of evaluating all DP states straightforwardly, we perform a two-step process:

1. Choose K.

2. Run recursive evaluation of dpn, k. If we want to compute a state with n < K, memorize the query count the numbers not exceeding n with all prime divisors at least k''.

3. Answer all the queries off-line: compute the sieve for numbers up to K, then sort all numbers by the smallest prime divisor. Now all queries can be answered using RSQ structure. Store all the answers globally.

4. Run recurisive evaluation of dpn, k yet again. If we want to compute a state with n < K, then we must have preprocessed a query for this state, so take it from the global set of answers.

The performance of this approach relies heavily on Q — the number of queries we have to preprocess.

Statement. .

Proof:

Each state we have to preprocess is obtained by following a dpn / pj⌋, j transition from some greater state. It follows that Q doesn't exceed the total number of states for n > K.

The preprocessing of Q queries can be done in , and it is the heaviest part of the computation. Choosing optimal , we obtain the complexity .

C++ solution

Complexity: .

• +70

 » 5 years ago, # |   0 Auto comment: topic has been updated by Edvard (previous revision, new revision, compare).
 » 5 years ago, # |   -38 nice editorial
 » 5 years ago, # | ← Rev. 2 →   +21 This problem is also an easier version of This Problem !
•  » » 5 years ago, # ^ |   +2 That's why you were able to solve it?
•  » » » 5 years ago, # ^ |   0 Yeah!
•  » » » » 5 years ago, # ^ |   +3 Cool. :)
•  » » 5 years ago, # ^ |   +21 Endagorion told me that there are something very similar at Project Euler. Also the problem to count semiprimes was last year at MIPT camp (the editorial from there). Anyway I think it's very good problem for Educational Round.Funny:
•  » » 5 years ago, # ^ |   +11 Can you explain your solution or provide some link to the theory behind it? It looks much simpler than author's.
•  » » » 5 years ago, # ^ | ← Rev. 2 →   +23 Let S(v,m) be the count of integers in the range 2..v that remain after sieving with all primes smaller or equal than m. That is S(v,m) is the count of integers up to v that are either prime or the product of primes larger than m. S(v, p) is equal to S(v, p-1) if p is not prime or v is smaller than p2. Otherwise (p prime, p2<=v) S(v,p) can be computed from S(v,p-1) by finding the count of integers that are removed while sieving with p. An integer is removed in this step if it is the product of p with another integer that has no divisor smaller than p. This can be expressed asS(v,p)= S(v,p−1)− ( S(v/p, p−1)− S(p−1,p−1) ).During computation of S(N,p) it is sufficient to compute S(v,p) for all positive integers v that are representable as floor(N/k) for some integer k and all p ≤ v1/2.NOTE: Pi(N) = S(N,N). When you call S(N,N) it will need to compute S(N/k,N/k) in its lower substate. Hence you can have all required values of Pi(N/k).In my code DSUM(N,P) do the job of calculating S(N,P).I used two arrays H[] and L[] for storing the values of S(N/k,p) in H[k] for k<=N1/2 and for k>=N1/2 I stored the values of S(N/k,p) in L[N/k].For computation I started with p=2 and changed the values of all the state which is going to be affected by this particular prime. Continue doing this for all prime till N1/2 and at the end for k<=N1/2, H[k] will contain the values of Pi(N/k) and L[k] will contain the values of Pi(k).PS: My complexity is O(N3/4).Idea: This Post!
•  » » » » 5 years ago, # ^ |   0 Can I get your code please ???
•  » » » » 5 years ago, # ^ |   0 Can you explain why the time complexity of your solution is O(N3 / 4) (I find it difficult to calculate it)
•  » » » » » 5 years ago, # ^ |   +5 Let .Notice that v could only be i or , where 1 ≤ i ≤ m, and for each S(v, v) we would enumerate values to calculate it. So the time complexity of the above algorithm is The former part is always smaller than the latter, so we could only analysis the complexity of the latter part, which would be same order as and it's $O(n^{3/4})$ .By the way, if you preprocess the π(m) for m ≤ n2 / 3, you could find that the integral becomes and it's $O(n^{2/3})$ . :)
•  » » 5 years ago, # ^ | ← Rev. 3 →   +9 I got AC there with the simple modification of the solution described in editorial:
 » 5 years ago, # |   +13 The editorial for this problem is a little modification of the materials from the lecture of Mikhail Tikhomirov... Is it possible to find these materials?
•  » » 5 years ago, # ^ |   +5 I think he means to refer to this http://www.ams.org/mcom/1996-65-213/S0025-5718-96-00674-6/S0025-5718-96-00674-6.pdf
 » 5 years ago, # |   +11 In problem F, how the recurrence dp(n, j) = dp(n, j + 1) + dp(⌊ n / pj⌋, j) is being derived?
•  » » 5 years ago, # ^ | ← Rev. 3 →   +6 Here's what i think:dp(n,j) counts all positive integers k with the properties: 1 ≤ k ≤ n k = r1a1r2a2...rvav, where r1, r2, ... , rv primes  ≥ pj. Now we can split this set into 2 disjoint subsets: all numbers from 1 to n inclusive whose prime factors are ALL bigger than pj. This subset has exactly dp(n,j+1) elements. all numbers from 1 to n inclusive that don't satisfy the previous property. Those are numbers in [1,n] that contain at least once pj as a factor and all of their other factors are at least pj as well. If k2 is such a number then it takes the form: k2 = pjar1a1r2a2... rvav = pj * k3, where pj is the j-th prime number and r1, r2, ..., rv are all primes bigger than or equal to pj.k3 is a number obviously in the range [1...⌊ n / pj⌋] with every factor in its PPF (Prime Power Factorization) being at least pj.There are dp(⌊ n / pj⌋,j) such numbers,so the recursion is correct.
 » 5 years ago, # |   0 In problem D, "Let's define a subset of the array a as a tuple that can be obtained from a by removing some (possibly all) elements of it ". Is there exists any case where (possibly all) all elements will be removed,i cant fix it..
•  » » 5 years ago, # ^ |   0 No.
 » 5 years ago, # |   0 What is the best approach for B if the constraints were higher (10^5 instead of 100 ) ?
•  » » 5 years ago, # ^ |   0 I have only one idea to optimise it to O(n*k*log(m)) using segment tree.
•  » » 5 years ago, # ^ | ← Rev. 2 →   0 using penwick tree , we can solve O(n*m*log(k+n*m))first we set the value Position[i] = positiona1 , a2 ,a3 ,.... an Position[a1]= n*m+1, Position[a2]= n*m+2,... Position[ak] = n*m+kand make variable pos = n*m;and initialize penwick tree using Position[i] .if we find item X, then add penwick_query(Position[x]) to return value.and decrease_penwick(Position[x],-1) , Position[x]= pos--, penwick_increase(Position[x],1);above action's time complexity is O(log(n*m+k) ).
•  » » » 5 years ago, # ^ |   -9 do you mean fenwick tree?
•  » » 5 years ago, # ^ |   0 also you can write an O(n*m*log(k)) solution with ordered set.http://codeforces.com/contest/665/submission/19748159
 » 5 years ago, # |   +1 In problem F, can someone explain the two-step process of evaluating the DP States better?
 » 5 years ago, # |   +5 Can someone explain me the condition cur+2^i >=k in problem E?
 » 5 years ago, # |   0 A question regarding problem E. When I was solving the problem, instead of writing int b = (x >> i) & 1;, I wrote int b = x & (1 << i). This change gave me AC (i was in the same bounds as in the c++ solution).What's the difference?
•  » » 5 years ago, # ^ |   +10 Good day to you :)It returns different value:int b = (x >> i) & 1; Returns 1, if ith bit is 1int b = x & (1 << i); Returns 2^i, if ith bit is 1Hard to say, what happened next (for futher investigation, more code would be needed)Hope it helped a bit ~ Good Luck :)
 » 5 years ago, # |   0 can anyone plz explain D in detail !unable to grab it!thnxxxx
•  » » 5 years ago, # ^ |   0 1.If there's multiple ones in original set, we should choose them, because 1+1=2, 2 is a prime number.2.Now consider what are the extra elements we should insert into the answer. I donate the answer is {1,1,....,1,A,B,C,....}, look at the {1,A,B}, there are three elements, each of them must be odd or even, so there must be two element have the same parity, so add them together will get a even number larger than 2, that is definitely not a prime number.3.So you see, if we exclude all the ones in the answer, the answer size must less or equal to 2.
 » 5 years ago, # |   +1 ans(Problem E) == (n * (n + 1) / 2) — ans(http://www.spoj.com/problems/SUBXOR/)
 » 5 years ago, # |   0 Hey guys, I use the DFS to solve problem D. I'm confused why my code passed test 11 only used 78ms where n equals to 1000, but get a TLE at test 12? here's my solution:codeThanks
 » 5 years ago, # |   0 For E: Can someone please explain why we have to flip the bit b in function get()?Thank you.
 » 5 years ago, # |   0 Can someone explain what is RSQ structure? It is mensioned in problem F. Had no idea what it is. Thanks.
•  » » 5 years ago, # ^ | ← Rev. 2 →   0 Google "Range Sum Query", "Fenwick tree", "Segment Tree".
 » 5 years ago, # |   0 Can anyone explain the editorial of Problem E in more detail?
 » 5 years ago, # | ← Rev. 2 →   0 There is also another approach that I thought of: But it's a bit slow.For all the numbers till n, we will check the divisors for the ith number till its square root — and if a number has exactly two divisors till square root of the number i.e √i. Then it will have exactly four divisors. Note: Excluding the perfect square numbers~~~~~ Your code here... import math n = int(raw_input()) counter = 0 for i in range(1,n+1): c = 0 sq = math.sqrt(i) if (sq).is_integer(): continue j = 1 while j <= sq: if i%j==0: c+=1 j+=1 if c==2: print i counter+=1 print counter  ~~~~~ Your code here... `
 » 5 years ago, # | ← Rev. 2 →   0 Could somebody explain me in problem E, why do we have to go down to the subtree (b xor 1) when (cur + 2^i) < k ?
 » 3 years ago, # |   0 In problem E , L can equal to R . So I think we should check each elements of the array if it >= k
•  » » 3 years ago, # ^ |   0 mạnh
•  » » » 3 years ago, # ^ |   0 xàm
 » 21 month(s) ago, # |   0 Now we can simply solve the problem F with min_25 sieve in $O(\frac{n^{\frac{3}{4}}}{\log n} + \sqrt n)$ !!