I have a problem: given a tree on N vertices, I need to answer requests with 2 types: 1)Delete I-th edge if it's in the graph (or vice versa). 2)Find a maximum matching in a component including vertex X. I have a solution: dfs with DP on tree to count maximum matching on each request, but N and Q <= 1e5 and I've TL. How I can improve this?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Jack_Daniels_ | 2024-12-07 20:34:04 | 153 | Tiny change: '2 types:\n1)Delete' -> '2 types:\n\n1)Delete' | |
| en1 |
|
Jack_Daniels_ | 2024-12-07 19:15:58 | 373 | Initial revision for English translation | |
| ru1 |
|
Jack_Daniels_ | 2024-12-07 18:16:50 | 373 | Первая редакция (опубликовано) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 22:29:21 (k1).
Desktop version, switch to mobile version.
Supported by
