Codeforces Round #326 (Editorial)

Python Code by Haghani

Python Code by Zlobober

588B - Влюбленная Duff (Author: PrinceOfPersia)

Find all prime divisors of n. Assume they are p₁, p₂, ..., p_k (in $\text{[math]}$ ). If answer is a, then we know that for each 1 ≤ i ≤ k, obviously a is not divisible by p_i² (and all greater powers of p_i). So a ≤ p₁ × p₂ × ... × p_k. And we know that p₁ × p₂ × ... × p_k is itself lovely. So,answer is p₁ × p₂ × ... × p_k

Time complexity: $\text{[math]}$

Python Code by Haghani

Python Code by Zlobober

587A - Duff и гири (Author: PrinceOfPersia)

Problem is: you have to find the minimum number of k, such there is a sequence a₁, a₂, ..., a_k with condition 2^a₁ + 2^a₂ + ... + 2^a_k = S = 2^w₁ + 2^w² + ... + 2^w₂. Obviously, minimum value of k is the number of set bits in binary representation of S (proof is easy, you can prove it as a practice :P).

Our only problem is how to count the number of set bits in binary representation of S? Building the binary representation of S as an array in $\text{[math]}$ is easy:

MAXN = 1000000 + log(1000000)
bit[0..MAXN] = {} // all equal to zero
ans = 0
for i = 1 to n
      bit[w[i]] ++ // of course after this, some bits maybe greater than 1, we'll fix them below
for i = 0 to MAXN - 1
      bit[i + 1] += bit[i]/2 // floor(bit[i]/2)
      bit[i] %= 2 // bit[i] = bit[i] modulo 2
      ans += bit[i] // if bit[i] = 0, then answer doesn't change, otherwise it'll increase by 1

Time complexity: $\text{[math]}$

587B - Duff на пляже (Author: PrinceOfPersia)

If we fix x and b_{i_x} mod n, then problem will be solved (because we can then multiply it by the number of valid distinct values of $\text{[math]}$ ).

For the problem above, let dp[i][j] be the number of valid subsequences of b where x = j and $\text{[math]}$ and $\text{[math]}$ . Of course, for every i, dp[i][1] = 1. For calculating value of dp[i][j]:

$\text{[math]}$

For this purpose, we can sort the array a and use two pointer:

if p₀, p₁, ...p_n - 1 is a permutation of 0, ..., n - 1 where for each 0 ≤ t < n - 1, a_{p_t} ≤ a_{p_t + 1}:

for i = 0 to n-1
      dp[i][1] = 1
for j = 2 to k
      pointer = 0
      sum = 0
      for i = 0 to n-1
            while pointer < n and a[p[pointer]] <= a[i]
                  sum = (sum + dp[p[pointer ++]][j - 1]) % MOD
            dp[i][j] = sum

Now, if $\text{[math]}$ and x = l - 1 mod n, then answer equals to $\text{[math]}$ (there are c - j + 1 valid different values of $\text{[math]}$ for the first group and c - j for the second group).

Time complexity: $\text{[math]}$

587C - Duff в армии (Author: PrinceOfPersia)

Solution is something like the fourth LCA approach discussed here.

For each 1 ≤ i ≤ n and 0 ≤ j ≤ lg(n), store the minimum 10 people in the path from city (vertex) i to its 2^j - th parent in an array.

Now everything is needed is: how to merge the array of two paths? You can keep the these 10 values in the array in increasing order and for merging, use merge function which will work in $\text{[math]}$ . And then delete the extra values (more than 10).

And do the same as described in the article for a query (just like the preprocess part).

Time complexity: $\text{[math]}$

587D - Duff в мафии (Author: PrinceOfPersia)

Run binary search on the answer (t). For checking if answer is less than or equal to x (check(x)):

First of all delete all edges with destructing time greater than x. Now, if there is more than one pair of edges with the same color connected to a vertex(because we can delete at most one of them), answer is "No".

