제출 #569349

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

roads

#include<bits/stdc++.h>
using namespace std;
using ll =long long;
struct edge
{
  int a, b, c;  
};
bool compaire(edge g, edge h)
{
    return g.c > h.c;
}
vector <ll> minimum_closure_costs(int n, vector <int> u, vector <int> v, vector <int> w)
{
    ll sum = 0;
    ll m = u.size();
    vector <edge> d(m);
    vector <ll> t;
    for (ll i = 0; i < m; i++)
    {
        sum+= w[i];
        d[i].a = u[i];
        d[i].b = v[i];
        d[i].c = w[i];
    }
    sort(d.begin(), d.end(), compaire);
    for (ll k = 0; k <= m; k++)
    {
        ll sum2 = sum;
        for (ll i = 0, s = k; s > 0; i++, s--)
            sum2-= d[i].c;
        t.push_back(sum2);
    }
    return t;
}

• 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