Submission #569361

#	Time	Username	Problem	Language	Result	Execution time	Memory
569361		Akiti	Road Closures (APIO21_roads)	C++14	0 / 100	42 ms	4764 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);
    t.push_back(sum);
    m--;
    for (ll k = 0; k < d.size(); k++)
    {
        sum-= d[k].c;
        t.push_back(sum);
    }
    reverse(t.begin(), t.end());
    return t;
}

Compilation message (stderr)

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:28:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (ll k = 0; k < d.size(); k++)
      |                    ~~^~~~~~~~~~

• 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