Source code for submission s1011

Go to diff to previous submission

Fm.java

  1. /*
  2.  * CTU Open 2013
  3.  * HES
  4.  */
  5. package template;
  6.  
  7. import java.io.BufferedReader;
  8. import java.io.InputStreamReader;
  9. import java.util.StringTokenizer;
  10.  
  11. /**
  12.  *
  13.  * @author cteam007
  14.  */
  15. public class Fm {
  16.  
  19.  
  20.     void useLine(String s) {
  21.         st = new StringTokenizer(s);
  22.     }
  23.  
  24.     String nextToken() throws Exception {
  25.         while (!st.hasMoreTokens()) {
  26.             st = new StringTokenizer(input.readLine());
  27.         }
  28.         return st.nextToken();
  29.     }
  30.  
  31.     int nextInt() throws Exception {
  32.         return Integer.parseInt(nextToken());
  33.     }
  34.  
  35.     /**
  36.      * @param args the command line arguments
  37.      */
  38.     public static void main(String[] args) throws Exception {
  39.         Fm instance = new Fm();
  40.         while (instance.run()) {
  41.         }
  42.     }
  43.  
  44.     boolean run() throws Exception {
  45.         String in = input.readLine();
  46.         if (in == null) {
  47.             return false;
  48.         }
  49.  
  50.         useLine(in);
  51.  
  52.         int rows = nextInt();
  53.         int cols = nextInt();
  54.  
  55.         int tileRows = nextInt();
  56.         int tileCols = nextInt();
  57.  
  58.         /*
  59.         int colsapper = Math.max(cols, tileCols);
  60.         int rowsapper = Math.max(rows, tileRows);
  61.          */
  62.  
  63.         String[] map = new String[rows]; //+ rowsapper + rowsapper + tileRows];
  64.  
  65.         /*
  66.         String rowAddon = "";
  67.         String colAddon = "";
  68.         String rowAddon2 = "";
  69.         for (int ra = 0; ra < colsapper; ra++) {
  70.         rowAddon += ".";
  71.         }
  72.         for (int ra = 0; ra < tileRows; ra++) {
  73.         rowAddon2 += ".";
  74.         }
  75.         for (int ra = 0; ra < colsapper + colsapper + cols + tileCols; ra++) {
  76.         colAddon += ".";
  77.         }
  78.         for (int i = 0; i < rowsapper; i++) {
  79.         map[i] = colAddon;
  80.         }
  81.         for (int i = rowsapper; i < rowsapper + rows; i++) {
  82.         map[i] = rowAddon + nextToken() + rowAddon;
  83.         }
  84.         for (int i = rowsapper + rows; i < rows + rowsapper + rowsapper; i++) {
  85.         map[i] = colAddon;
  86.         }*/
  87.  
  88.         for (int i = 0; i < rows; i++) {
  89.             map[i] = nextToken();
  90.         }
  91.  
  92.         /*
  93.         System.out.println("");
  94.         for(int i = 0; i < rows*3 ; i++){
  95.         System.out.println(map[i]);
  96.         }   
  97.         System.out.println("");
  98.          * */
  99.  
  100.         TileStructure ts = new TileStructure(rows, cols, tileRows, tileCols, map);
  101.  
  102.         int min = Integer.MAX_VALUE;
  103.  
  104.         for (int i = 0; i < tileRows; i++) {
  105.             for (int j = 0; j < tileCols; j++) {
  106.                 //System.out.println("Iteration[" + (-i) + "," + (-j) + "]");
  107.                 min = Math.min(min, ts.getNumber(-i, -j));
  108.             }
  109.         }
  110.  
  111.         System.out.println(min);
  112.  
  113.         return true;
  114.     }
  115. }
  116.  
  117. class TileStructure {
  118.  
  119.     int tilesH;
  120.     int tilesW;
  121.     int tileRows;
  122.     int tileCols;
  123.     String[] map;
  124.  
  125.     public TileStructure(int rows, int cols, int tileRows, int tileCols, String[] map) {
  126.         tilesH = rows / tileRows + ((rows % tileRows == 0) ? (0) : (1)) + 1;
  127.         tilesW = cols / tileCols + ((cols % tileCols == 0) ? (0) : (1)) + 1;
  128.  
  129.         this.tileCols = tileCols;
  130.         this.tileRows = tileRows;
  131.         this.map = map;
  132.     }
  133.  
  134.     public int getNumber(int xOffset, int yOffset) {
  135.         int count = 0;
  136.  
  137.         for (int h = 0; h < tilesH; h++) {
  138.             for (int w = 0; w < tilesW; w++) {
  139.                 boolean hasX = false;
  140.                 for (int ht = h * tileRows; ht < h * tileRows + tileRows && !hasX; ht++) {
  141.                     for (int wt = w * tileCols; wt < w * tileCols + tileCols && !hasX; wt++) {
  142.                         //System.out.print("T[" + h + "," + w + "]-[" + (ht+rows) + "," + (wt+cols) + "] = ");
  143.                         if((ht + xOffset >= 0) && (ht + xOffset < map.length) && (wt + yOffset >= 0) && (wt + yOffset < map[0].length())){
  144.                             if (map[ht + xOffset].charAt(wt + yOffset) == 'X') {
  145.                                 hasX = true;
  146.                             }
  147.                         }
  148.                     //System.out.println("X");
  149.                     //}else{
  150.                     //System.out.println(".");
  151.                     //}
  152.                     }
  153.                 }
  154.                 if (hasX) {
  155.                     count++;
  156.                 }
  157.             }
  158.         }
  159.  
  160.         return count;
  161.     }
  162. }
  163.  

