oj.uz

Submission #952008

# Submission time Handle Problem Language Result Execution time Memory
952008 2024-03-23T03:38:43 Z vjudge1 Museum (CEOI17_museum) C++17
80 / 100
 3000 ms 784700 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e4 + 2;
int n, k, x;
int dp[N][N][2], son[N];
vector<pii> g[N];
void dfs(int u, int fa) {
	son[u] = 1;
	dp[u][1][0] = dp[u][1][1] = 0;
	for (pii f : g[u]) {
		int v = f.first, w = f.second;
		if (v == fa) continue;
		dfs(v, u);
		son[u] += son[v];
		for (int i = min(son[u], k); i >= 0; i--) {
			for (int j = 0; j <= min(son[v], i - 1); j++) {
				dp[u][i][0] = min(dp[u][i][0], dp[u][i - j][0] + dp[v][j][0] + w * 2);
				dp[u][i][1] = min(dp[u][i][1], dp[u][i - j][0] + dp[v][j][1] + w);
				dp[u][i][1] = min(dp[u][i][1], dp[u][i - j][1] + dp[v][j][0] + w * 2);
			}
		}
	}
}
int main() {
	scanf("%d%d%d", &n, &k, &x);
	for (int i = 1; i < n; i++) {
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	memset(dp, 0x3f, sizeof dp);
	dfs(x, -1);
	printf("%d\n", min(dp[x][k][0], dp[x][k][1]));
}

Compilation message

museum.cpp: In function 'int main()':
museum.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%d%d%d", &n, &k, &x);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
museum.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   scanf("%d%d%d", &u, &v, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 783700 KB Output is correct
2 Correct 208 ms 783672 KB Output is correct
3 Correct 208 ms 783828 KB Output is correct
4 Correct 241 ms 783628 KB Output is correct
5 Correct 211 ms 783572 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 784144 KB Output is correct
2 Correct 222 ms 784300 KB Output is correct
3 Correct 258 ms 784468 KB Output is correct
4 Correct 238 ms 784108 KB Output is correct
5 Correct 240 ms 783928 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 784144 KB Output is correct
2 Correct 222 ms 784300 KB Output is correct
3 Correct 258 ms 784468 KB Output is correct
4 Correct 238 ms 784108 KB Output is correct
5 Correct 240 ms 783928 KB Output is correct
6 Correct 219 ms 784084 KB Output is correct
7 Correct 253 ms 784208 KB Output is correct
8 Correct 236 ms 784020 KB Output is correct
9 Correct 222 ms 784132 KB Output is correct
10 Correct 223 ms 783956 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 783700 KB Output is correct
2 Correct 208 ms 783672 KB Output is correct
3 Correct 208 ms 783828 KB Output is correct
4 Correct 241 ms 783628 KB Output is correct
5 Correct 211 ms 783572 KB Output is correct
6 Correct 220 ms 784144 KB Output is correct
7 Correct 222 ms 784300 KB Output is correct
8 Correct 258 ms 784468 KB Output is correct
9 Correct 238 ms 784108 KB Output is correct
10 Correct 240 ms 783928 KB Output is correct
11 Correct 219 ms 784084 KB Output is correct
12 Correct 253 ms 784208 KB Output is correct
13 Correct 236 ms 784020 KB Output is correct
14 Correct 222 ms 784132 KB Output is correct
15 Correct 223 ms 783956 KB Output is correct
16 Correct 276 ms 783952 KB Output is correct
17 Correct 830 ms 783956 KB Output is correct
18 Correct 2078 ms 784464 KB Output is correct
19 Correct 301 ms 784700 KB Output is correct
20 Correct 255 ms 784036 KB Output is correct
21 Execution timed out 3073 ms 784088 KB Time limit exceeded
22 Halted 0 ms 0 KB -