#include "roads.h"
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxN = 2000;
int N;
vector<int> edge[maxN];
vector<long long> wt[maxN];
vector<int> P(maxN, -1);
vector<long long> P_wt(maxN, 0);
void dfs(int u)
{
for(int e = 0; e < edge[u].size(); e++)
{
int v = edge[u][e];
long long w = wt[u][e];
if(P[u] == v) continue;
P[v] = u;
P_wt[v] = w;
dfs(v);
}
}
int K;
long long dp1[maxN];
long long dp2[maxN];
void dfs2(int u)
{
// cerr << "\n";
// cerr << "dfs2 " << u << '\n';
dp1[u] = 0;
dp2[u] = 0;
vector<long long> adj;
if(edge[u].size() == 1 && u != 0)
{
dp1[u] = dp2[u] = 0;
return;
}
for(int v: edge[u])
{
if(P[u] == v) continue;
dfs2(v);
dp1[u] += dp2[v];
dp2[u] += dp2[v];
adj.push_back(P_wt[v] + dp1[v] - dp2[v]);
}
sort(adj.begin(), adj.end());
// cerr << "u = " << u << '\n';
// cerr << "adj = ";
// for(long long a: adj) cerr << a << ' ';
// cerr << '\n';
int x1 = max(int(adj.size() - K), 0);
// cerr << "dp1 " << u << " = " << dp1[u] << ", dp2 " << u << " = " << dp2[u] << '\n';
for(int i = 0; i < x1; i++)
dp1[u] += adj[i];
for(int i = x1; i < adj.size(); i++)
dp1[u] += min(0LL, adj[i]);
int x2 = max(int(adj.size() - (K-1)), 0);
for(int i = 0; i < x2; i++)
dp2[u] += adj[i];
for(int i = x2; i < adj.size(); i++)
dp2[u] += min(0LL, adj[i]);
// cerr << "dp1 " << u << " = " << dp1[u] << ", dp2 " << u << " = " << dp2[u] << '\n';
}
vector<long long> minimum_closure_costs(int n1, vector<int> u1, vector<int> v1, vector<int> c1)
{
long long total_weight = 0;
N = n1;
for(int j = 0; j < N-1; j++)
{
edge[ u1[j] ].push_back( v1[j] );
wt[ u1[j] ].push_back( c1[j] );
edge[ v1[j] ].push_back( u1[j] );
wt[ v1[j] ].push_back( c1[j] );
total_weight += c1[j];
}
dfs(0);
vector<long long> res(N);
res[0] = total_weight;
for(K = 1; K <= N-1; K++)
{
// cerr << "\n\n\n\n";
// cerr << "K = " << K << '\n';
dfs2(0);
res[K] = min(dp1[0], dp2[0]);
}
return res;
}
Compilation message
roads.cpp: In function 'void dfs(int)':
roads.cpp:18:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
18 | for(int e = 0; e < edge[u].size(); e++)
| ~~^~~~~~~~~~~~~~~~
roads.cpp: In function 'void dfs2(int)':
roads.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for(int i = x1; i < adj.size(); i++)
| ~~^~~~~~~~~~~~
roads.cpp:86:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
86 | for(int i = x2; i < adj.size(); i++)
| ~~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
151 ms |
652 KB |
Output is correct |
3 |
Correct |
170 ms |
672 KB |
Output is correct |
4 |
Correct |
71 ms |
664 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
67 ms |
644 KB |
Output is correct |
9 |
Correct |
100 ms |
660 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Runtime error |
14 ms |
3440 KB |
Execution killed with signal 11 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Runtime error |
25 ms |
4856 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
3 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
2 ms |
448 KB |
Output is correct |
8 |
Correct |
3 ms |
432 KB |
Output is correct |
9 |
Correct |
2 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
408 KB |
Output is correct |
12 |
Correct |
2 ms |
412 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
3 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
408 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
2 ms |
440 KB |
Output is correct |
21 |
Correct |
0 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
3 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
2 ms |
448 KB |
Output is correct |
8 |
Correct |
3 ms |
432 KB |
Output is correct |
9 |
Correct |
2 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
408 KB |
Output is correct |
12 |
Correct |
2 ms |
412 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
3 ms |
332 KB |
Output is correct |
18 |
Correct |
2 ms |
408 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
2 ms |
440 KB |
Output is correct |
21 |
Correct |
0 ms |
332 KB |
Output is correct |
22 |
Correct |
0 ms |
332 KB |
Output is correct |
23 |
Correct |
97 ms |
580 KB |
Output is correct |
24 |
Correct |
261 ms |
640 KB |
Output is correct |
25 |
Correct |
190 ms |
616 KB |
Output is correct |
26 |
Correct |
176 ms |
652 KB |
Output is correct |
27 |
Correct |
141 ms |
716 KB |
Output is correct |
28 |
Correct |
72 ms |
588 KB |
Output is correct |
29 |
Correct |
206 ms |
636 KB |
Output is correct |
30 |
Correct |
120 ms |
680 KB |
Output is correct |
31 |
Correct |
125 ms |
684 KB |
Output is correct |
32 |
Correct |
71 ms |
684 KB |
Output is correct |
33 |
Correct |
109 ms |
844 KB |
Output is correct |
34 |
Correct |
148 ms |
924 KB |
Output is correct |
35 |
Correct |
120 ms |
844 KB |
Output is correct |
36 |
Correct |
151 ms |
684 KB |
Output is correct |
37 |
Correct |
175 ms |
708 KB |
Output is correct |
38 |
Correct |
69 ms |
696 KB |
Output is correct |
39 |
Correct |
1 ms |
332 KB |
Output is correct |
40 |
Correct |
1 ms |
332 KB |
Output is correct |
41 |
Correct |
2 ms |
332 KB |
Output is correct |
42 |
Correct |
3 ms |
332 KB |
Output is correct |
43 |
Correct |
1 ms |
332 KB |
Output is correct |
44 |
Correct |
2 ms |
332 KB |
Output is correct |
45 |
Correct |
5 ms |
332 KB |
Output is correct |
46 |
Correct |
2 ms |
408 KB |
Output is correct |
47 |
Correct |
2 ms |
460 KB |
Output is correct |
48 |
Correct |
2 ms |
460 KB |
Output is correct |
49 |
Correct |
2 ms |
460 KB |
Output is correct |
50 |
Correct |
1 ms |
332 KB |
Output is correct |
51 |
Correct |
1 ms |
332 KB |
Output is correct |
52 |
Correct |
1 ms |
332 KB |
Output is correct |
53 |
Correct |
152 ms |
588 KB |
Output is correct |
54 |
Correct |
260 ms |
652 KB |
Output is correct |
55 |
Correct |
108 ms |
708 KB |
Output is correct |
56 |
Correct |
65 ms |
588 KB |
Output is correct |
57 |
Correct |
100 ms |
676 KB |
Output is correct |
58 |
Correct |
1 ms |
332 KB |
Output is correct |
59 |
Correct |
3 ms |
332 KB |
Output is correct |
60 |
Correct |
2 ms |
420 KB |
Output is correct |
61 |
Correct |
1 ms |
332 KB |
Output is correct |
62 |
Correct |
1 ms |
412 KB |
Output is correct |
63 |
Correct |
0 ms |
332 KB |
Output is correct |
64 |
Correct |
253 ms |
648 KB |
Output is correct |
65 |
Correct |
249 ms |
652 KB |
Output is correct |
66 |
Correct |
86 ms |
660 KB |
Output is correct |
67 |
Correct |
69 ms |
676 KB |
Output is correct |
68 |
Correct |
87 ms |
796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
26 ms |
5296 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
26 ms |
5296 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
151 ms |
652 KB |
Output is correct |
3 |
Correct |
170 ms |
672 KB |
Output is correct |
4 |
Correct |
71 ms |
664 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
67 ms |
644 KB |
Output is correct |
9 |
Correct |
100 ms |
660 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Runtime error |
14 ms |
3440 KB |
Execution killed with signal 11 |
13 |
Halted |
0 ms |
0 KB |
- |