Diff to submission s936

Fm.java

--- c5.s936.cteam007.fm.java.0.Fm.java
+++ c5.s1011.cteam007.fm.java.0.Fm.java
@@ -56,50 +56,59 @@
         int tileCols = nextInt();
 
-        String[] map = new String[rows * 3];
+        /*
+        int colsapper = Math.max(cols, tileCols);
+        int rowsapper = Math.max(rows, tileRows);
+         */
 
+        String[] map = new String[rows]; //+ rowsapper + rowsapper + tileRows];
+
+        /*
         String rowAddon = "";
         String colAddon = "";
-
-        for (int ra = 0; ra < cols; ra++) {
-            rowAddon += ".";
+        String rowAddon2 = "";
+        for (int ra = 0; ra < colsapper; ra++) {
+        rowAddon += ".";
         }
-
-        for (int ra = 0; ra < cols * 3; ra++) {
-            colAddon += ".";
+        for (int ra = 0; ra < tileRows; ra++) {
+        rowAddon2 += ".";
         }
+        for (int ra = 0; ra < colsapper + colsapper + cols + tileCols; ra++) {
+        colAddon += ".";
+        }
+        for (int i = 0; i < rowsapper; i++) {
+        map[i] = colAddon;
+        }
+        for (int i = rowsapper; i < rowsapper + rows; i++) {
+        map[i] = rowAddon + nextToken() + rowAddon;
+        }
+        for (int i = rowsapper + rows; i < rows + rowsapper + rowsapper; i++) {
+        map[i] = colAddon;
+        }*/
 
         for (int i = 0; i < rows; i++) {
-            map[i] = colAddon;
+            map[i] = nextToken();
         }
 
-        for (int i = rows; i < rows * 2; i++) {
-            map[i] = rowAddon + nextToken() + rowAddon;
-        }
-        
-        for (int i = rows*2; i < rows*3; i++) {
-            map[i] = colAddon;
-        }
-        
         /*
         System.out.println("");
         for(int i = 0; i < rows*3 ; i++){
-            System.out.println(map[i]);
+        System.out.println(map[i]);
         }   
         System.out.println("");
          * */
-        
+
         TileStructure ts = new TileStructure(rows, cols, tileRows, tileCols, map);
 
         int min = Integer.MAX_VALUE;
-                
+
         for (int i = 0; i < tileRows; i++) {
             for (int j = 0; j < tileCols; j++) {
                 //System.out.println("Iteration[" + (-i) + "," + (-j) + "]");
-                min = Math.min(min,ts.getNumber(-i, -j));
+                min = Math.min(min, ts.getNumber(-i, -j));
             }
         }
 
         System.out.println(min);
-        
+
         return true;
     }
@@ -112,6 +121,4 @@
     int tileRows;
     int tileCols;
-    int cols;
-    int rows;
     String[] map;
 
@@ -123,7 +130,4 @@
         this.tileRows = tileRows;
         this.map = map;
-        
-        this.cols = cols;
-        this.rows = rows;
     }
 
@@ -137,11 +141,13 @@
                     for (int wt = w * tileCols; wt < w * tileCols + tileCols && !hasX; wt++) {
                         //System.out.print("T[" + h + "," + w + "]-[" + (ht+rows) + "," + (wt+cols) + "] = ");
-                        if (map[ht+rows+xOffset].charAt(wt+cols+yOffset) == 'X') {
-                            hasX = true;
+                        if((ht + xOffset >= 0) && (ht + xOffset < map.length) && (wt + yOffset >= 0) && (wt + yOffset < map[0].length())){
+                            if (map[ht + xOffset].charAt(wt + yOffset) == 'X') {
+                                hasX = true;
+                            }
                         }
-                            //System.out.println("X");
-                        //}else{
-                            //System.out.println(".");
-                        //}
+                    //System.out.println("X");
+                    //}else{
+                    //System.out.println(".");
+                    //}
                     }
                 }