Ural 1119 Metro

题意：在m*n的地图上，有n个点有斜向的路径，已知这些斜向路径的位置，求从(0,0)到(m,n)的最短路径

链接：http://acm.timus.ru/problem.aspx?space=1&num=1119

思路：简单dp，无斜向路径即路径长为无穷大，转移三个方向的最短距离，dp[i][j] = min ( dp[i-1][j], dp[i][j-1], dp[i-1][j-1] + mark[i][j] ? 100 : 1000000 );

注意点：无

以下为AC代码：

ID	Date	Author	Problem	Language	Judgement result	Test #	Execution time	Memory used
6242775	19:29:01 10 May 2015	luminous11	1119. Metro	G++ 4.9 C++11	Accepted		0.031	9 314 KB

/* 
***********************************************
*# @Author  : Luminous11 (573728051@qq.com)
*# @Date    : 2015-05-10 21:12:12
*# @Link    : http://blog.csdn.net/luminous11
*********************************************** 
*/

#include <bits/stdc++.h>
#define clr(a, v) memset( a , v , sizeof(a) )
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1.0);
const double dis = sqrt ( 2.0 ) * 100.0;
bool vis[1005][1005];
double dp[1005][1005];
int main()
{
    ios::sync_with_stdio ( false );
    int n, m;
    while ( scanf ( "%d%d", &n, &m ) != EOF ){
        int k;
        memset ( vis, 0, sizeof ( vis ) );
        memset ( dp, 0, sizeof ( dp ) );
        scanf ( "%d", &k );
        for ( int i = 0; i < k; i ++ ){
            int x, y;
            scanf ( "%d%d", &x, &y );
            vis[x][y] = 1;
        }
        for ( int i = 0; i <= n; i ++ ){
            for ( int j = 0; j <= m; j ++ ){
                if ( i == 0 && j == 0 )continue;
                if ( i == 0 )dp[i][j] = dp[i][j-1] + 100.0;
                if ( j == 0 )dp[i][j] = dp[i-1][j] + 100.0;
                if ( i == 0 || j == 0 )continue;
                if ( vis[i][j] ){
                    dp[i][j] = min ( dp[i-1][j-1] + dis, min ( dp[i-1][j], dp[i][j-1] ) + 100.0 );
                }
                else{
                    dp[i][j] = min ( dp[i-1][j], dp[i][j-1] ) + 100.0;
                }
            }
        }

        // Debug
        // for ( int i = 0; i <= n; i ++ ){
        //     for ( int j = 0; j <= m; j ++ ){
        //         printf ( "%d\t", dp[i][j] );
        //     }
        //     puts ( "" );
        // }
        printf ( "%0.0f\n", dp[n][m] );
    }
    return 0;
}