fork download
copy 
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. /* Name of the class has to be "Main" only if the class is public. */
  8. class Why
  9. {
  10.  
  11. 	public int[] depths1;
  12. 	public int[] depths2; 
  13. 	public ArrayList<Integer>[] arr; 
  14.  
  15. 	public static void main (String[] args) throws java.lang.Exception
  16. 	{
  17. 		Why w = new Why();
  18. 		w.comp();
  19. 	}
  20.  
  21. 	public void dfs1(int source, int dep)
  22. 	{
  23. 		if(depths1[source] != -1) 
  24. 		{
  25. 			return;
  26. 		}
  27. 		depths1[source] = dep;
  28. 		System.out.println("HELLO WHAT IS WRONG");
  29.  
  30. 		for(int i = 0; i < arr[source].size(); i++)
  31. 		{
  32. 			int next = arr[source].get(i);
  33. 			if(depths1[next] == -1)
  34. 			{
  35. 				dfs1(next, dep+1);
  36. 			}
  37. 		}
  38. 	}
  39.  
  40. 	public void dfs2(int source, int dep)
  41. 	{
  42. 		if(depths2[source] == -1) 
  43. 		{
  44. 			depths2[source] = dep;
  45. 		}
  46. 		else return;
  47.  
  48. 		for(int next : arr[source])
  49. 		{
  50. 			if(depths2[next] == -1)
  51. 			{
  52. 				dfs2(next, dep+1);
  53. 			}
  54. 		}
  55. 	}
  56.  
  57. 	public void comp()
  58. 	{
  59. 		Scanner sc = new Scanner(System.in);
  60. 		PrintWriter pw = new PrintWriter(System.out);
  61.  
  62. 		int n = sc.nextInt();
  63.  
  64. 		depths1 = new int[n];
  65. 		depths2 = new int[n];
  66.  
  67. 		Arrays.fill(depths1, -100);
  68. 		Arrays.fill(depths2, -100);
  69.  
  70. 		arr = new ArrayList[n];
  71.  
  72. 		for(int i = 0; i < arr.length; i++) arr[i] = new ArrayList<>();
  73.  
  74. 		for(int i = 0; i < n-1; i++)
  75. 		{
  76. 			int u = sc.nextInt() - 1;
  77. 			int v = sc.nextInt() - 1;
  78.  
  79. 			arr[u].add(v);
  80. 			arr[v].add(u);
  81. 		}
  82.  
  83. 		dfs1(0, 0);
  84.  
  85. 		long max = 0;
  86. 		int newn = -1;
  87. 		for(int i = 0; i < n; i++)
  88. 		{
  89. 			if(max < depths1[i])
  90. 			{
  91. 				newn = i;
  92. 				max = depths1[i];
  93. 			}
  94. 		}
  95.  
  96. 		pw.println(newn);
  97. 		for(int i = 0; i < depths1.length; i++) pw.println(depths1[i]);
  98.  
  99. 		// dfs2(newn, 0);
  100.  
  101. 		max = 0;
  102. 		for(int i = 0; i < n; i++)
  103. 		{
  104. 			if(max < depths1[i])
  105. 			{
  106. 				max = depths1[i];
  107. 			}
  108. 		}
  109.  
  110. 		pw.println(max);
  111. 		pw.close();
  112. 		sc.close();
  113. 	}
  114. }
  115.  
Success #stdin #stdout 0.1s 2841600KB
comments (?)
stdin
copy 
6
1 2
2 3
2 4
4 6
4 5
stdout
copy 
-1
-100
-100
-100
-100
-100
-100
0
https://ideone.com/NM567f
language:
Java (HotSpot 12)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!