blob: 884a8b04872398933b0ac2214c1c3aed6042b883 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
#include <stdio.h>
#define N 1000
typedef enum { EAST, SOUTH, WEST, NORTH } direction_t;
int main() {
char map[N][N];
int i, j, k, n, s;
direction_t dir;
for (n = 0; fgets(map[n], N, stdin) != NULL; n++) ;
for (i = 0; i < n; i++)
for (j = 0; map[i][j]; j++)
if (map[i][j] == 'S')
goto found_s;
found_s:
if (map[i][j+1] == '7' || map[i][j+1] == '-' || map[i][j+1] == 'J') {
j++;
dir = EAST;
goto found_direction;
}
if (map[i+1][j] == 'L' || map[i+1][j] == '|' || map[i+1][j] == 'J') {
i++;
dir = SOUTH;
goto found_direction;
}
if (j > 0 && (map[i][j-1] == 'L' || map[i][j-1] == '-' || map[i][j-1] == 'F')) {
j--;
dir = WEST;
goto found_direction;
}
found_direction:
for (k = 1; map[i][j] != 'S'; k++) {
switch (map[i][j]) {
case '|':
if (dir == SOUTH) i++;
if (dir == NORTH) i--;
break;
case '-':
if (dir == EAST) j++;
if (dir == WEST) j--;
break;
case '7':
if (dir == EAST) { i++; dir = SOUTH; }
if (dir == NORTH) { j--; dir = WEST; }
break;
case 'F':
if (dir == WEST) { i++; dir = SOUTH; }
if (dir == NORTH) { j++; dir = EAST; }
break;
case 'J':
if (dir == EAST) { i--; dir = NORTH; }
if (dir == SOUTH) { j--; dir = WEST; }
break;
case 'L':
if (dir == WEST) { i--; dir = NORTH; }
if (dir == SOUTH) { j++; dir = EAST; }
break;
default:
printf("Error: dead path\n");
return 1;
}
}
s = (k+1)/2;
printf("%d\n", s);
return 0;
}
|
