답안 #734681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734681	2023-05-02T19:43:00 Z	Abrar_Al_Samit	구슬과 끈 (APIO14_beads)	C++17	28 / 100	1000 ms	724 KB

beads

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


const int nax = 10001;

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

int dp[nax][2], n;

int solve(int v, int topar, int p = -1) {
	int &ret = dp[v][(topar>0)];
	if(ret!=-1) return ret;

	ret = 0;
	int base = 0;
	for(auto [u, w] : g[v]) if(u!=p) {
		base += solve(u, w, v);
	}

	ret = base;

	if(topar) {
		for(auto [u, w] : g[v]) if(u!=p) {
			int cur = base - solve(u, w, v) + solve(u, 0, v) + topar + w;
			ret = max(ret, cur);
		}
	}
	return ret;
}
void PlayGround() {
	cin>>n;
	for(int i=1; i<n; ++i) {
		int u, v, w;
		cin>>u>>v>>w;
		g[u].emplace_back(v, w);
		g[v].emplace_back(u, w);
	}	

	int ans = 0;
	for(int i=1; i<=n; ++i) {
		memset(dp, -1, sizeof dp);
		ans = max(ans, solve(i, 0));
	}
	cout<<ans<<'\n';

	// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	PlayGround();
	return 0;
}

Subtask #1

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	0 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	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	0 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	596 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	0 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	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	0 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	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	4 ms	596 KB	Output is correct
17	Correct	2 ms	596 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	3 ms	596 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	2 ms	596 KB	Output is correct

Subtask #3

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	0 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	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	0 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	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	4 ms	596 KB	Output is correct
17	Correct	2 ms	596 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	3 ms	596 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	2 ms	596 KB	Output is correct
23	Execution timed out	1065 ms	724 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #4

0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	0 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	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	0 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	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	4 ms	596 KB	Output is correct
17	Correct	2 ms	596 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	3 ms	596 KB	Output is correct
21	Correct	2 ms	596 KB	Output is correct
22	Correct	2 ms	596 KB	Output is correct
23	Execution timed out	1065 ms	724 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-