fix issue

Author: SansPapyrus683

solutions/platinum/apio-19-bridges.mdx

@@ -29,11 +29,15 @@ there are $\mathcal{O}(\sqrt N)$ updates or calculations. For each block:
     - To achieve this, we simply use DSU with path balancing only and keep a
       stack of previous DSU operations
 
-The complexity of this algorithm is thus $\mathcal{O}((Q + M) \sqrt Q)$. Some
-constant-factor optimization may be needed to get this to run in time though.
-
 ## Implementation
 
+**Time Complexity:** $\mathcal{O}((Q + M) \log N \sqrt Q )$
+
+However, it is possible to remove the log factor as mentioned in [this comment](https://codeforces.com/blog/entry/67129?#comment-514312).
+
+<LanguageSection>
+<CPPSection>
+
 ```cpp
 #include <bits/stdc++.h>
 #define FOR(i, x, y) for (int i = x; i < y; i++)
@@ -130,6 +134,8 @@ int main() {
 	}
 
 	FOR(i, 1, q + 1) if (t[i] == 2) cout << ans[i] << '\n';
-	return 0;
 }
 ```
+
+</CPPSection>
+</LanguageSection>