oj.uz

Submission #127073

# Submission time Handle Problem Language Result Execution time Memory
127073 2019-07-08T21:06:47 Z Lawliet Mousetrap (CEOI17_mousetrap) C++14
25 / 100
 1157 ms 68172 KB 
#include <bits/stdc++.h>

#define MAX 1000010

using namespace std;
typedef long long int lli;

int n;
int mouse, trap;
int n1, n2;

int pai[MAX];

lli dp[MAX];

vector<int> grafo[MAX];

void DFSInit(int i, int p)
{
	for(int g = 0 ; g < grafo[i].size() ; g++)
	{
		int prox = grafo[i][g];

		if(prox == p) continue;

		pai[prox] = i;

		DFSInit(prox , i);
	}
}

void DFS(int i, int p)
{
	if(grafo[i].size() == 1 && i != trap)
	{
		dp[i] = 0;

		return;
	}

	vector<int> aux;

	aux.push_back( 0 );

	for(int g = 0 ; g < grafo[i].size() ; g++)
	{
		int prox = grafo[i][g];

		if(prox == p) continue;

		//printf("i = %d   chamei %d\n",i,prox);

		//printf("i = %d  prox = %d\n",i,prox);

		DFS(prox , i);

		aux.push_back( dp[prox] );
	}

	sort(aux.begin() , aux.end());

	dp[i] = grafo[i].size() - 2 + aux[aux.size() - 2] + 1;

	//printf("dp(%d) = %lld\n",i,dp[i]);
}

int main()
{
	scanf("%d %d %d",&n,&trap,&mouse);

	for(int g = 0 ; g < n - 1 ; g++)
	{
		scanf("%d %d",&n1,&n2);

		grafo[n1].push_back(n2);
		grafo[n2].push_back(n1);
	}

	DFSInit(trap , trap);

	DFS(trap , trap);

	int aux = pai[mouse];
	int sum = 0;

	while(aux != trap)
	{
		sum += grafo[aux].size() - 2;
		aux = pai[aux];
	}

	//printf("dp = %d  sum = %d\n",dp[mouse],sum);

	lli ans = dp[mouse] + sum;

	int cur = mouse;
	//int sum = 0;

	for(int g = 0 ; g < grafo[pai[cur]].size() ; g++)
	{
		int prox = grafo[pai[cur]][g];

		if(prox == cur)
		{
			grafo[pai[cur]].erase(grafo[pai[cur]].begin() + g);
			break;
		}
	}

	cur = pai[cur];

	while(cur != trap)
	{
		//printf("\n\n\n\n");
		DFS(trap , trap);

		//printf("cur = %d\n",cur);

		aux = pai[cur];
		sum = 0;

		while(aux != trap)
		{
			sum += grafo[aux].size() - 2;
			aux = pai[aux];
		}

		//printf("dp = %d  sum = %d\n",dp[cur],sum);

		ans = max(ans , dp[cur] + sum);

		for(int g = 0 ; g < grafo[pai[cur]].size() ; g++)
		{
			int prox = grafo[pai[cur]][g];

			if(prox == cur)
			{
				grafo[pai[cur]].erase(grafo[pai[cur]].begin() + g);
				break;
			}
		}

		cur = pai[cur];
	}

	printf("%lld\n",ans);
}

Compilation message

mousetrap.cpp: In function 'void DFSInit(int, int)':
mousetrap.cpp:20:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int g = 0 ; g < grafo[i].size() ; g++)
                  ~~^~~~~~~~~~~~~~~~~
mousetrap.cpp: In function 'void DFS(int, int)':
mousetrap.cpp:45:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int g = 0 ; g < grafo[i].size() ; g++)
                  ~~^~~~~~~~~~~~~~~~~
mousetrap.cpp: In function 'int main()':
mousetrap.cpp:99:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int g = 0 ; g < grafo[pai[cur]].size() ; g++)
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~
mousetrap.cpp:132:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int g = 0 ; g < grafo[pai[cur]].size() ; g++)
                   ~~^~~~~~~~~~~~~~~~~~~~~~~~
mousetrap.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&trap,&mouse);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
mousetrap.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&n1,&n2);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 28 ms 23800 KB Output is correct
5 Incorrect 23 ms 23800 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 533 ms 66808 KB Output is correct
2 Correct 482 ms 62584 KB Output is correct
3 Correct 1157 ms 68092 KB Output is correct
4 Correct 554 ms 46092 KB Output is correct
5 Correct 1138 ms 68172 KB Output is correct
6 Correct 1146 ms 68088 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 28 ms 23800 KB Output is correct
5 Incorrect 23 ms 23800 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 28 ms 23800 KB Output is correct
5 Incorrect 23 ms 23800 KB Output isn't correct
6 Halted 0 ms 0 KB -