oj.uz

Submission #389165

# Submission time Handle Problem Language Result Execution time Memory
389165 2021-04-13T18:57:05 Z mosiashvililuka Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 15180 KB 
#include<bits/stdc++.h>
using namespace std;
const long long N=1000000000000000000LL;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,pas,dp[200009],dp2[200009];
pair <long long, long long> msh[200009];
vector <pair <long long, long long> > v[200009];
multiset <long long> s[200009];
void dfsst(long long q, long long w){
	long long qw=-N;
	for(vector <pair <long long, long long> >::iterator it=v[q].begin(); it!=v[q].end(); it++){
		if((*it).first==w) continue;
		msh[(*it).first]=make_pair(q,(*it).second);
		dfsst((*it).first,q);
		dp[q]+=max(dp[(*it).first],dp2[(*it).first]);
		if(qw<(*it).second+dp[(*it).first]-max(dp[(*it).first],dp2[(*it).first])) qw=(*it).second+dp[(*it).first]-max(dp[(*it).first],dp2[(*it).first]);
	}
	if(qw!=-N){
		dp2[q]=msh[q].second+dp[q]+qw;
	}else{
		dp2[q]=-N;
	}
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a;
	for(i=1; i<a; i++){
		cin>>c>>d>>e;
		v[c].push_back(make_pair(d,e));
		v[d].push_back(make_pair(c,e));
	}
	for(i=1; i<=a; i++){
		for(j=0; j<=a+1; j++){
			dp[j]=dp2[j]=0;
		}
		dfsst(i,0);
		pas=max(pas,dp[i]);
	}
	cout<<pas;
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14304 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14408 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14316 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14340 KB Output is correct
11 Correct 9 ms 14428 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14304 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14408 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14316 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14340 KB Output is correct
11 Correct 9 ms 14428 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 9 ms 14432 KB Output is correct
15 Correct 9 ms 14432 KB Output is correct
16 Correct 10 ms 14416 KB Output is correct
17 Correct 10 ms 14428 KB Output is correct
18 Correct 12 ms 14324 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 12 ms 14412 KB Output is correct
21 Correct 10 ms 14440 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14304 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14408 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14316 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14340 KB Output is correct
11 Correct 9 ms 14428 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 9 ms 14432 KB Output is correct
15 Correct 9 ms 14432 KB Output is correct
16 Correct 10 ms 14416 KB Output is correct
17 Correct 10 ms 14428 KB Output is correct
18 Correct 12 ms 14324 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 12 ms 14412 KB Output is correct
21 Correct 10 ms 14440 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 811 ms 14820 KB Output is correct
24 Correct 791 ms 14816 KB Output is correct
25 Correct 780 ms 14824 KB Output is correct
26 Execution timed out 1080 ms 15180 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14304 KB Output is correct
2 Correct 9 ms 14412 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 10 ms 14412 KB Output is correct
6 Correct 9 ms 14408 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14316 KB Output is correct
9 Correct 9 ms 14412 KB Output is correct
10 Correct 9 ms 14340 KB Output is correct
11 Correct 9 ms 14428 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 10 ms 14412 KB Output is correct
14 Correct 9 ms 14432 KB Output is correct
15 Correct 9 ms 14432 KB Output is correct
16 Correct 10 ms 14416 KB Output is correct
17 Correct 10 ms 14428 KB Output is correct
18 Correct 12 ms 14324 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 12 ms 14412 KB Output is correct
21 Correct 10 ms 14440 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 811 ms 14820 KB Output is correct
24 Correct 791 ms 14816 KB Output is correct
25 Correct 780 ms 14824 KB Output is correct
26 Execution timed out 1080 ms 15180 KB Time limit exceeded
27 Halted 0 ms 0 KB -