Can someone provide some insight on how to approach this problem ?

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

1 | tourist | 3707 |

2 | Benq | 3672 |

3 | Radewoosh | 3627 |

4 | ksun48 | 3547 |

5 | Miracle03 | 3480 |

6 | ecnerwala | 3400 |

7 | peehs_moorhsum | 3384 |

8 | maroonrk | 3361 |

9 | sunset | 3338 |

10 | Um_nik | 3320 |

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

1 | 1-gon | 209 |

2 | Um_nik | 196 |

3 | YouKn0wWho | 192 |

4 | Errichto | 182 |

5 | awoo | 181 |

6 | sus | 180 |

7 | tourist | 175 |

8 | -is-this-fft- | 171 |

9 | SecondThread | 170 |

9 | Radewoosh | 170 |

Can someone provide some insight on how to approach this problem ?

*You are given two strings a and b. Find shortest string which being repeated infinitely contains the both strings. I.e. find such shortest s that infinite string ss... s... contains a and contains b as a substring*.

- $$$1 \le Number of Test Cases \le 100$$$
- $$$1 \le len(a) \le 10000$$$
- $$$1 \le len(b) \le 10000$$$

This problem is not from an ongoing contest. Those who have access to the group (Brazil ICPC Summer School 2018) can view it here!

**Note** : By tree I mean a weighted tree where each node has a weight.

Is there anyway to build the Cartesian Tree of a Tree efficiently (less than $$$O(n^2)$$$) ?

By Cartesian tree of a tree I mean the following:

Find the node with minimum weight in the Tree. Make it the root.

Recursively do this for each of the subtrees formed and attach their roots to the Earlier root.

I chose to call it Cartesian Tree because it is very similar to this.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/21/2021 11:13:27 (k2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|