#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 5, Ns4 = 2005;
int n;
long long ans[N];
long long dpx[N], val[N];
int sz[Ns4];
long long dp[Ns4][Ns4], dd[Ns4][2];
vector<pii> S[N];
void sub1() {
sort(S[0].begin(), S[0].end());
REP(i, 0, n - 1) ans[n - i - 2] = ans[n - i - 1] + S[0][i].first;
}
void sub2() {
REP(i, 0, n - 1) {
for(auto [c, v] : S[i]) if (i + 1 == v)
val[i + 1] = c;
}
REP(i, 1, n) ans[0] += val[i];
REP(i, 2, n) {
dpx[i] = min(dpx[i - 1] + val[i], dpx[i - 2] + val[i - 1]);
}
ans[1] = dpx[n - 1];
}
void DFS(int u, int p, int max_sz) {
fill(dp[u] + 1, dp[u] + sz[u] + 1, 1e15);
dp[u][0] = 0;
int now_sz = min(sz[u], max_sz);
for(auto [c, v] : S[u]) if (v != p) {
DFS(v, u, max_sz);
FORD(i, now_sz, 1) {
dp[u][i] = min(dp[u][i] + dd[v][1] + c, dp[u][i - 1] + dd[v][0]);
}
dp[u][0] += dd[v][1] + c;
}
if (now_sz < max_sz) ++now_sz;
if (now_sz) dd[u][0] = dp[u][now_sz - 1]; else dd[u][0] = 1e15;
dd[u][1] = dp[u][now_sz];
}
void sub34() {
REP(i, 0, n) {
sz[i] = S[i].size() - 1;
if (i == 0) ++sz[i];
}
REP(i, 0, n) {
DFS(0, 0, i);
ans[i] = min(dd[0][1], dd[0][0]);
}
}
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
n = N;
REP(i, 0, n - 1) {
S[U[i]].emplace_back(W[i], V[i]);
S[V[i]].emplace_back(W[i], U[i]);
}
if (S[0].size() == n - 1) sub1();
else sub2();
//else if (n <= 2000) sub34();
vector<long long> ret(n);
REP(i, 0, n) ret[i] = ans[i];
return ret;
}
Compilation message
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:66:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
66 | if (S[0].size() == n - 1) sub1();
| ~~~~~~~~~~~~^~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
3 ms |
2772 KB |
Output is correct |
3 |
Correct |
3 ms |
2820 KB |
Output is correct |
4 |
Correct |
3 ms |
2772 KB |
Output is correct |
5 |
Correct |
2 ms |
2668 KB |
Output is correct |
6 |
Correct |
3 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
3 ms |
2704 KB |
Output is correct |
9 |
Correct |
3 ms |
2772 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2660 KB |
Output is correct |
12 |
Correct |
35 ms |
7964 KB |
Output is correct |
13 |
Correct |
58 ms |
11496 KB |
Output is correct |
14 |
Correct |
54 ms |
11404 KB |
Output is correct |
15 |
Correct |
60 ms |
12340 KB |
Output is correct |
16 |
Correct |
71 ms |
12524 KB |
Output is correct |
17 |
Correct |
69 ms |
12584 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
50 ms |
10720 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
41 ms |
10924 KB |
Output is correct |
3 |
Correct |
46 ms |
11980 KB |
Output is correct |
4 |
Correct |
52 ms |
12520 KB |
Output is correct |
5 |
Correct |
48 ms |
12624 KB |
Output is correct |
6 |
Correct |
3 ms |
2836 KB |
Output is correct |
7 |
Correct |
3 ms |
2772 KB |
Output is correct |
8 |
Correct |
3 ms |
2772 KB |
Output is correct |
9 |
Correct |
2 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2660 KB |
Output is correct |
11 |
Correct |
2 ms |
2660 KB |
Output is correct |
12 |
Correct |
27 ms |
8152 KB |
Output is correct |
13 |
Correct |
43 ms |
11748 KB |
Output is correct |
14 |
Correct |
2 ms |
2664 KB |
Output is correct |
15 |
Correct |
40 ms |
10828 KB |
Output is correct |
16 |
Correct |
43 ms |
11756 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
71 ms |
11212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
71 ms |
11212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
3 ms |
2772 KB |
Output is correct |
3 |
Correct |
3 ms |
2820 KB |
Output is correct |
4 |
Correct |
3 ms |
2772 KB |
Output is correct |
5 |
Correct |
2 ms |
2668 KB |
Output is correct |
6 |
Correct |
3 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
3 ms |
2704 KB |
Output is correct |
9 |
Correct |
3 ms |
2772 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2660 KB |
Output is correct |
12 |
Correct |
35 ms |
7964 KB |
Output is correct |
13 |
Correct |
58 ms |
11496 KB |
Output is correct |
14 |
Correct |
54 ms |
11404 KB |
Output is correct |
15 |
Correct |
60 ms |
12340 KB |
Output is correct |
16 |
Correct |
71 ms |
12524 KB |
Output is correct |
17 |
Correct |
69 ms |
12584 KB |
Output is correct |
18 |
Correct |
2 ms |
2644 KB |
Output is correct |
19 |
Correct |
50 ms |
10720 KB |
Output is correct |
20 |
Correct |
2 ms |
2644 KB |
Output is correct |
21 |
Correct |
41 ms |
10924 KB |
Output is correct |
22 |
Correct |
46 ms |
11980 KB |
Output is correct |
23 |
Correct |
52 ms |
12520 KB |
Output is correct |
24 |
Correct |
48 ms |
12624 KB |
Output is correct |
25 |
Correct |
3 ms |
2836 KB |
Output is correct |
26 |
Correct |
3 ms |
2772 KB |
Output is correct |
27 |
Correct |
3 ms |
2772 KB |
Output is correct |
28 |
Correct |
2 ms |
2644 KB |
Output is correct |
29 |
Correct |
2 ms |
2660 KB |
Output is correct |
30 |
Correct |
2 ms |
2660 KB |
Output is correct |
31 |
Correct |
27 ms |
8152 KB |
Output is correct |
32 |
Correct |
43 ms |
11748 KB |
Output is correct |
33 |
Correct |
2 ms |
2664 KB |
Output is correct |
34 |
Correct |
40 ms |
10828 KB |
Output is correct |
35 |
Correct |
43 ms |
11756 KB |
Output is correct |
36 |
Correct |
2 ms |
2644 KB |
Output is correct |
37 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
38 |
Halted |
0 ms |
0 KB |
- |