oj.uz

Submission #372662

# Submission time Handle Problem Language Result Execution time Memory
372662 2021-03-01T09:01:47 Z hivakarami Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 5996 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
 
const int N = 2e5 + 100;
const ll mod = 998244353;
const ll inf = 1e9 + 100;

ll dp[3][N], par[N];
vector<pair<int, int>> adj[N];
int n;

void dfs(int u)
{
	dp[1][u] = 0;
	for(auto it : adj[u])
	{
		int x = it.f, w = it.s;
		if(x != par[u])
		{
			par[x] = u;
			dfs(x);
			dp[1][u] += min(dp[1][x] + w, dp[2][x]);
		}
	}
	
	dp[2][u] = inf;
	for(auto it : adj[u])
	{	
		int x = it.f, w = it.s;
		if(x != par[u])
		{
			ll mn = min(dp[1][x] + w, dp[2][x]);
			dp[2][u] = min(dp[2][u], dp[1][u] - mn + dp[1][x]);
		}
	}
	
	//cout << u << ' ' << dp[1][u] << ' ' << dp[2][u] << endl;
}


inline void cl()
{
	for(int i = 0; i < n; i++)
		par[i] = i;
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);	
	
	cin >> n;
	ll sum = 0;
	for(int i = 0; i < n-1; i++)
	{
		int x, y, w;
		cin >> x >> y >> w;
		x--; y--;
		adj[x].push_back({y, w});
		adj[y].push_back({x, w});
		sum += w;
	}
	
	ll mn = inf;
	
	for(int i = 0; i < n; i++)
	{
		cl();
		dfs(i);
		mn = min(mn, dp[1][i]);
	}	
		
	cout << sum - mn << endl;
	
	
		
		
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 854 ms 5476 KB Output is correct
24 Correct 859 ms 5540 KB Output is correct
25 Correct 877 ms 5492 KB Output is correct
26 Execution timed out 1071 ms 5996 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 5 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 854 ms 5476 KB Output is correct
24 Correct 859 ms 5540 KB Output is correct
25 Correct 877 ms 5492 KB Output is correct
26 Execution timed out 1071 ms 5996 KB Time limit exceeded
27 Halted 0 ms 0 KB -