CompetitiveCoding-SoC-/tag.cpp at master · kasangeri/CompetitiveCoding-SoC- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <bits/stdc++.h>
using namespace std;
map<int,vector<int> > Tree;
int visited[200000];
int Dist(int A, int B, int n)
{
  queue<int> Q;
  Q.push(A);

  long distance[n+1];
  for(int i=0;i<=n;i++){visited[i]=0; distance[i]=0;}
  distance[A]=0;
  visited[A]=1;
  int x = A;
  while(!Q.empty())
	{
        x = Q.front();
 	Q.pop();
	for(int i=0;i<Tree[x].size();i++)
 		{
                   int y = Tree[x][i];
		   if(visited[y])
			continue;
		       {
			distance[y] = (distance[x] + 1);
			Q.push(y);

			visited[y]=1;
			}

		}
		//Tree[x].erase(Tree[x].begin(),Tree[x].end());
        }

  //queue<int> Q;
  Q.push(B);
  int visitedB[n+1];
  long distanceB[n+1];
  for(int i=0;i<=n;i++){visitedB[i]=0; distanceB[i]=0;}
  distanceB[B]=0;
  visitedB[B]=1;

   while(!Q.empty())
	{
        x = Q.front();
 	Q.pop();
	for(int i=0;i<Tree[x].size();i++)
 		{
                   int y = Tree[x][i];
		if(visitedB[y])
			continue;
		       {
			distanceB[y] = distanceB[x] + 1;
			Q.push(y);

			visitedB[y]=1;
			}

		}
		//Tree[x].erase(Tree[x].begin(),Tree[x].end());
        }

  long maxx = 0;
  for(int i=1;i<=n;i++)
{
  if(distance[i]>distanceB[i] && distance[i]>maxx) maxx = distance[i];
 }

  return maxx;

}


int main()
{
  int n;
  cin>>n;
  int x;
  cin>>x;
  int u,v;
  for(int i=1;i<n;i++)
	{
          cin>>u>>v;
	  Tree[u].push_back(v);
          Tree[v].push_back(u);
        }
  long tox = Dist(1,x,n);
  //cout<<2*tox;
 cout<<sizeof(int);
}