oj.uz

Submission #167561

# Submission time Handle Problem Language Result Execution time Memory
167561 2019-12-09T01:54:13 Z puppies_and_rainbows Mag (COCI16_mag) C++14
24 / 120
 1656 ms 155236 KB 
#include <bits/stdc++.h>

using namespace std;
int n;
vector<int> adj[1000005];
int cac[1000005];
int a[1000005];
int ans=0;
bool hv=false;

void dfs(int node, int fa)
{
	pair<int, int> ok={0, 0};
	for(auto i:adj[node])
	{
		if(i==fa) continue;
		dfs(i, node);
		if(cac[i]>=ok.first)
		{
			ok.second=ok.first;
			ok.first=cac[i];
		}
		else if(cac[i]>ok.second)
		{
			ok.second=cac[i];
		}
	}
	if(a[node]==1)
	{
		ans=max(ans, ok.first+ok.second+1);
		cac[node]=ok.first+1;
	}
	ans=max(ans, cac[node]);
}

signed main()
{
	cin>>n;
	for(int i=1; i<n; i++)
	{
		int u, v;
		cin>>u>>v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for(int i=1; i<=n; i++)
	{
		cin>>a[i];
		if(a[i]==1) hv=true;
	}
	if(!hv)
	{
		cout<<*min_element(a+1, a+n+1)<<"/1";
		return 0;
	}
	dfs(1, 1);
	cout<<"1/"<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23800 KB Output is correct
2 Correct 24 ms 23800 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 23928 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1347 ms 100356 KB Output isn't correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1656 ms 155236 KB Output isn't correct

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1530 ms 78036 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1608 ms 81148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 29224 KB Output is correct
2 Incorrect 1523 ms 78560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1576 ms 76404 KB Output is correct
2 Incorrect 1630 ms 79260 KB Output isn't correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1536 ms 78840 KB Output is correct
2 Correct 960 ms 51524 KB Output is correct