제출 #569342

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569342		Edil	Road Closures (APIO21_roads)	C++17	0 / 100	2061 ms	13080 KiB

roads

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vct vector <int>
struct ed
{
    ll x = 0;
    set <ll> y;
};
bool cmp(ed a, ed b)
{
    if(a.x == b.x)
        return a.y > b.y;
    return a.x > b.x;
}
vector <ll> minimum_closure_costs(int n, vct u, vct v, vct w)
{
    n++;
    ll sm = 0;
    vector <ll> ans(n);
    vector <ed> tr(n);
    for(ll i = 0; i < (ll)w.size(); i++)
    {
        tr[u[i]].x++;
        tr[v[i]].x++;
        tr[u[i]].y.insert(w[i]);
        tr[v[i]].y.insert(w[i]);
        sm += w[i];
    }
    ans[0] = sm;
    sm = 0;
    sort(tr.begin(), tr.end(), cmp);
    for(ll k = n; k > 0; k--)
    {
        ll sm2 = sm;
        sm = 0;
        for(ll i = 0; tr[i].x > k; i++)
        {
            tr[i].x--;
            sm += *tr[i].y.begin();
            tr[i].y.erase(tr[i].y.begin());
        }
        ans[k] = sm + sm2;
    }
    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