#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> st2(int N, vector<int> U, vector<int> V, vector<int> W)
{
long long take = W[0], skip = 0, total = W[0];
for (int i = 1; i < N - 1; i++)
{
long long new_take = min(take, skip) + W[i];
long long new_skip = take;
long long new_total = total + W[i];
take = new_take, skip = new_skip, total = new_total;
}
vector<long long> answer(N);
answer[0] = total;
answer[1] = min(take, skip);
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;
};
auto c2 = [&]()
{
for (int i = 0; i < N - 1; i++)
if (U[i] != i || V[i] != i + 1)
return false;
return true;
};
if (c1())
return st1(N, U, V, W);
if (c2())
return st2(N, U, V, W);
return vector<long long>(N);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
280 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
276 KB |
Output is correct |
12 |
Correct |
21 ms |
3148 KB |
Output is correct |
13 |
Correct |
35 ms |
4940 KB |
Output is correct |
14 |
Correct |
43 ms |
4404 KB |
Output is correct |
15 |
Correct |
45 ms |
4804 KB |
Output is correct |
16 |
Correct |
45 ms |
4932 KB |
Output is correct |
17 |
Correct |
46 ms |
4940 KB |
Output is correct |
18 |
Correct |
0 ms |
276 KB |
Output is correct |
19 |
Correct |
30 ms |
4544 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
31 ms |
4212 KB |
Output is correct |
3 |
Correct |
35 ms |
6240 KB |
Output is correct |
4 |
Correct |
38 ms |
6696 KB |
Output is correct |
5 |
Correct |
38 ms |
6808 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
296 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
0 ms |
208 KB |
Output is correct |
10 |
Correct |
1 ms |
280 KB |
Output is correct |
11 |
Correct |
1 ms |
208 KB |
Output is correct |
12 |
Correct |
19 ms |
3596 KB |
Output is correct |
13 |
Correct |
32 ms |
5880 KB |
Output is correct |
14 |
Correct |
0 ms |
208 KB |
Output is correct |
15 |
Correct |
32 ms |
5276 KB |
Output is correct |
16 |
Correct |
32 ms |
5832 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
32 ms |
3604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
32 ms |
3604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
280 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
276 KB |
Output is correct |
12 |
Correct |
21 ms |
3148 KB |
Output is correct |
13 |
Correct |
35 ms |
4940 KB |
Output is correct |
14 |
Correct |
43 ms |
4404 KB |
Output is correct |
15 |
Correct |
45 ms |
4804 KB |
Output is correct |
16 |
Correct |
45 ms |
4932 KB |
Output is correct |
17 |
Correct |
46 ms |
4940 KB |
Output is correct |
18 |
Correct |
0 ms |
276 KB |
Output is correct |
19 |
Correct |
30 ms |
4544 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
31 ms |
4212 KB |
Output is correct |
22 |
Correct |
35 ms |
6240 KB |
Output is correct |
23 |
Correct |
38 ms |
6696 KB |
Output is correct |
24 |
Correct |
38 ms |
6808 KB |
Output is correct |
25 |
Correct |
1 ms |
336 KB |
Output is correct |
26 |
Correct |
1 ms |
296 KB |
Output is correct |
27 |
Correct |
1 ms |
300 KB |
Output is correct |
28 |
Correct |
0 ms |
208 KB |
Output is correct |
29 |
Correct |
1 ms |
280 KB |
Output is correct |
30 |
Correct |
1 ms |
208 KB |
Output is correct |
31 |
Correct |
19 ms |
3596 KB |
Output is correct |
32 |
Correct |
32 ms |
5880 KB |
Output is correct |
33 |
Correct |
0 ms |
208 KB |
Output is correct |
34 |
Correct |
32 ms |
5276 KB |
Output is correct |
35 |
Correct |
32 ms |
5832 KB |
Output is correct |
36 |
Correct |
0 ms |
204 KB |
Output is correct |
37 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
38 |
Halted |
0 ms |
0 KB |
- |