Codeforces 732F Tourist Reform - Problem Statement

You have an undirected connected graph with $n$ vertices and $m$ edges. Orient all edges to make a directed graph. Maximize the minimum number of vertices reachable from any vertex.

Constraints: $n, m \le 4 \times 10^5$. You need to understand how bridges affect connectivity after orientation.