BACREP - Editorial

[ssjgz]

CNNCT2 - Editorial

PROBLEM LINK: Div 1 Div 2 Practice Author: Alexey Zayakin Tester: Hanlin Ren Editorialist: Hanlin Ren DIFFICULTY: HARD PREREQUISITES: Matroid Intersection PROBLEM: Given integers N,M and two undirected graphs with N nodes and M edges, find the smallest subset of \{1,2,\dots,M\} such that, if we only consider edges whose index is in this subset, then both graphs are connected. QUICK EXPLANATION: For every graph G, the set of edges E'\subseteq E such that G-E' is connected forms a ma…