oj.uz

Submission #439306

# Submission time Handle Problem Language Result Execution time Memory
439306 2021-06-29T14:36:38 Z keta_tsimakuridze Beads and wires (APIO14_beads) C++14
13 / 100
 1 ms 552 KB 
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=1e4+5,mod=1e9+7;
int dp[N][2],n,mx[N],x[N],leaf[N];
vector<pair<int,int> > V[N];
void dfs(int u,int p) {
	// kvela wibo shviltan gavlilia - 1   aris erti darchenili - 0 
	leaf[u] = 0;
	dp[u][0] = dp[u][1]  = 0;
	dp[u][0] = -1e8;
	
	for(int i=0;i<V[u].size();i++) {
		int v = V[u][i].f;
		if(v==p) continue;
		dfs(v,u);
		int x = 0;
		if(!leaf[v]) dp[u][1] += max(dp[v][0] + V[u][i].s,dp[v][1]),x =max(dp[v][0] + V[u][i].s,dp[u][1]);
		dp[u][0] = max(dp[u][0], -x +dp[v][1]+V[u][i].s);
	}
	dp[u][0] += dp[u][1];
	if(V[u].size()==1 && p)leaf[u] = 1;
}

 main(){
   ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=2;i<=n;i++){
		int u,v,w;
		cin>>u>>v>>w;
		V[u].push_back({v,w});
		V[v].push_back({u,w});
	}
	int ans = 0;
	for(int i=1;i<=n;i++){ 
		dfs(i,0);
		ans = max(ans,dp[i][1]);
	}
	//
//	dfs2(1,0); 
	cout<<ans;
}

Compilation message

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:14:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i=0;i<V[u].size();i++) {
      |              ~^~~~~~~~~~~~
beads.cpp: At global scope:
beads.cpp:26:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   26 |  main(){
      |  ^~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Incorrect 1 ms 460 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Incorrect 1 ms 460 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Incorrect 1 ms 460 KB Output isn't correct
14 Halted 0 ms 0 KB -