Submission #7467

# Submission time Handle Problem Language Result Execution time Memory
7467 2014-08-08T14:17:36 Z gs13068 Beads and wires (APIO14_beads) C++
100 / 100
244 ms 25424 KB
#include<cstdio>
#include<vector>
#include<algorithm>

std::vector<std::pair<int,int> > tr[200001];
int v[200001];
int d1[200001]; // none
int d2[200001]; // I
int d3[200001]; // V
int d4[200001]; // Y

void dfs(int x,int y)
{
	int m2,m31,m32,m32_1,m32_2,m4;
    int i;
	v[x]=1;
	m2=m31=m32=m32_1=m32_2=m4=-1e9;
    for(i=0;i<tr[x].size();i++)if(!v[tr[x][i].first])
	{
        dfs(tr[x][i].first,tr[x][i].second);

        d1[x]+=std::max(d1[tr[x][i].first],d2[tr[x][i].first]);

        d2[x]+=std::max(d1[tr[x][i].first],d2[tr[x][i].first]);
        m2=std::max(m2,y+tr[x][i].second+d1[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));

        d3[x]+=std::max(d1[tr[x][i].first],d2[tr[x][i].first]);
		m31=std::max(m31,std::max(d3[tr[x][i].first],d4[tr[x][i].first])-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));
        m32=std::max(m32,m32_1+tr[x][i].second+d1[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));
        m32=std::max(m32,m32_2+tr[x][i].second+d3[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));
		m32_1=std::max(m32_1,tr[x][i].second+d3[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));
        m32_2=std::max(m32_2,tr[x][i].second+d1[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));

        d4[x]+=std::max(d1[tr[x][i].first],d2[tr[x][i].first]);
        m4=std::max(m4,y+tr[x][i].second+d3[tr[x][i].first]-std::max(d1[tr[x][i].first],d2[tr[x][i].first]));
	}
	d2[x]+=std::max(0,m2);
	d3[x]+=std::max(0,std::max(m31,m32));
	d4[x]+=std::max(0,m4);
}

int main()
{
	int a,b,c;
	int i,n;
	scanf("%d",&n);
	for(i=1;i<n;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		tr[a].push_back(std::make_pair(b,c));
		tr[b].push_back(std::make_pair(a,c));
	}
	dfs(1,-1e9);
	printf("%d",std::max(std::max(d1[1],d2[1]),std::max(d3[1],d4[1])));
}

Compilation message

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:18:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<tr[x].size();i++)if(!v[tr[x][i].first])
             ~^~~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
beads.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&a,&b,&c);
   ~~~~~^~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 5032 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 5032 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 5 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 5 ms 4992 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 5032 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 5 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 5 ms 4992 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 9 ms 5376 KB Output is correct
25 Correct 8 ms 5376 KB Output is correct
26 Correct 11 ms 5760 KB Output is correct
27 Correct 11 ms 5760 KB Output is correct
28 Correct 10 ms 5760 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 10 ms 5760 KB Output is correct
31 Correct 11 ms 6144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 5032 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 5 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 5 ms 4992 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 9 ms 5376 KB Output is correct
25 Correct 8 ms 5376 KB Output is correct
26 Correct 11 ms 5760 KB Output is correct
27 Correct 11 ms 5760 KB Output is correct
28 Correct 10 ms 5760 KB Output is correct
29 Correct 10 ms 5760 KB Output is correct
30 Correct 10 ms 5760 KB Output is correct
31 Correct 11 ms 6144 KB Output is correct
32 Correct 50 ms 8720 KB Output is correct
33 Correct 40 ms 8824 KB Output is correct
34 Correct 50 ms 8696 KB Output is correct
35 Correct 236 ms 19960 KB Output is correct
36 Correct 244 ms 19932 KB Output is correct
37 Correct 215 ms 19964 KB Output is correct
38 Correct 170 ms 20324 KB Output is correct
39 Correct 157 ms 19512 KB Output is correct
40 Correct 185 ms 20400 KB Output is correct
41 Correct 229 ms 25424 KB Output is correct