Submission #951540

#	Time	Username	Problem	Language	Result	Execution time	Memory
951540		qwe1rt1yuiop1	Reconstruction Project (JOI22_reconstruction)	C++17	7 / 100	5069 ms	5208 KiB

reconstruction

#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;


vector<int> dsu, sz;
int f(int x) { return x == dsu[x] ? x : dsu[x] = f(dsu[x]); }
void un(int a, int b)
{
    a = f(a), b = f(b);
    if (a == b)
        return;
    if (sz[a] < sz[b])
        swap(a, b);
    dsu[b] = a, sz[a] += sz[b];
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<array<int, 3>> e0(m);
    for (auto &i : e0)
        cin >> i[1] >> i[2] >> i[0], --i[1], --i[2];
    
    int q;
    cin >> q;
    while (q--)
    {
        int x;
        cin >> x;
        auto e = e0;
        for (auto &[w, a, b] : e)
            w = abs(w - x);
        sort(all(e));
        sz.assign(n, 1), dsu = sz;
        for (int i = 0; i < n; ++i)
            dsu[i] = i;
        int ans = 0;
        for (auto [w, a, b] : e)
            if (f(a) != f(b))
            {
                un(a, b);
                ans += w;
            }
        cout << ans << '\n';
    }
}

/*
5 10
1 2 8
1 3 13
1 4 5
1 5 11
1 5 3
2 3 7
2 4 15
3 4 6
3 5 6
4 5 2
6
3
6
8
10
13
17
*/

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23