Submission #569392

# Submission time Handle Problem Language Result Execution time Memory
569392 2022-05-27T11:09:03 Z Akiti Road Closures (APIO21_roads) C++14
5 / 100
76 ms 5996 KB
#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);
    for (ll k = 0; k < m; k++)
    {
        sum-= d[k].c;
        t.push_back(sum);
    }
    return t;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 29 ms 3148 KB Output is correct
13 Correct 45 ms 5056 KB Output is correct
14 Correct 58 ms 4676 KB Output is correct
15 Correct 56 ms 5032 KB Output is correct
16 Correct 76 ms 5036 KB Output is correct
17 Correct 65 ms 5036 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 39 ms 4676 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 70 ms 5996 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 4812 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 4812 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 29 ms 3148 KB Output is correct
13 Correct 45 ms 5056 KB Output is correct
14 Correct 58 ms 4676 KB Output is correct
15 Correct 56 ms 5032 KB Output is correct
16 Correct 76 ms 5036 KB Output is correct
17 Correct 65 ms 5036 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 39 ms 4676 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 70 ms 5996 KB Output isn't correct
22 Halted 0 ms 0 KB -