Submission #963945

#	Time	Username	Problem	Language	Result	Execution time	Memory
963945		GrindMachine	Reconstruction Project (JOI22_reconstruction)	C++17	0 / 100	5103 ms	766104 KiB

reconstruction

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
some solutions

*/

const int MOD = 1e9 + 7;
const int N = 500 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pll> adj[N];
vector<ll> active;
ll mn_on_path;

void dfs1(ll u, ll p, ll des, ll mn){
    if(u == des){
        mn_on_path = mn;
    }

    for(auto [v,id] : adj[u]){
        if(v == p) conts;
        dfs1(v,u,des,min(mn,id));
    }
} 

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,3>> edges(m+5);
    rep1(i,m){
        ll u,v,w; cin >> u >> v >> w;
        edges[i] = {w,u,v};
    }

    sort(edges.begin()+1,edges.begin()+m+1);

    vector<vector<ll>> possible;

    rep1(i,m){
        mn_on_path = inf2;
        auto [w,u,v] = edges[i];
        dfs1(u,-1,v,inf2);
        if(mn_on_path != inf2){
            auto [w,x,y] = edges[mn_on_path];
            active.erase(find(all(active),mn_on_path));
            pll px = {x,mn_on_path}, py = {y,mn_on_path};
            adj[x].erase(find(all(adj[x]),py));
            adj[y].erase(find(all(adj[y]),px));
        }

        active.pb(i);
        adj[u].pb({v,i}), adj[v].pb({u,i});

        if(sz(active) == n-1){
            possible.pb(active);
        }
    }

    rep1(i,n){
        adj[i].clear();
    }

    active.clear();

    rev(i,m,1){
        mn_on_path = inf2;
        auto [w,u,v] = edges[i];
        dfs1(u,-1,v,inf2);
        if(mn_on_path != inf2){
            mn_on_path = -mn_on_path;
            auto [w,x,y] = edges[mn_on_path];
            active.erase(find(all(active),mn_on_path));
            pll px = {x,-mn_on_path}, py = {y,-mn_on_path};
            adj[x].erase(find(all(adj[x]),py));
            adj[y].erase(find(all(adj[y]),px));
        }

        active.pb(i);
        adj[u].pb({v,-i}), adj[v].pb({u,-i});

        if(sz(active) == n-1){
            possible.pb(active);
        }
    }

    ll q; cin >> q;

    while(q--){
        ll x; cin >> x;
        ll ans = inf2;
        trav(v,possible){
            ll cost = 0;
            trav(id,v){
                cost += abs(edges[id][0]-x);
            }

            amin(ans,cost);
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    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