Use 2-Sat. Consider a literal for each edge e (x_e). If x_e = TRUE, it means it should be destructed and it shouldn't otherwise. There are some conditions:

For each vertex v, if there is one (exactly one) pair of edges like i and j with the same color connected to v, then we should have the clause $\text{[math]}$ .
For each vertex v, if the edges connected to it are e₁, e₂, ..., e_k, we should make sure that there is no pair (i, j) where 1 ≤ i < j ≤ k and x_e₁ = x_e₂ = True. The naive approach is to add a clause $\text{[math]}$ for each pair. But it's not efficient.

The efficient way tho satisfy the second condition is to use prefix or: adding k new literals p₁, p₂, ..., p_k and for each j ≤ i, make sure $\text{[math]}$ . To make sure about this, we can add two clauses for each p_i: $\text{[math]}$ and $\text{[math]}$ (the second one is only for i > 1).

And the only thing left is to make sure $\text{[math]}$ (there are no two TRUE edges).

This way the number of literals and clauses are $\text{[math]}$ .

So, after binary search is over, we should run check(t) to get a sample matching.

Time complexity: $\text{[math]}$ (but slow, because of the constant factor)

587E - Королева Duff (Authors: PrinceOfPersia and Haghani)

Lemma #1: If numbers b₁, b₂, ..., b_k are k Kheshtaks of a₁, ..., a_n, then $\text{[math]}$ is a Kheshtak of a₁, ..., a_n.

Proof: For each 1 ≤ i ≤ k, consider mask_i is a binary bitmask of length n and its j - th bit shows a subsequence of a₁, ..., a_n (subset) with xor equal to b_i.

So, xor of elements subsequence(subset) of a₁, ..., a_n with bitmask equal to $\text{[math]}$ equals to $\text{[math]}$ . So, it's a Kheshtak of this sequence.

From this lemma, we can get another results: If all numbers b₁, b₂, ..., b_k are k Kheshtaks of a₁, ..., a_n, then every Kheshtak of b₁, b₂, ..., b_k is a Kheshtak of a₁, ..., a_n

Lemma #2: Score of sequence a₁, a₂, ..., a_n is equal to the score of sequence $\text{[math]}$ .

Proof: If we show the second sequence by b₁, b₂, ..., b_n, then for each 1 ≤ i ≤ n:

b_i = $\text{[math]}$
a_i = $\text{[math]}$

$\text{[math]}$ each element from sequence b is a Kheshtak of sequence a and vise versa. So, due to the result of Lemma #1, each Kheshtak of sequence b is a Kheshtak of sequence a and vise versa. So:

score(b₁, ..., b_n) ≤ score(a₁, ..., a_n)
score(a₁, ..., a_n) ≤ score(b₁, ..., b_n)

$\text{[math]}$ score(a₁, ..., a_n) = score(b₁, ..., b_n)

Back to original problem: denote another array b₂, ..., b_n where $\text{[math]}$ . Let's solve these two problems:

1- We have array a₁, ..., a_n and q queries of two types:

upd(l, r, k): Given numbers l, r and k, for each l ≤ i ≤ r, perform $\text{[math]}$
ask(i): Given number i, return the value of a_i.

This problem can be solved easily with a simple segment tree using lazy propagation.

2- We have array b₂, ..., b_n and queries of two types:

modify(p, k): Perform b_p = k.
basis(l, r): Find and return the basis vector of b_l, b_l + 1, ..., b_r (using Gaussian Elimination, its size it at most 32).

This problem can be solved by a segment tree where in each node we have the basis of the substring of that node (node [l, r) has the basis of sequence b_l, ..., b_r - 1).

This way we can insert to a basis vector v:

insert(x, v)
	for a in v
		if a & -a & x
			x ^= a
	if !x
		return
	for a in v
		if x & -x & a
			a ^= x
	v.push(x)

