I didn't understand what paint(v) means. Can someone please explain me. Also I didn't understand the editorial solution of this problem. Can't we just count unconnected black ans white components and output min of them Problem link Thanks in advance!
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
40:50:10
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
40:50:10
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Can anyone solve this question? It came in intuit OA and I was not able to solve it (my solution gave tle). (https://leetcode.com/discuss/interview-question?currentPage=1&orderBy=hot&query=)
Hello Guys! I'm having a hard time solving problem D of typedb forces 2023 (https://mirror.codeforces.com/contest/1787/problem/D). I didn't understand the editorial too. Pls help me with this problem. Also suggest me some problems on graphs (not dfs or bfs kind) like on topo sort, undirected graph ,DSUs ,MST ,cycles etc. Thanks Guys in advance.
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 00:44:50 (h1).
Desktop version, switch to mobile version.
Supported by
