# | User | Rating |
---|---|---|

1 | tourist | 3509 |

2 | OO0OOO00O0OOO0O0…O | 3327 |

3 | Syloviaely | 3274 |

4 | Um_nik | 3237 |

5 | Petr | 3161 |

6 | fjzzq2002 | 3137 |

7 | LHiC | 3135 |

8 | Benq | 3130 |

9 | ko_osaga | 3115 |

10 | Swistakk | 3089 |

# | User | Contrib. |
---|---|---|

1 | Radewoosh | 185 |

2 | rng_58 | 161 |

3 | tourist | 158 |

4 | Petr | 152 |

5 | Swistakk | 150 |

5 | Vovuh | 150 |

7 | Um_nik | 149 |

8 | PikMike | 147 |

9 | csacademy | 146 |

10 | Errichto | 145 |

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/25/2018 22:59:20 (f1).

Desktop version, switch to mobile version.

User lists

Name |
---|

I think I've seen the matrix restoration and array restoration problem somewhere before.

How to solve Chef Restores an Array?

Here is the problem link

Two adjacent numbers are either related by a +/-1 or not related at all. If they are related by both, ans is 0. To find the relations in linear time, we can use 2 prefix DPs, one for 'I' relations and the other for 'D' relations.

From numbers you already know, you can traverse using known relations(edges) to get unknown numbers and at same time verify other known numbers. We need to make sure that these numbers are in the range [1,

k]. For numbers that are still unknown, they will form a forest of chains. In each of these chains, we need to see the difference between the largest and smallest.Editorials please

chemthan(or anybody else) can you explain the approach for the maximum path on tree question???

Firstly we ignore

gcd(u,v), just find the maximum ofdist(u,v)·min(u,v). Iterating vertices in decreasing order by values written on them and maintain DSU structure. Each time we connect an edge (u,v), we're only interested in paths pass through that edge. We will maintain diameter of each component. If (x,y) is diameter ofu's component, (z,t) is diameter ofv's component then the longest path passes through (u,v) is among (x,z), (x,t), (y,z), (y,t). Complexity isO(LCA(N) +DSU(N)).Now, finding the maximum of

dist(u,v)·min(u,v)·gcd(u,v): For eachd, we consider only vertices that values written on them are multiplier ofdand apply above approche for each group. The sum of all groups is at mostN*max_number_of_divisor_of(a[i]) ~ 6e6. We can optimize LCA part by using LCA O(1) per query, so total complexity will beO(DSU(N*max_number_of_divisor_of(a[i])).how do you solve |S|*AND(S) problem

fix the AND, iterate over supermasks, find largest connected component with dsu.

there are ~2^20 possible values for the AND right? How would you use DSU to find the largest connected component for each value of AND?

say we want to make the and equal to x, add the vertices that are supermasks of x one by one. After adding one we check if its parent is also supermask of x, if that is the case we merge them with dsu. Complexity: 3^17