oj.uz

Submission #1005416

# Submission time Handle Problem Language Result Execution time Memory
1005416 2024-06-22T12:20:11 Z 0npata Road Closures (APIO21_roads) C++17
0 / 100
 88 ms 68936 KB 
#include "roads.h"

#include<bits/stdc++.h>
using namespace std;

#define vec vector
#define int long long

const int MXN = 2'005;
vec<pair<int, int>> tree[MXN];
int dp[MXN][MXN];

void dfs(int u, int p = -1) {
	for(auto [v, w] : tree[u]) {
		if(v == p) continue;

		dfs(v, u);
	}

	for(int k = 1; k<MXN; k++) {
		vec<int> ext(0);
		for(auto [v, w] : tree[u]) {
			if(v == p) continue;

			dp[u][k] += dp[v][k];
			ext.push_back(w + dp[v][k-1] - dp[v][k]);
		}

		sort(ext.begin(), ext.end(), greater<int>());

		for(int i = 0; i<min((int) ext.size(), k); i++) {
			if(ext[i] > 0) dp[u][k] += ext[i];
		}
	}
}

std::vector<int> minimum_closure_costs(int32_t n, std::vector<int32_t> u,
                                             std::vector<int32_t> v,
                                             std::vector<int32_t> w) {
	for(int i = 0; i<MXN; i++) {
		tree[i] = {};
		for(int j = 0; j<MXN; j++) {
			dp[i][j] = 0;
		}
	}
	int sumw = 0;
	for(int i = 0; i<n-1; i++) {
		tree[u[i]].push_back({v[i], w[i]});
		tree[v[i]].push_back({u[i], w[i]});
		sumw += w[i];
	}

	dfs(0);

	vec<int> ans(n);
	for(int i = 0; i<n; i++) {
		ans[i] = sumw - dp[0][i];
	}
	return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 78 ms 32112 KB Output is correct
3 Correct 88 ms 32092 KB Output is correct
4 Correct 67 ms 32092 KB Output is correct
5 Correct 7 ms 31836 KB Output is correct
6 Correct 9 ms 31836 KB Output is correct
7 Correct 9 ms 31836 KB Output is correct
8 Correct 60 ms 32092 KB Output is correct
9 Correct 72 ms 32344 KB Output is correct
10 Correct 9 ms 31968 KB Output is correct
11 Correct 9 ms 31836 KB Output is correct
12 Runtime error 36 ms 67184 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31832 KB Output is correct
2 Runtime error 42 ms 68440 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31832 KB Output is correct
2 Correct 4 ms 31836 KB Output is correct
3 Correct 4 ms 31948 KB Output is correct
4 Incorrect 11 ms 31924 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31832 KB Output is correct
2 Correct 4 ms 31836 KB Output is correct
3 Correct 4 ms 31948 KB Output is correct
4 Incorrect 11 ms 31924 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 68936 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 68936 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 78 ms 32112 KB Output is correct
3 Correct 88 ms 32092 KB Output is correct
4 Correct 67 ms 32092 KB Output is correct
5 Correct 7 ms 31836 KB Output is correct
6 Correct 9 ms 31836 KB Output is correct
7 Correct 9 ms 31836 KB Output is correct
8 Correct 60 ms 32092 KB Output is correct
9 Correct 72 ms 32344 KB Output is correct
10 Correct 9 ms 31968 KB Output is correct
11 Correct 9 ms 31836 KB Output is correct
12 Runtime error 36 ms 67184 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -