Submission #74420710

Source Code Expand

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
#include <stdio.h>
int H, W, N;
char kukaku[1024][1024];
int pos[10][2];
int mincost[1024][1024];
int gen[1024][1024];
int q[1024 * 1024][2];
int main(void) {
  int i, j;
  int ans = 0;
  if (scanf("%d%d%d", &H, &W, &N) != 3) return 1;
  for (i = 0; i < H; i++) {
    if (scanf("%1023s", kukaku[i]) != 1) return 1;
    for (j = 0; j < W; j++) {
      if (kukaku[i][j] == 'S') {
        pos[0][0] = i;
        pos[0][1] = j;
      } else if ('1' <= kukaku[i][j] && kukaku[i][j] <= '9') {
        int idx = kukaku[i][j] - '0';
        pos[idx][0] = i;
        pos[idx][1] = j;
      }
    }
  }
  for (i = 1; i <= N; i++) {
    int qs = 0, qe = 1;
    q[0][0] = pos[i - 1][0];
    q[0][1] = pos[i - 1][1];
    mincost[q[0][0]][q[0][1]] = 0;
    gen[q[0][0]][q[0][1]] = i;
    while (qs < qe) {
      int cy = q[qs][0];
      int cx = q[qs][1];
      qs++;
      for (j = 0; j < 4; j++) {
        int d = (j & 1) * 2 - 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int H, W, N;
char kukaku[1024][1024];

int pos[10][2];

int mincost[1024][1024];
int gen[1024][1024];

int q[1024 * 1024][2];

int main(void) {
	int i, j;
	int ans = 0;
	if (scanf("%d%d%d", &H, &W, &N) != 3) return 1;
	for (i = 0; i < H; i++) {
		if (scanf("%1023s", kukaku[i]) != 1) return 1;
		for (j = 0; j < W; j++) {
			if (kukaku[i][j] == 'S') {
				pos[0][0] = i;
				pos[0][1] = j;
			} else if ('1' <= kukaku[i][j] && kukaku[i][j] <= '9') {
				int idx = kukaku[i][j] - '0';
				pos[idx][0] = i;
				pos[idx][1] = j;
			}
		}
	}
	for (i = 1; i <= N; i++) {
		int qs = 0, qe = 1;
		q[0][0] = pos[i - 1][0];
		q[0][1] = pos[i - 1][1];
		mincost[q[0][0]][q[0][1]] = 0;
		gen[q[0][0]][q[0][1]] = i;
		while (qs < qe) {
			int cy = q[qs][0];
			int cx = q[qs][1];
			qs++;
			for (j = 0; j < 4; j++) {
				int d = (j & 1) * 2 - 1;
				int ny = cy + (j < 2 ? d : 0);
				int nx = cx + (j < 2 ? 0 : d);
				if (0 <= ny && ny < H && 0 <= nx && nx < W && kukaku[ny][nx] != 'X') {
					if (gen[ny][nx] != i || mincost[cy][cx] + 1 < mincost[ny][nx]) {
						gen[ny][nx] = i;
						mincost[ny][nx] = mincost[cy][cx] + 1;
						q[qe][0] = ny;
						q[qe][1] = nx;
						qe++;
					}
				}
			}
		}
		ans += mincost[pos[i][0]][pos[i][1]];
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result