I am intrested in solution if n <= 1e5 and m <= 1e5n — 1 <= m <= max((n-1) * n / 2 , 1e5) and k <= 1000. Is it exist or NP-hard? Thanks↵
↵
↵
https://mirror.codeforces.com/contest/1433/problem/G
↵
↵
https://mirror.codeforces.com/contest/1433/problem/G