Update Precomp.mdx [java code]

Author: enplasmatic

content/2_Bronze/Precomp.mdx

@@ -168,54 +168,54 @@ int main() {
 
 
 ```java
-import java.io.*;
 import java.util.*;
 
-
-public class Gymnastics {
-    public static void main(String[] args) throws IOException {
-        BufferedReader br = new BufferedReader(new FileReader("gymnastics.in"));
-        PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("gymnastics.out")));
-       
-        String[] input_data = br.readLine().split(" ");
-        int K = Integer.parseInt(input_data[0]);
-        int N = Integer.parseInt(input_data[1]);
-       
-        int[][] positions = new int[K][N + 1];
-       
+public class Main {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        String inputData = scanner.useDelimiter("\\A").next();
+        String[] data = inputData.split("\\s+");
+        
+        int K = Integer.parseInt(data[0]);
+        int N = Integer.parseInt(data[1]);
+        int index = 2;
+
+        List<int[]> positions = new ArrayList<>();
         for (int i = 0; i < K; i++) {
-            String[] ranking = br.readLine().split(" ");
+            int[] ranking = new int[N];
+            for (int j = 0; j < N; j++) {
+                ranking[j] = Integer.parseInt(data[index++]);
+            }
+
+            // Precompute positions of each cow
+            int[] pos = new int[N + 1];
             for (int rank = 0; rank < N; rank++) {
-                int cow = Integer.parseInt(ranking[rank]);
-                positions[i][cow] = rank;
+                pos[ranking[rank]] = rank;
             }
+            positions.add(pos);
         }
-       
-        int consistent_pairs = 0;
 
+        int consistentPairs = 0;
 
         for (int i = 1; i <= N; i++) {
             for (int j = i + 1; j <= N; j++) {
-                boolean i_before_j = true;
-                boolean j_before_i = true;
+                boolean iBeforeJ = true;
+                boolean jBeforeI = true;
                 for (int s = 0; s < K; s++) {
-                    if (positions[s][i] > positions[s][j]) {
-                        i_before_j = false;
+                    if (positions.get(s)[i] > positions.get(s)[j]) {
+                        iBeforeJ = false;
                     }
-                    if (positions[s][j] > positions[s][i]) {
-                        j_before_i = false;
+                    if (positions.get(s)[j] > positions.get(s)[i]) {
+                        jBeforeI = false;
                     }
                 }
-                if (i_before_j || j_before_i) {
-                    consistent_pairs++;
+                if (iBeforeJ || jBeforeI) {
+                    consistentPairs++;
                 }
             }
         }
 
-
-        pw.println(consistent_pairs);
-        br.close();
-        pw.close();
+        System.out.println(consistentPairs);
     }
 }