#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W){
long long k = 0;
vector<long long> a(N,0);
sort(W.begin(),W.end(),greater<int>());
for (int i = N - 1; i >= 0; i--) {
a[i] = k;
if (i > 0){
k += W[i - 1];
}
}
return a;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
432 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
448 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
18 ms |
2908 KB |
Output is correct |
13 |
Correct |
39 ms |
4372 KB |
Output is correct |
14 |
Correct |
34 ms |
4932 KB |
Output is correct |
15 |
Correct |
38 ms |
5296 KB |
Output is correct |
16 |
Correct |
55 ms |
5564 KB |
Output is correct |
17 |
Correct |
40 ms |
5684 KB |
Output is correct |
18 |
Correct |
1 ms |
544 KB |
Output is correct |
19 |
Correct |
26 ms |
3920 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
35 ms |
4996 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
4772 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
4772 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
432 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
448 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
18 ms |
2908 KB |
Output is correct |
13 |
Correct |
39 ms |
4372 KB |
Output is correct |
14 |
Correct |
34 ms |
4932 KB |
Output is correct |
15 |
Correct |
38 ms |
5296 KB |
Output is correct |
16 |
Correct |
55 ms |
5564 KB |
Output is correct |
17 |
Correct |
40 ms |
5684 KB |
Output is correct |
18 |
Correct |
1 ms |
544 KB |
Output is correct |
19 |
Correct |
26 ms |
3920 KB |
Output is correct |
20 |
Correct |
1 ms |
344 KB |
Output is correct |
21 |
Incorrect |
35 ms |
4996 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |