코드#include #include #include #include using namespace std;int n, m, known, kc[53], tmp, cnt, hum, res, lst[53], visited[53];vector> pe;// U-F? dfs?int find(int x) { if (x == lst[x]) return x; return lst[x] = find(lst[x]);}void merge(int x, int y) { x = find(x); y = find(y); if (x > y) lst[x] = y; else lst[y] = x;}int main() { cin >> n >> m; cin >> known; for (int i = 0; i > tmp; lst[tmp] = 0; }..
