Submission #1186880

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186880		SalihSahin	Reconstruction Project (JOI22_reconstruction)	C++20	0 / 100	0 ms	328 KiB

reconstruction

#include "bits/stdc++.h"
#define pb push_back
#define int long long
using namespace std;

const int N = 5e2 + 5;

vector<int> par(N);

int fnd(int a){
    if(a == par[a]) return a;
    return par[a] = fnd(par[a]);
}

bool merge(int a, int b){
    a = fnd(a);
    b = fnd(b);
    if(a == b) return false;
    par[b] = a;
    return true;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int n, m;
    cin>>n>>m;
    vector<array<int, 3> > edges(m); // w, u, v
    for(int i = 0; i < m; i++){
        cin>>edges[i][1]>>edges[i][2]>>edges[i][0]; 
    }
    sort(edges.begin(), edges.end());

    int q;
    cin>>q;
    while(q--){
        int x;
        cin>>x;

        int ans = 0;

        for(int i = 1; i <= n; i++){
            par[i] = i;
        }

        int l = 0, r = m-1;
        while(l < r){
            int mid = (l + r + 1)/2;

            if(edges[mid][0] <= x) l = mid;
            else r = mid - 1;
        }
        
        vector<array<int, 3> > nedges = edges;
        for(int i = 0; i <= l; i++){
            nedges[i][0] = x - nedges[i][0];
        }
        for(int i = l+1; i < m; i++){
            nedges[i][0] = nedges[i][0] - x;
        }
        
        sort(nedges.begin(), nedges.end());
        for(int i = 0; i < m; i++){
            if(merge(nedges[i][1], nedges[i][2])){
                ans += nedges[i][0];
            }
        }

        cout<<ans<<"\n";
    }
    return 0;
}

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