This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma gcc-optimize("o3, unroll-loops")
const int nx=5e2+5, mx=1e5+5;
ll n, m, a[mx], b[mx], w[mx], dsu[nx], x, q;
int find(int x)
{
if (dsu[x]==x) return x;
return dsu[x]=find(dsu[x]);
}
int32_t main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=m; i++) cin>>a[i]>>b[i]>>w[i];
cin>>q;
while (q--)
{
cin>>x;
vector<pair<ll, ll>> edg;
for (int i=1; i<=n; i++) dsu[i]=i;
for (int i=1; i<=m; i++) edg.push_back({abs(w[i]-x), i});
sort(edg.begin(), edg.end());
ll res=0, cnt=0;
for (auto [k, idx]:edg)
{
if (find(a[idx])==find(b[idx])) continue;
res+=k;
cnt++;
dsu[find(a[idx])]=find(b[idx]);
if (cnt==n-1) break;
}
cout<<res<<'\n';
}
}
Compilation message (stderr)
reconstruction.cpp:6: warning: ignoring '#pragma gcc ' [-Wunknown-pragmas]
6 | #pragma gcc-optimize("o3, unroll-loops")
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |