0
Your rating: None
CodeChef submission 59580 (JAVA) 

CodeChef submission 59580 (JAVA) plaintext list. Status: RE, problem PAIRSUM, contest . By triplem (Stephen Merriman), 2009-07-26 05:18:38.
  1. import java.io.IOException;
  2. import java.util.*;
  3.  
  4. public class Main {
  5.  
  6. 	public int array_Size = 0;
  7. 	public int [] number_array;
  8.  
  9.  
  10. 	public void computeGoodArray() {
  11.  
  12. 		Hashtable<Integer, List> pairMap = new Hashtable<Integer, List>();
  13. 		Hashtable<Integer, List> pairMapFirstIndex = new Hashtable<Integer, List>();
  14. 		List<Integer> pairList = new ArrayList<Integer>();
  15.  
  16. 		int maxSet = 0;
  17. 		int lastPairSum = -999;
  18.  
  19. 		Arrays.sort(number_array);
  20.  
  21. 		for (int i=0; i < this.array_Size - 1; i++) {
  22. 			for (int j=i+1; j < this.array_Size; j++) {
  23.  
  24. 				int pairSum = number_array[i] + number_array[j];
  25.  
  26. 				List<Integer> firstIndexList = new ArrayList<Integer>();
  27. 				List<Integer> secondIndexList = new ArrayList<Integer>();
  28.  
  29.  
  30. 				if (!pairList.contains(pairSum)) {
  31. 					pairList.add(pairSum);
  32.  
  33. 					firstIndexList.add(i);
  34. 					secondIndexList.add(j);
  35.  
  36. 					pairMap.put(pairSum, secondIndexList);
  37. 					pairMapFirstIndex.put(pairSum, firstIndexList);
  38.  
  39. 				} else {
  40.  
  41. 					firstIndexList = (ArrayList) pairMapFirstIndex.get(pairSum);
  42. 					secondIndexList = (ArrayList) pairMap.get(pairSum);
  43.  
  44. 					if (!secondIndexList.contains(j)
  45. 							&& !firstIndexList.contains(i)) {
  46. 						firstIndexList.add(i);
  47. 						secondIndexList.add(j);
  48.  
  49. 						List intersection = new ArrayList<Integer>(
  50. 								firstIndexList);
  51. 						intersection.retainAll(secondIndexList);
  52.  
  53. 						if (intersection.size() == 0) {
  54. 							pairMap.put(pairSum, secondIndexList);
  55. 							pairMapFirstIndex.put(pairSum, firstIndexList);
  56.  
  57. 						} else {
  58. 							firstIndexList.remove(Integer.valueOf(i));
  59. 							secondIndexList.remove(Integer.valueOf(j));
  60. 						}
  61. 					}
  62.  
  63. 				}
  64. 				lastPairSum = pairSum;
  65.  
  66.  
  67. 			}
  68. 			lastPairSum = -999;
  69. 		}
  70.  
  71. 		Iterator<Integer> itr = pairList.iterator();
  72.  
  73. 		while (itr.hasNext()) {
  74. 			List<Integer> pairsVal = (ArrayList<Integer>)pairMap.get((Integer)itr.next());
  75. 			if ( pairsVal.size() > maxSet) {
  76. 				maxSet = pairsVal.size();
  77. 			}
  78. 		}
  79.  
  80. 		System.out.println(Integer.valueOf(maxSet*2));
  81. 	}
  82.  
  83. 	public static void main(String [] args){
  84. 		Main obj = new Main();
  85.  
  86. 		String input = "";
  87. 		String [] numbers = null;
  88.  
  89. 		java.io.BufferedReader r = new java.io.BufferedReader(new java.io.InputStreamReader (System.in));
  90.  
  91. 		try{
  92. 			obj.array_Size = Integer.parseInt(r.readLine().trim());
  93.  
  94.  
  95. 			obj.number_array = new int[obj.array_Size];
  96. 			input = r.readLine().trim();
  97. 			while (input.trim().length()==0) input = r.readLine();
  98. 			numbers = input.split(" ");
  99.  
  100. 			for (int i=0; i < obj.array_Size; i++) {
  101. 				obj.number_array[i] = Integer.parseInt(numbers[i]);
  102. 			}
  103.  
  104. 		}catch (IOException e)  {
  105. 			e.printStackTrace();
  106. 		}
  107.  
  108. 		obj.computeGoodArray();
  109. 		System.exit(0);
  110. 	}
  111. }

Comments