But size of v will always be less than or equal to 32. For merging two nodes (of segment tree), we can insert the elements of one in another one.

For handling queries of two types, we act like this:

Type one: Call functions: upd(l, r, k), $\text{[math]}$ and $\text{[math]}$ .

Type two: Let b = basis(l + 1, r). Call insert(a_l, b). And then print 2^b.size() as the answer.

Time complexity: $\text{[math]}$ = $\text{[math]}$

587F - Duff в ярости (Author: PrinceOfPersia)

Use Aho-Corasick. Assume first of all we build the trie of our strings (function t). If t(v, c) ≠ - 1 it means that there is an edge in the trie outgoing from vertex v written c on it.

So, for building Aho-Corasick, consider f(v) = the vertex we go into, in case of failure (t(v, c) = - 1). i.e the deepest vertex (u), that v ≠ u and the path from root to u is a suffix of path from root to v. No we can build an automaton (Aho-Corasick), function g. For each i, do this (in the automaton):

cur = root
for c in s[i]
	cur = g(cur, c)
	And then push i in q[cur] (q is a vector, also we do this for cur = root).

end[cur].push(i) 	// end is also a vector, consisting of the indices of strings ending in vertex cur (state cur in automaton)
last[i] = cur // last[i] is the final state we get to from searching string s[i] in automaton g

Assume cnt(v, i) is the number of occurrences of number i in q[v]. Also, denote $\text{[math]}$ .

Build another tree. In this tree, for each i that is not root of the trie, let par[i] = f(i) (the vertex we go in the trie, in case of failure) and call it C-Tree.

So now, problem is on a tree. Operations are : Each query gives numbers l, r, k and you have to find the number $\text{[math]}$ .

Act offline. If N = 10⁵, then:

1. For each i such that $\text{[math]}$ , collect queries (like struct) in a vector of queries query[i], then run dfs on the C-Tree and using a partial sum answer to all queries with k = i. There are at most $\text{[math]}$ of these numbers, so it can be done in $\text{[math]}$ . After doing these, erase i from all q[1], q[1], ..., q[N].

Code (in dfs) would be like this(on C-Tree):

partial_sum[n] = {}; // all 0
dfs(v, i){
	cnt = 0;
	for x in q[v]
		if(x == i)
		++ cnt;
	for u in childern[v]
		cnt += dfs(u);
	for x in end[v]
		partial_sum[x] += cnt;
	return cnt;
}
calc(i){
	dfs(root, i);
	for i = 2 to n
		partial_sum[i] += partial_sum[i-1]
	for query u in query[i]
		u.ans = partial_sum[u.r] - partial_sum[u.l - 1]
}

And we should just run calc(i) for each of them.

2. For each i such that $\text{[math]}$ , collect queries (like struct) in a vector of queries query[i]. (each element of this vector have three integers in it: l, r and ans).

Consider this problem:

We have an array a of length N(initially all element equal to 0) and some queries of two types:

increase(i, val): increase a[i] by val
sum(i): tell the value of a[1] + a[2] + ... + a[i]

We know that number of queries of the first type is $\text{[math]}$ and from the second type is $\text{[math]}$ . Using Sqrt decomposition, we can solve this problem in $\text{[math]}$ :

K = sqrt(N)
tot[K] = {}, a[N] = {} // this code is 0-based
increase(i, val)
	while i < N and i % K > 0
		a[i ++] += val
	while i < K
		tot[i/K] += val
		i += K
sum(i)
	return a[i] + tot[i/K]

Back to our problem now.

Then, just run dfs once on this C-Tree and act like this:

dfs(vertex v):
	for i in end[v]
		increase(i, 1)
	for i in q[v]
		for query u in query[i]
			u.ans += sum(u.r) - sum(u.l - 1)
	for u in children[v]
		dfs(u)
	for i in end[v]
		increase(i, -1)

Then answer to a query q is q.ans.

Time complexity: $\text{[math]}$