Source code for submission s1048

Go to diff to previous submission

Grasshop.java

  1.  
  2. import java.io.BufferedReader;
  3. import java.io.IOException;
  4. import java.io.InputStreamReader;
  5.  
  6. /*
  7.  * To change this template, choose Tools | Templates and open the template in
  8.  * the editor.
  9.  */
  10. /**
  11.  *
  12.  * @author cteam066
  13.  */
  14. public class Grasshop {
  15.  
  16.     public static boolean inGrid(int[][] grid, int col, int row) {
  17.         return (col >= 0 && col < grid[0].length && row >= 0 && row < grid.length);
  18.     }
  19.  
  20.     public static int markNext(int[][] grid, int col, int row, int hops) {
  21.  
  22.         int count = 0;
  23.         int[] dx = new int[]{1, 2, 2, 1, -1, -2, -2, -1};
  24.         int[] dy = new int[]{-2, -1, 1, 2, 2, 1, -1, -2};
  25.  
  26.         for (int i = 0; i < 8; i++) {
  27.             int col1 = col + dy[i];
  28.             int row1 = row + dx[i];
  29.  
  30.             if (inGrid(grid, col1, row1) && (grid[row1][col1] == 0 || grid[row1][col1] == Integer.MAX_VALUE)) {
  31.                 count++;
  32.                 grid[row1][col1] = hops;
  33.             }
  34.         }
  35.         return count;
  36.  
  37.  
  38.  
  39.     }
  40.  
  41.     public static void print(int[][] grid) {
  42.         for (int i = 0; i < grid.length; i++) {
  43.             for (int j = 0; j < grid[0].length; j++) {
  44.  
  45.                 if (grid[i][j] == -1) {
  46.                     System.out.print("*");
  47.                 } else {
  48.  
  49.                     if (grid[i][j] == Integer.MAX_VALUE) {
  50.                         System.out.print("#");
  51.                     } else {
  52.  
  53.                         System.out.print(grid[i][j]);
  54.                     }
  55.                 }
  56.             }
  57.             System.out.println("");
  58.  
  59.         }
  60.         System.out.println("");
  61.     }
  62.  
  63.     /**
  64.      * @param args the command line arguments
  65.      */
  66.     public static void main(String[] args) throws IOException {
  67.  
  69.  
  70.         String inputLine = br.readLine();
  71.  
  72.         while (inputLine != null) {
  73.  
  74.  
  75.             String[] input = inputLine.split(" ");
  76.  
  77.             int rows = Integer.parseInt(input[0]);
  78.             int cols = Integer.parseInt(input[1]);
  79.             int startR = Integer.parseInt(input[2]) - 1;
  80.             int startC = Integer.parseInt(input[3]) - 1;
  81.             int endR = Integer.parseInt(input[4]) - 1;
  82.             int endC = Integer.parseInt(input[5]) - 1;
  83.  
  84.  
  85.             int[][] grid = new int[rows][cols];
  86.             grid[startR][startC] = -1;
  87.             grid[endR][endC] = Integer.MAX_VALUE;
  88.  
  89.  
  90.             if (startR == endR && startC == endC) {
  91.  
  92.                 System.out.println(0);
  93.                 inputLine = br.readLine();
  94.                 continue;
  95.             }
  96.  
  97.             int hops = 1;
  98.             int marks = markNext(grid, startR, startC, hops);
  99.  
  100.             while (grid[endR][endC] == Integer.MAX_VALUE && marks > 0) {
  101.                 //   print(grid);
  102.                 hops++;
  103.                 marks = 0;
  104.  
  105.                 for (int i = 0; i < rows; i++) {
  106.                     for (int j = 0; j < cols; j++) {
  107.  
  108.                         if (grid[i][j] == hops - 1) {
  109.                             marks += markNext(grid, j, i, hops);
  110.                         }
  111.                     }
  112.                 }
  113.             }
  114.  
  115.              //print(grid);
  116.  
  117.             if (marks == 0) {
  118.                 System.out.println("impossible");
  119.             } else {
  120.  
  121.                 System.out.println(grid[endR][endC]);
  122.             }
  123.  
  124.  
  125.  
  126.  
  127.             inputLine = br.readLine();
  128.         }
  129.  
  130.     }
  131. }
  132.  

Diff to submission s989

Grasshop.java

--- c4.s989.cteam095.grasshop.java.0.Grasshop.java
+++ c4.s1048.cteam095.grasshop.java.0.Grasshop.java
@@ -41,5 +41,5 @@
     public static void print(int[][] grid) {
         for (int i = 0; i < grid.length; i++) {
-            for (int j = 0; j < grid.length; j++) {
+            for (int j = 0; j < grid[0].length; j++) {
 
                 if (grid[i][j] == -1) {
@@ -87,19 +87,18 @@
             grid[endR][endC] = Integer.MAX_VALUE;
 
-            
-            if(startR == endR && startC == endC) {
-            
+
+            if (startR == endR && startC == endC) {
+
                 System.out.println(0);
                 inputLine = br.readLine();
                 continue;
             }
-            
+
             int hops = 1;
             int marks = markNext(grid, startR, startC, hops);
 
-
-            hops++;
             while (grid[endR][endC] == Integer.MAX_VALUE && marks > 0) {
-             //   print(grid);
+                //   print(grid);
+                hops++;
                 marks = 0;
 
@@ -108,13 +107,11 @@
 
                         if (grid[i][j] == hops - 1) {
-                            marks += markNext(grid, i, j, hops);
+                            marks += markNext(grid, j, i, hops);
                         }
                     }
                 }
-
-                hops++;
             }
 
-           // print(grid);
+             //print(grid);
 
             if (marks == 0) {