union-find1 [BOJ] 13905 - 세부 (C++, Kruskal,BFS) https://www.acmicpc.net/problem/13905#include #include #include #include #include using namespace std;#define INF 99999999struct item{ int a,b,cost;};struct node{ int e, cost;};int n,m;int s,e;int parent[100001];item lst[300001];vector v[100001];int visited[100001];bool compare(item a, item b){ return a.cost > b.cost;}//path compression 미적용int find(int a){ if(parent[a] == a) return a.. 2024. 12. 7. 이전 1 다음
