google java style

Author: hienmv

Java/SearchA2DMatrixII.java renamed to C++/SearchA2DMatrixII.cpp

@@ -1,128 +1,128 @@
-/** https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1541
- * tag: #prim algorithms 
- * run Prim algorithms double times
+/**
+ * https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1541
+ * tag: #prim algorithms run Prim algorithms double times
  */
-
-import java.util.Scanner;
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.PriorityQueue;
+import java.util.Scanner;
 
 class ACMContestBlackout {
-    public static void Prim(ArrayList<ArrayList<Node>> graph, int[] costArr, int[] pathArr, int src) {
-        int sz = graph.size();
-        boolean[] visitedArr = new boolean[sz];
-        Arrays.fill(visitedArr, false);
-        costArr[src] = 0;
-        
-        PriorityQueue<Node> pq = new PriorityQueue<>();
-        Node node;
-        int id, w;
-        pq.add(new Node(src, 0));
-        while (!pq.isEmpty()) {
-            node = pq.poll();
-            id = node.id;
-            visitedArr[id] = true;
-            for (Node neighbour : graph.get(id)) {
-                w = neighbour.cost;
-                if (!visitedArr[neighbour.id] && w < costArr[neighbour.id]) {
-                    costArr[neighbour.id] = w;
-                    pathArr[neighbour.id] = id;
-                    pq.add(new Node(neighbour.id, w));
-                }
-            }
+  public static void Prim(ArrayList<ArrayList<Node>> graph, int[] costArr, int[] pathArr, int src) {
+    int sz = graph.size();
+    boolean[] visitedArr = new boolean[sz];
+    Arrays.fill(visitedArr, false);
+    costArr[src] = 0;
+
+    PriorityQueue<Node> pq = new PriorityQueue<>();
+    Node node;
+    int id, w;
+    pq.add(new Node(src, 0));
+    while (!pq.isEmpty()) {
+      node = pq.poll();
+      id = node.id;
+      visitedArr[id] = true;
+      for (Node neighbour : graph.get(id)) {
+        w = neighbour.cost;
+        if (!visitedArr[neighbour.id] && w < costArr[neighbour.id]) {
+          costArr[neighbour.id] = w;
+          pathArr[neighbour.id] = id;
+          pq.add(new Node(neighbour.id, w));
         }
+      }
     }
+  }
 
-    public static long getCost(int[] costArr) {
-        long ans = 0;
-        for (int cost : costArr) {
-            ans += cost;
-        }
-        return ans;
+  public static long getCost(int[] costArr) {
+    long ans = 0;
+    for (int cost : costArr) {
+      ans += cost;
     }
+    return ans;
+  }
+
+  public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    int testcases = sc.nextInt();
+    int n, m, a, b, c;
+    for (int t = 0; t < testcases; t++) {
+      n = sc.nextInt();
+      m = sc.nextInt();
+      ArrayList<ArrayList<Node>> graph = new ArrayList<>();
+      int sz = n + 1;
+      for (int i = 0; i < sz; i++) {
+        graph.add(new ArrayList<>());
+      }
+      for (int i = 0; i < m; i++) {
+        a = sc.nextInt();
+        b = sc.nextInt();
+        c = sc.nextInt();
+        graph.get(a).add(new Node(b, c));
+        graph.get(b).add(new Node(a, c));
+      }
+
+      // first time
+      int[] costArr1 = new int[sz];
+      int[] pathArr1 = new int[sz];
+      Arrays.fill(pathArr1, -1);
+      Arrays.fill(costArr1, Integer.MAX_VALUE);
+      costArr1[0] = 0;
+      Prim(graph, costArr1, pathArr1, 1);
+      int val1 = (int) getCost(costArr1);
+
+      // second time
+      int cost_tmp = -1;
+      int val2 = Integer.MAX_VALUE;
+      int[] pathArr2 = new int[sz];
+      Arrays.fill(pathArr2, -1);
+      int[] costArr2 = new int[sz];
+      for (int id = 1; id < sz; id++) {
 
-    public static void main(String[] args) {
-        Scanner sc = new Scanner(System.in);
-        int testcases = sc.nextInt();
-        int n, m, a, b, c;
-        for (int t=0; t < testcases; t++) {
-            n = sc.nextInt();
-            m = sc.nextInt();
-            ArrayList<ArrayList<Node>> graph = new ArrayList<>();
-            int sz = n+1;
-            for (int i=0; i < sz; i++) {
-                graph.add(new ArrayList<>());
+        Arrays.fill(costArr2, Integer.MAX_VALUE);
+        costArr2[0] = 0;
+
+        if (pathArr1[id] != -1) {
+          cost_tmp = costArr1[id];
+          for (Node node : graph.get(id)) {
+            if (node.id == pathArr1[id]) {
+              node.cost = Integer.MAX_VALUE;
             }
-            for (int i=0; i < m; i++) {
-                a = sc.nextInt();
-                b = sc.nextInt();
-                c = sc.nextInt();
-                graph.get(a).add(new Node(b, c));
-                graph.get(b).add(new Node(a, c));
+          }
+          for (Node node : graph.get(pathArr1[id])) {
+            if (node.id == id) {
+              node.cost = Integer.MAX_VALUE;
             }
+          }
 
-            // first time
-            int[] costArr1 = new int[sz];
-            int[] pathArr1 = new int[sz];
-            Arrays.fill(pathArr1, -1);
-            Arrays.fill(costArr1, Integer.MAX_VALUE);
-            costArr1[0] = 0;
-            Prim(graph, costArr1, pathArr1, 1);
-            int val1 = (int)getCost(costArr1);
-            
-            // second time
-            int cost_tmp = -1;
-            int val2 = Integer.MAX_VALUE;
-            int[] pathArr2 = new int[sz];
-            Arrays.fill(pathArr2, -1);
-            int[] costArr2 = new int[sz];
-            for (int id = 1; id < sz; id++) {
-               
-                Arrays.fill(costArr2, Integer.MAX_VALUE);
-                costArr2[0] = 0;
-            
-                if (pathArr1[id] != -1) {
-                    cost_tmp = costArr1[id];
-                    for (Node node : graph.get(id)) {
-                        if (node.id == pathArr1[id]) {
-                            node.cost = Integer.MAX_VALUE;
-                        }
-                    }
-                    for (Node node : graph.get(pathArr1[id])) {
-                        if (node.id == id) {
-                            node.cost = Integer.MAX_VALUE;
-                        }
-                    }
+          Prim(graph, costArr2, pathArr2, 1);
+          val2 = (int) Math.min(getCost(costArr2), val2);
 
-                    Prim(graph, costArr2, pathArr2, 1);
-                    val2 = (int)Math.min(getCost(costArr2), val2);
-                    
-                    for (Node node : graph.get(id)) {
-                        if (node.id == pathArr1[id]) {
-                            node.cost = cost_tmp;
-                        }
-                    }
-                    for (Node node : graph.get(pathArr1[id])) {
-                        if (node.id == id) {
-                            node.cost = cost_tmp;
-                        }
-                    }
-                }
+          for (Node node : graph.get(id)) {
+            if (node.id == pathArr1[id]) {
+              node.cost = cost_tmp;
+            }
+          }
+          for (Node node : graph.get(pathArr1[id])) {
+            if (node.id == id) {
+              node.cost = cost_tmp;
             }
-            System.out.println(val1 + " " + val2);
+          }
         }
+      }
+      System.out.println(val1 + " " + val2);
     }
-
+  }
 }
 
 class Node implements Comparable<Node> {
-    int id, cost;
-    public Node(int id, int cost) {
-        this.id = id;
-        this.cost = cost;
-    }
-    public int compareTo(Node other) {
-        return this.cost - other.cost;
-    }
-}
+  int id, cost;
+
+  public Node(int id, int cost) {
+    this.id = id;
+    this.cost = cost;
+  }
+
+  public int compareTo(Node other) {
+    return this.cost - other.cost;
+  }
+}

Java/ACMContestBlackout.java

@@ -1,56 +1,56 @@
-/** https://www.spoj.com/problems/AGGRCOW/
- * tag: #binary-search
- * minimum distance between two position in a range. 
+/**
+ * https://www.spoj.com/problems/AGGRCOW/ tag: #binary-search minimum distance between two position
+ * in a range.
  */
-
-import java.util.Scanner;
 import java.util.Arrays;
+import java.util.Scanner;
 
 class AGGRCOW {
 
-    static int getResult(int[] source, int countPos) {
-        Arrays.sort(source);
-        int startVal = 0;
-        int endVal = source[source.length - 1] - source[0];
-        int ans = 0;
-        int midVal;
-        
-        while (startVal <= endVal) {
-            midVal = startVal + (endVal - startVal) / 2;
-            int prev = source[0];
-            int count = 0;
-            for (int i=1; i < source.length; i++) {
-                if (source[i] - prev >= midVal) {
-                    count++;
-                    prev = source[i];
-                }
-            }
-            if (count >= countPos - 1) {
-                if (midVal > ans) {
-                    ans = midVal;
-                }
-                startVal = midVal + 1;
-            } else {
-                endVal = midVal - 1;
-            }
+  static int getResult(int[] source, int countPos) {
+    Arrays.sort(source);
+    int startVal = 0;
+    int endVal = source[source.length - 1] - source[0];
+    int ans = 0;
+    int midVal;
+
+    while (startVal <= endVal) {
+      midVal = startVal + (endVal - startVal) / 2;
+      int prev = source[0];
+      int count = 0;
+      for (int i = 1; i < source.length; i++) {
+        if (source[i] - prev >= midVal) {
+          count++;
+          prev = source[i];
         }
-        return ans;
-    }
-    public static void main(String[] args) {
-        Scanner sc = new Scanner(System.in);
-        int testcases = sc.nextInt();
-        int n, c;
-        for (int t=0; t < testcases; t++) {
-            n = sc.nextInt();
-            c = sc.nextInt();
-            int[] source = new int[n];
-            int tmp;
-            for (int i=0; i < n; i++) {
-                tmp = sc.nextInt();
-                source[i] = tmp;
-            }
-            int result = getResult(source, c);
-            System.out.println(result);
+      }
+      if (count >= countPos - 1) {
+        if (midVal > ans) {
+          ans = midVal;
         }
+        startVal = midVal + 1;
+      } else {
+        endVal = midVal - 1;
+      }
+    }
+    return ans;
+  }
+
+  public static void main(String[] args) {
+    Scanner sc = new Scanner(System.in);
+    int testcases = sc.nextInt();
+    int n, c;
+    for (int t = 0; t < testcases; t++) {
+      n = sc.nextInt();
+      c = sc.nextInt();
+      int[] source = new int[n];
+      int tmp;
+      for (int i = 0; i < n; i++) {
+        tmp = sc.nextInt();
+        source[i] = tmp;
+      }
+      int result = getResult(source, c);
+      System.out.println(result);
     }
+  }
 }