118

SUBMITTED BY: Guest

DATE: Dec. 25, 2013, 3:03 p.m.

FORMAT: Text only

SIZE: 1.9 kB

Raw Download

HITS: 2068

Report
  1. #include <cstdio>
  3. int maxx, maxy, x, y;
  4. char dir;
  5. bool lost;
  6. char directions[4] = {'N','E','S','W'};
  7. char path[101];
  8. bool grid[51][51];
  10. void walk()
  11. {
  13. for (int i = 0; i < 4; ++i)
  14. if (directions[i] == dir)
  15. {
  16. dir = i;
  17. break;
  18. }
  20. char * str = path;
  21. while (str[0])
  22. {
  23. /*printf("%d %d %c\n", x, y, directions[dir]);*/
  24. switch (str[0])
  25. {
  26. case 'R':
  27. dir = (dir + 1) % 4;
  28. break;
  29. case 'L':
  30. dir = (dir + 3) % 4;
  31. break;
  32. default:
  33. switch (dir)
  34. {
  35. case 0:
  36. if (y == maxy && grid[x][y])
  37. break;
  38. else if (y == maxy)
  39. {
  40. lost = true;
  41. grid[x][y] = true;
  42. return;
  43. }
  44. ++y;
  45. break;
  46. case 1:
  47. if (x == maxx && grid[x][y])
  48. break;
  49. else if (x == maxx)
  50. {
  51. lost = true;
  52. grid[x][y] = true;
  53. return;
  54. }
  55. ++x;
  56. break;
  57. case 2:
  58. if (y == 0 && grid[x][y])
  59. break;
  60. else if (y == 0)
  61. {
  62. lost = true;
  63. grid[x][y] = true;
  64. return;
  65. }
  66. --y;
  67. break;
  68. default:
  69. if (x == 0 && grid[x][y])
  70. break;
  71. else if (x == 0)
  72. {
  73. lost = true;
  74. grid[x][y] = true;
  75. return;
  76. }
  77. --x;
  78. }
  79. }
  80. ++str;
  81. }
  82. }
  84. int main()
  85. {
  87. // create grid
  88. scanf("%d %d", &maxx, &maxy);
  89. for (int i = 0; i < 51; ++i)
  90. for (int j = 0; j < 51; ++j)
  91. grid[i][j] = false;
  93. while (scanf("%d %d %c", &x, &y, &dir) == 3)
  94. {
  95. scanf("%s", path);
  96. lost = false;
  97. walk();
  98. printf("%d %d %c", x, y, directions[dir]);
  99. if (lost)
  100. printf(" LOST");
  101. printf("\n");
  102. }
  104. return 0;
  105. }
comments powered by Disqus