#include "roads.h"
#include <algorithm>
#include <vector>
using namespace std;
vector<long long> st1(int N, vector<int> U, vector<int> V, vector<int> W)
{
vector<long long> answer(N);
sort(W.rbegin(), W.rend());
for (int i = N - 1; i >= 1; --i)
answer[i - 1] = answer[i] + W[i - 1];
return answer;
}
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W)
{
auto c1 = [&]()
{
for (int i = 0; i < N - 1; i++)
if (U[i] != 0)
return false;
return true;
};
if (c1())
return st1(N, U, V, W);
return vector<long long>(N);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
2 ms |
336 KB |
Output is correct |
3 |
Correct |
2 ms |
336 KB |
Output is correct |
4 |
Correct |
2 ms |
336 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
2 ms |
328 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
11 |
Correct |
1 ms |
208 KB |
Output is correct |
12 |
Correct |
24 ms |
3412 KB |
Output is correct |
13 |
Correct |
58 ms |
5448 KB |
Output is correct |
14 |
Correct |
53 ms |
5564 KB |
Output is correct |
15 |
Correct |
60 ms |
6156 KB |
Output is correct |
16 |
Correct |
64 ms |
6336 KB |
Output is correct |
17 |
Correct |
54 ms |
6376 KB |
Output is correct |
18 |
Correct |
1 ms |
208 KB |
Output is correct |
19 |
Correct |
40 ms |
5036 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
288 KB |
Output is correct |
2 |
Incorrect |
37 ms |
4560 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
284 KB |
Output is correct |
2 |
Incorrect |
1 ms |
280 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
284 KB |
Output is correct |
2 |
Incorrect |
1 ms |
280 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
40 ms |
4604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
40 ms |
4604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
2 ms |
336 KB |
Output is correct |
3 |
Correct |
2 ms |
336 KB |
Output is correct |
4 |
Correct |
2 ms |
336 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
2 ms |
328 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
11 |
Correct |
1 ms |
208 KB |
Output is correct |
12 |
Correct |
24 ms |
3412 KB |
Output is correct |
13 |
Correct |
58 ms |
5448 KB |
Output is correct |
14 |
Correct |
53 ms |
5564 KB |
Output is correct |
15 |
Correct |
60 ms |
6156 KB |
Output is correct |
16 |
Correct |
64 ms |
6336 KB |
Output is correct |
17 |
Correct |
54 ms |
6376 KB |
Output is correct |
18 |
Correct |
1 ms |
208 KB |
Output is correct |
19 |
Correct |
40 ms |
5036 KB |
Output is correct |
20 |
Correct |
1 ms |
288 KB |
Output is correct |
21 |
Incorrect |
37 ms |
4560 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |