제출 #1271515

#제출 시각아이디문제언어결과실행 시간메모리
1271515rayan_bdCities (BOI16_cities)C++20
0 / 100
80 ms11752 KiB
#include <bits/stdc++.h> using namespace std; const int mxN = 1e5 + 100; vector<pair<int, int>> adj[mxN]; int par[mxN], mark[mxN]; int find(int u){ if(u == par[u]) return u; return par[u] = find(par[u]); } int unite(int u, int v){ u = find(u), v = find(v); if(u ^ v) return par[u] = v; return 0; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, m, e, u, v, w, cost = 0; cin >> n >> m >> e; for(int i = 1; i <= m; ++i){ cin >> u; mark[u] = 1; } for(int i = 1; i <= n; ++i) par[i] = i; vector<vector<int>> edge; for(int i = 1; i <= e; ++i){ cin >> u >> v >> w; edge.push_back({w, u, v}); } sort(edge.begin(), edge.end()); for(auto it : edge){ if(unite(it[1], it[2])) cost += it[0]; } cout << cost << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...