Timus 1119. Metro

原题：Metro

题意：给出N*M网格，其中一些对角点有边相连，问从(0,0)到(N,M)的最短路径为多长

解法：记忆化搜索，记录到每一个点的最短距离

#include <iostream>
using namespace std;
#include <stdlib.h>
#include <math.h>
#include <stdio.h>

double a[1005][1005];
int n, m, k;
bool flag[1005][1005] = {0};

int main() {


    scanf("%d %d %d", &n, &m, &k);
    for (int i = 1; i <= k; i++) {
        int x, y;
        cin >> x >> y;
        flag[x][y] = true;
    }
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++) a[i][j] = -1;
    a[0][0] = 0;
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++) {
            if (i == 0 && j == 0) continue;
            if (i-1 >= 0) {
                if (a[i][j] == -1 || a[i][j] > a[i-1][j]+100)
                    a[i][j] = a[i-1][j]+100;
            }
            if (j-1 >= 0) {
                if (a[i][j] == -1 || a[i][j] > a[i][j-1]+100)
                    a[i][j] = a[i][j-1]+100;
            }
            if (flag[i][j]) {
                if (a[i][j] == -1 || a[i][j] > a[i-1][j-1]+100*sqrt(2)) {
                    a[i][j] = a[i-1][j-1]+100*sqrt(2);
                }
            }
        }
    printf("%.0lf", a[n][m]);

}