Source code for submission s806

Go to diff to previous submission

grasshop.cpp

  1. #include <cstdio>
  2.  
  3. using namespace std;
  4.  
  5. void enqueue(int x, int y, int distance, int queueX[10000], int queueY[10000], int &queueLen, int dist[100][100], int rows, int cols) {
  6. 	if(dist[x][y] != 0) return;
  7. 	if(x < 0 || x >= cols) return;
  8. 	if(y < 0 || y >= rows) return;
  9. 	queueX[queueLen] = x;
  10. 	queueY[queueLen] = y;
  11.  
  12. 	dist[x][y] = distance + 1;
  13. 	++queueLen;
  14. }
  15.  
  16. int main(void) {
  17. 	while(true) {
  18. 		int rows, cols, sx, sy, tx, ty;
  19.  
  20. 		if(scanf("%d%d%d%d%d%d\n", &rows, &cols, &sy, &sx, &ty, &tx) != 6) {
  21. 			break;
  22. 		}
  23.  
  24. 		--sx;
  25. 		--sy;
  26. 		--tx;
  27. 		--ty;
  28.  
  29. 		int dist[100][100];
  30. 		for(int i = 0; i < cols; ++i) {
  31. 			for(int j = 0; j < rows; ++j) {
  32. 				dist[i][j] = 0;
  33. 			}
  34. 		}
  35.  
  36.  
  37. 		int queueX[10000], queueY[10000];
  38. 		int queueLen = 1;
  39. 		int queuePos = 0;
  40.  
  41. 		queueX[0] = sx;
  42. 		queueY[0] = sy;
  43. 		dist[sx][sy] = 1;
  44.  
  45. 		int curX, curY, curDist;
  46.  
  47. 		while(queuePos < queueLen) {
  48. 			curX = queueX[queuePos];
  49. 			curY = queueY[queuePos];
  50. 			curDist = dist[curX][curY];
  51.  
  52. 			if(curX == tx && curY == ty) break;
  53.  
  54. 			enqueue(curX + 2, curY + 1, curDist, queueX, queueY, queueLen, dist, rows, cols);
  55. 			enqueue(curX + 2, curY - 1, curDist, queueX, queueY, queueLen, dist, rows, cols);
  56. 			enqueue(curX + 1, curY + 2, curDist, queueX, queueY, queueLen, dist, rows, cols);
  57. 			enqueue(curX + 1, curY - 2, curDist, queueX, queueY, queueLen, dist, rows, cols);
  58. 			enqueue(curX - 1, curY + 2, curDist, queueX, queueY, queueLen, dist, rows, cols);
  59. 			enqueue(curX - 1, curY - 2, curDist, queueX, queueY, queueLen, dist, rows, cols);
  60. 			enqueue(curX - 2, curY + 1, curDist, queueX, queueY, queueLen, dist, rows, cols);
  61. 			enqueue(curX - 2, curY - 1, curDist, queueX, queueY, queueLen, dist, rows, cols);
  62.  
  63. 			++queuePos;
  64. 		}
  65.  
  66. 		int minDist = dist[tx][ty];
  67.  
  68. 		if(minDist == 0) {
  69. 			printf("impossible\n");
  70. 		}
  71. 		else {
  72. 			printf("%d\n", minDist - 1);
  73. 		}
  74. 	}
  75.  
  76. 	return 0;
  77. }
  78.  

Diff to submission s649

grasshop.cpp

--- c4.s649.cteam025.grasshop.cpp.0.grasshop.cpp
+++ c4.s806.cteam025.grasshop.cpp.0.grasshop.cpp
@@ -1,4 +1,3 @@
 #include <cstdio>
-#include <cstring>
 
 using namespace std;
@@ -10,4 +9,5 @@
         queueX[queueLen] = x;
         queueY[queueLen] = y;
+        
         dist[x][y] = distance + 1;
         ++queueLen;
@@ -18,5 +18,5 @@
                 int rows, cols, sx, sy, tx, ty;
                 
-                if(scanf("%d%d%d%d%d%d\n", &rows, &cols, &sx, &sy, &tx, &ty) != 6) {
+                if(scanf("%d%d%d%d%d%d\n", &rows, &cols, &sy, &sx, &ty, &tx) != 6) {
                         break;
                 }
@@ -73,3 +73,5 @@
                 }
         }
+        
+        return 0;
 }