Submission #742685

#	Time	Username	Problem	Language	Result	Execution time	Memory
742685		Jarif_Rahman	Road Closures (APIO21_roads)	C++17	0 / 100	50 ms	6416 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int n, k;

vector<ll> minimum_closure_costs(int _n, vector<int> U, vector<int> V, vector<int> W){
    swap(n, _n);
    vector<int> inital_deg(n, 0);

    for(int i = 0; i < n-1; i++) inital_deg[U[i]]++, inital_deg[V[i]]++;

    vector<int> o(n);
    vector<pair<int, int>> edges;
    for(int i = 0; i < n; i++) o[i] = i;
    for(int i = 0; i < n-1; i++) edges.pb({U[i], V[i]});

    sort(o.begin(), o.end(), [&](int a, int b){
        return inital_deg[a] > inital_deg[b];
    });
    sort(edges.begin(), edges.end(), [&](pair<int, int> a, pair<int, int> b){
        return min(inital_deg[a.f], inital_deg[a.sc]) > min(inital_deg[b.f], inital_deg[b.sc]);
    });

    vector<int> deg(n, 0);
    vector<ll> ans(n, 0);

    for(k = n-1; k >= 0; k--){
        int cur = 0, ex = 0;
        for(int i = 0; i < n; i++){
            if(inital_deg[o[i]] <= k) break;
            deg[o[i]] = inital_deg[o[i]];
            ex+=inital_deg[o[i]]-k;
        }
        for(int i = 0; i < n-1; i++){
            auto [a, b] = edges[i];
            if(min(inital_deg[a], inital_deg[b]) <= k) break;
            if(min(deg[a], deg[b]) > k) ex-=2, cur++, deg[a]--, deg[b]--;
        }
        cur+=ex;
        ans[k] = cur;
    }

    return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22