Source code for submission s1051

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.         boolean xFound = false;
  89.         for (int i = 0; i < rows; i++) {
  90.             map[i] = nextToken();
  91.  
  92.             if(!xFound){
  93.                 xFound = map[i].indexOf("X") != -1;
  94.             }
  95.         }
  96.  
  97.         if(!xFound){
  98.             System.out.println("0");
  99.             return true;
  100.         }
  101.  
  102.         if(tileRows >= rows && tileCols >= cols){
  103.             System.out.println("1");
  104.             return true;
  105.         }
  106.  
  107.         /*
  108.         System.out.println("");
  109.         for(int i = 0; i < rows*3 ; i++){
  110.         System.out.println(map[i]);
  111.         }   
  112.         System.out.println("");
  113.          * */
  114.  
  115.         TileStructure ts = new TileStructure(rows, cols, tileRows, tileCols, map);
  116.  
  117.         int min = Integer.MAX_VALUE;
  118.  
  119.         for (int i = 0; i < ((tileRows >= rows)?(1):(tileRows)); i++) {
  120.             for (int j = 0; j < ((tileCols >= cols)?(1):(tileCols)); j++) {
  121.                 //System.out.println("Iteration[" + (-i) + "," + (-j) + "]");
  122.                 min = Math.min(min, ts.getNumber(-i, -j));
  123.             }
  124.         }
  125.  
  126.         System.out.println(min);
  127.  
  128.         return true;
  129.     }
  130. }
  131.  
  132. class TileStructure {
  133.  
  134.     int tilesH;
  135.     int tilesW;
  136.     int tileRows;
  137.     int tileCols;
  138.     String[] map;
  139.  
  140.     public TileStructure(int rows, int cols, int tileRows, int tileCols, String[] map) {
  141.         tilesH = rows / tileRows + ((rows % tileRows == 0) ? (0) : (1)) + 1;
  142.         tilesW = cols / tileCols + ((cols % tileCols == 0) ? (0) : (1)) + 1;
  143.  
  144.         this.tileCols = tileCols;
  145.         this.tileRows = tileRows;
  146.         this.map = map;
  147.     }
  148.  
  149.     public int getNumber(int xOffset, int yOffset) {
  150.         int count = 0;
  151.  
  152.         for (int h = 0; h < tilesH; h++) {
  153.             for (int w = 0; w < tilesW; w++) {
  154.                 boolean hasX = false;
  155.                 for (int ht = h * tileRows; ht < h * tileRows + tileRows && !hasX; ht++) {
  156.                     for (int wt = w * tileCols; wt < w * tileCols + tileCols && !hasX; wt++) {
  157.                         //System.out.print("T[" + h + "," + w + "]-[" + (ht+rows) + "," + (wt+cols) + "] = ");
  158.                         if((ht + xOffset >= 0) && (ht + xOffset < map.length) && (wt + yOffset >= 0) && (wt + yOffset < map[0].length())){
  159.                             if (map[ht + xOffset].charAt(wt + yOffset) == 'X') {
  160.                                 hasX = true;
  161.                             }
  162.                         }
  163.                     //System.out.println("X");
  164.                     //}else{
  165.                     //System.out.println(".");
  166.                     //}
  167.                     }
  168.                 }
  169.                 if (hasX) {
  170.                     count++;
  171.                 }
  172.             }
  173.         }
  174.  
  175.         return count;
  176.     }
  177. }
  178.  

Diff to submission s1036

Fm.java

--- c5.s1036.cteam007.fm.java.0.Fm.java
+++ c5.s1051.cteam007.fm.java.0.Fm.java
@@ -117,6 +117,6 @@
         int min = Integer.MAX_VALUE;
 
-        for (int i = 0; i < tileRows; i++) {
-            for (int j = 0; j < tileCols; j++) {
+        for (int i = 0; i < ((tileRows >= rows)?(1):(tileRows)); i++) {
+            for (int j = 0; j < ((tileCols >= cols)?(1):(tileCols)); j++) {
                 //System.out.println("Iteration[" + (-i) + "," + (-j) + "]");
                 min = Math.min(min, ts.getNumber(-i, -j));