I was trying to solve this problem using the palindromic tree. But I couldn't. Can someone help me?

Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

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

1 | tourist | 3880 |

2 | jiangly | 3669 |

3 | ecnerwala | 3654 |

4 | Benq | 3627 |

5 | orzdevinwang | 3612 |

6 | Geothermal | 3569 |

6 | cnnfls_csy | 3569 |

8 | jqdai0815 | 3532 |

9 | Radewoosh | 3522 |

10 | gyh20 | 3447 |

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

1 | awoo | 161 |

2 | maomao90 | 160 |

3 | adamant | 157 |

4 | maroonrk | 154 |

5 | -is-this-fft- | 148 |

5 | atcoder_official | 148 |

5 | SecondThread | 148 |

8 | Petr | 147 |

9 | TheScrasse | 145 |

10 | nor | 144 |

I was trying to solve this problem using the palindromic tree. But I couldn't. Can someone help me?

**maximum bipartite matching** using bfs? Here is the dfs implementation of **maximum bipartite matching** using Ford Fulkerson algorithm for maximum flow.

**EDIT**: I used set in place of array to store weight. So, there should not be any case of overflow.But still getting RE with code.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/21/2024 09:51:46 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|