답안 #537233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
537233	2022-03-14T19:27:52 Z	LucaDantas	구슬과 끈 (APIO14_beads)	C++17	28 / 100	1000 ms	1108 KB

beads

// provavelmente vai dar errado, e com certeza da tle nas maiores
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 1e4+10; // subtask mudar

vector<pair<int,int>> g[maxn];

int dp[maxn][2]; // posso retornar com o pai livre ou sem o pai livre

void dfs(int u, int p, int peso_pai) {
	for(auto [v, w] : g[u]) if(v != p) {
		dfs(v, u, w);
		dp[u][1] = max(dp[u][1], dp[v][0] + w + peso_pai - max(dp[v][0], dp[v][1]));
		dp[u][0] += max(dp[v][0], dp[v][1]);
	}
	dp[u][1] += dp[u][0];
	// printf("%d -> %d %d\n", u, dp[u][0], dp[u][1]);
}

int main() {
	int n; scanf("%d", &n);
	for(int i = 1, a, b, w; i < n; i++)
		scanf("%d %d %d", &a, &b, &w), g[a].push_back({b, w}), g[b].push_back({a, w});
	// comeco de uma folha pq é mais facil
	int ans = 0;
	for(int i = 1; i <= n; i++)
		if(g[i].size() == 1)
			dfs(i, 0, 0), ans = max(ans, dp[i][0]), memset(dp, 0, sizeof dp);
	printf("%d\n", ans);
	/* int st = -1;
	for(int i = 1; i < n; i++)
		if(g[i].size() == 1) st = i;
	dfs(st, 0, 0);
	printf("%d\n", dp[st][0]); */
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
beads.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%d %d %d", &a, &b, &w), g[a].push_back({b, w}), g[b].push_back({a, w});
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	0 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	596 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	620 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	0 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	596 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	620 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	2 ms	596 KB	Output is correct
15	Correct	1 ms	540 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	1 ms	548 KB	Output is correct
18	Correct	1 ms	544 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	1 ms	548 KB	Output is correct

Subtask #3

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	0 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	596 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	620 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	2 ms	596 KB	Output is correct
15	Correct	1 ms	540 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	1 ms	548 KB	Output is correct
18	Correct	1 ms	544 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	1 ms	548 KB	Output is correct
23	Correct	276 ms	824 KB	Output is correct
24	Correct	264 ms	852 KB	Output is correct
25	Correct	257 ms	852 KB	Output is correct
26	Execution timed out	1075 ms	1108 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #4

0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	0 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	1 ms	596 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	620 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	2 ms	596 KB	Output is correct
15	Correct	1 ms	540 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	1 ms	548 KB	Output is correct
18	Correct	1 ms	544 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	1 ms	548 KB	Output is correct
23	Correct	276 ms	824 KB	Output is correct
24	Correct	264 ms	852 KB	Output is correct
25	Correct	257 ms	852 KB	Output is correct
26	Execution timed out	1075 ms	1108 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-