fork download
copy 
  1.  
  2.  
  3. 			import java.io.*;
  4. 			import java.util.*;
  5. 			class ANARC05B
  6. 			{
  7. 				public static void main(String args[])
  8. 				throws IOException
  9. 				{
  10. 					BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  11. 					String str1="";
  12. 					try{
  13. 					while(!(str1=br.readLine()).equals("0"))
  14. 					{
  15. 						String str2=br.readLine();
  16. 						StringTokenizer st1=new StringTokenizer(str1," +");
  17. 						StringTokenizer st2=new StringTokenizer(str2," +");
  18. 						int arr1[]=new int[Integer.parseInt(st1.nextToken())];
  19. 						int arr2[]=new int[Integer.parseInt(st2.nextToken())];
  20. 						int pos=0;
  21. 						ArrayList<Integer> al=new ArrayList<Integer>();
  22. 						ArrayList<Integer> list=new ArrayList<Integer>();
  23. 						while(st1.hasMoreTokens()){
  24. 							arr1[pos++]=Integer.parseInt(st1.nextToken());al.add(arr1[pos-1]);}
  25. 						pos=0;
  26. 						while(st2.hasMoreTokens()){
  27. 							arr2[pos++]=Integer.parseInt(st2.nextToken());
  28. 							if(al.contains(arr2[pos-1]))
  29. 								list.add(arr2[pos-1]);
  30. 							}
  31.  
  32. 						int sum1=0,sum2=0,beg=0, main_sum=0,p1=0,p2=0;
  33.  
  34. 						//if there are no intersections at all
  35. 						if(list.isEmpty())
  36. 						{
  37. 							if(arr1.length<arr2.length)
  38. 							{
  39. 								for(int i=0;i<arr1.length;i++)
  40. 								{
  41. 									sum1+=arr1[i];
  42. 									sum2+=arr2[i];
  43. 								}
  44. 								for(int i=arr1.length;i<arr2.length;i++)
  45. 									sum2+=arr2[i];
  46.  
  47. 								main_sum+=Math.max(sum1, sum2);
  48. 								System.out.println(main_sum);
  49. 								continue;
  50. 							}
  51. 							else if(arr2.length<arr1.length)
  52. 							{
  53. 								for(int i=0;i<arr2.length;i++)
  54. 								{
  55. 									sum1+=arr1[i];
  56. 									sum2+=arr2[i];
  57. 								}
  58. 								for(int i=arr2.length;i<arr1.length;i++)
  59. 									sum1+=arr1[i];
  60.  
  61. 								main_sum+=Math.max(sum1, sum2);
  62. 								System.out.println(main_sum);
  63. 								continue;
  64. 							}
  65. 							else//same length of both arrays
  66. 							{
  67. 								for(int i=0;i<arr2.length;i++)
  68. 								{
  69. 									sum1+=arr1[i];
  70. 									sum2+=arr2[i];
  71. 								}
  72. 								main_sum+=Math.max(sum1, sum2);
  73. 								System.out.println(main_sum);
  74. 								continue;
  75. 							}
  76. 						}
  77.  
  78.  
  79. 						Iterator<Integer> iter=list.iterator();
  80. 						while(iter.hasNext())
  81. 						{
  82. 							int intersect=iter.next();
  83. 							p1=Arrays.binarySearch(arr1, intersect);
  84. 							p2=Arrays.binarySearch(arr2, intersect);
  85. 							if(p1==p2)
  86. 							{
  87. 								for(int i=beg;i<=p1;i++)
  88. 								{
  89. 									sum1+=arr1[i];
  90. 									sum2+=arr2[i];
  91. 								}
  92. 								main_sum+=Math.max(sum1, sum2);
  93. 								beg=p1+1;
  94. 							}
  95. 							else if(p1>p2)
  96. 							{
  97. 								for(int i=beg;i<=p2;i++)
  98. 								{
  99. 									sum1+=arr1[i];
  100. 									sum2+=arr2[i];
  101. 								}
  102. 								for(int i=p2+1;i<=p1;i++)
  103. 									sum1+=arr1[i];
  104. 								main_sum+=Math.max(sum1, sum2);
  105. 								beg=p1+1;
  106. 							}
  107. 							else if(p2>p1)
  108. 							{
  109. 								for(int i=beg;i<=p1;i++)
  110. 								{
  111. 									sum1+=arr1[i];
  112. 									sum2+=arr2[i];
  113. 								}
  114. 								for(int i=p1+1;i<=p2;i++)
  115. 									sum2+=arr2[i];
  116.  
  117. 								main_sum+=Math.max(sum1, sum2);
  118. 								beg=p2+1;
  119. 							}
  120.  
  121. 							sum1=sum2=0;
  122. 							if(beg-p1<beg-p2)
  123. 							{
  124. 								for(int i=beg-1;i>p2;i--)
  125. 									sum2+=arr2[i];
  126. 							}
  127. 							else if(beg-p1>beg-p2)
  128. 							{
  129. 								for(int i=beg-1;i>p1;i--)
  130. 									sum1+=arr1[i];
  131. 							}
  132. 						}
  133.  
  134. 						//calculating from last intersection point till the end
  135. 						sum1=sum2=0;
  136. 						for(int i=p1+1;i<arr1.length;i++)
  137. 							sum1+=arr1[i];
  138. 						for(int i=p2+1;i<arr2.length;i++)
  139. 							sum2+=arr2[i];
  140. 						main_sum+=Math.max(sum1, sum2);
  141. 						System.out.println(main_sum);
  142. 					}
  143. 					}//try block
  144. 					catch(Exception e)
  145. 					{return;}
  146. 				}
  147. 			}
Success #stdin #stdout 0.07s 380224KB
comments (?)
stdin
copy 
13 3 5 7 9 20 25 30 40 55 56 57 60 62
11 1 4 7 11 14 25 44 47 55 57 100
4 -5 100 1000 1005
3 -12 1000 1001
4 1 2 3 4 
4 5 6 7 8 
4 1 2 3 4 
3 3 7 10 
4 -30 -20 -10 10 
4 -100 -80 -60 -30 
0
stdout
copy 
450
2100
26
23
-30
https://ideone.com/irmtrP
language:
Java (HotSpot 12)
created:
10 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!