oj.uz

Submission #878685

# Submission time Handle Problem Language Result Execution time Memory
878685 2023-11-25T05:16:18 Z Faisal_Saqib Mousetrap (CEOI17_mousetrap) C++17
25 / 100
 1353 ms 147312 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int N=1e6+2;
set<int> ma[N];
int dp_to_t[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;
int from,to;
vector<int> path,prefix;
void find_path(int x,int p=-1)
{
	prefix.push_back(x);
	if(to==x)
	{
		while(prefix.back()!=from)
		{
			path.push_back(prefix.back());
			prefix.pop_back();
		}
		int i=((int)path.size())-1;
		path.push_back(from);
		while(i>=0 and prefix.back()!=to)
		{
			prefix.push_back(path[i]);
			i--;
		}
	}
	for(auto y:ma[x])
		if(y!=p)
			find_path(y,x);
	prefix.pop_back();
}
void dfs(int x,int p=-1)
{
	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)
		{
			if(dp[y]>mx)
			{
				mx2=mx;
				mx=dp[y];
			}
			else if(dp[y]>mx2)
			{
				mx2=dp[y];
			}
		}
	}
	dp[x]=mx2+total;
}
int main()
{
	cin>>n>>t>>m;
	for(int i=1;i<n;i++)
	{
		int x,y;
		cin>>x>>y;
		ma[x].insert(y);
		ma[y].insert(x);
	}
	from=t;
	to=m;
	find_path(from);
	long long ansp=0;
	for(int i=0;i+1<path.size();i++)
	{
		// Remove edge 
		int x=path[i+1];
		int y=path[i];
		ma[x].erase(y);
		ma[y].erase(x);
		dfs(y);
		ansp+=dp[y];
		// cout<<dp[y]<<endl;
	}
	cout<<ansp<<endl;
	// cout<<endl;
	// cout<<dp[m]<<endl;
	// for(int i=1;i<=n;i++)
	// {
	// 	cout<<"for" <<i<<' '<<dp[i]<<endl;
	// }
	return 0;
}

Compilation message

mousetrap.cpp: In function 'int main()':
mousetrap.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |  for(int i=0;i+1<path.size();i++)
      |              ~~~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 48732 KB Output is correct
2 Correct 9 ms 48728 KB Output is correct
3 Correct 10 ms 48872 KB Output is correct
4 Correct 9 ms 48732 KB Output is correct
5 Incorrect 10 ms 48732 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 147028 KB Output is correct
2 Correct 510 ms 137492 KB Output is correct
3 Correct 1353 ms 147312 KB Output is correct
4 Correct 625 ms 98036 KB Output is correct
5 Correct 1352 ms 146908 KB Output is correct
6 Correct 1348 ms 147024 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 48732 KB Output is correct
2 Correct 9 ms 48728 KB Output is correct
3 Correct 10 ms 48872 KB Output is correct
4 Correct 9 ms 48732 KB Output is correct
5 Incorrect 10 ms 48732 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 48732 KB Output is correct
2 Correct 9 ms 48728 KB Output is correct
3 Correct 10 ms 48872 KB Output is correct
4 Correct 9 ms 48732 KB Output is correct
5 Incorrect 10 ms 48732 KB Output isn't correct
6 Halted 0 ms 0 KB -