Practice · 5 of 6

Clinic: The One-Way Mirage

CHALLENGE

Difficulty: advanced+25 XP

**Bài toán.** Undirected graph, n ≤ 100000, m ≤ 200000; count connected components. **The submission below adds each road in ONE direction — Wrong Answer.** Craft the smallest counterexample, name the class, fix it. ``cpp g[u].push_back(v); // only this``

Press Submit to check your solution.

Back to lesson: Practice: Clinic Set 1 — Six Classic Bugs