oj.uz

Submission #878657

# Submission time Handle Problem Language Result Execution time Memory
878657 2023-11-25T03:57:04 Z Faisal_Saqib Mousetrap (CEOI17_mousetrap) C++17
0 / 100
 867 ms 60244 KB 
#include <iostream>
#include <vector>
using namespace std;
const int N=1e6+2;
vector<int> ma[N];
int dp[N]; // dp[x] = def = what is the minimum number of step(Of Kalu ustad) return back to x,such that the subtree of x  are  the only cities you can go to
int n,t,m;
void dfs(int x,int p=-1)
{
	if(x==t)
	{
		dp[x]=0;
		return;
	}
	int total=0;
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			dfs(y,x);
			total++;
		}
	}
	int mx=0;
	int mx2=0;
	for(auto y:ma[x])
	{
		if(y!=p)
		{
			dp[y]++;
			if(dp[y]>mx)
			{
				mx2=mx;
				mx=dp[y];
			}
			else if(dp[y]>mx2)
			{
				mx2=dp[y];
			}
		}
	}
	if(total==0)
	{
		dp[x]=0;
		return;
	}
	dp[x]=max(0,mx2+total-1-(x==m));
}
int main()
{
	cin>>n>>t>>m;
	for(int i=1;i<n;i++)
	{
		int x,y;
		cin>>x>>y;
		ma[x].push_back(y);
		ma[y].push_back(x);
	}
	dfs(m);
	cout<<dp[m]<<endl;
	return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 59024 KB Output is correct
2 Correct 516 ms 55988 KB Output is correct
3 Correct 867 ms 60244 KB Output is correct
4 Incorrect 386 ms 44024 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 35.0

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