最短路-1011

首先建图，给出的2n+1行字符串一行横着一行竖着，建好图直接dij

#include<stdio.h>
#include<iostream>
using namespace std;
int map[450][450];
int a[450],v[450];
int n,m;
int poit;
void buildMap()
{
    int a;
    char b;
    for(int i=0; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            cin>>a>>b;
            //printf("%d %c\n",a,b);
            if(a==0)
            continue;
            if(b=='*')
                map[i*(m+1)+j][i*(m+1)+j+1]=map[i*(m+1)+j+1][i*(m+1)+j]=2520/a;
            else if(b=='<')
                map[i*(m+1)+j+1][i*(m+1)+j]=2520/a;
            else if(b=='>')
                map[i*(m+1)+j][i*(m+1)+j+1]=2520/a;
        }
        if(i!=n)
            for(int j=0; j<=m; j++)
            {
                cin>>a>>b;
                //printf("%d %c\n",a,b);
                if(a==0)
                continue;
                if(b=='*')
                    map[i*(m+1)+j+1][(i+1)*(m+1)+j+1]=map[(i+1)*(m+1)+j+1][i*(m+1)+j+1]=2520/a;
                else if(b=='^')
                    map[(i+1)*(m+1)+j+1][i*(m+1)+j+1]=2520/a;
                else if(b=='v')
                    map[i*(m+1)+j+1][(i+1)*(m+1)+j+1]=2520/a;
            }
    }
}
void dij()
{
    int min,min_f,i,j;
    for(i=1; i<=poit; i++)
    {
        a[i]=map[1][i];
        v[i]=0;
    }
    v[1]=1;
    for(i=1; i<poit; i++)
    {
        min=100000000;
        min_f=0;
        for(j=1; j<=poit; j++)
        {
            if(!v[j]&&min>=a[j])
            {
                min=a[j];
                min_f=j;
            }
        }
        v[min_f]=1;
        for(j=1; j<=poit; j++)
        {
            if(!v[j]&&a[j]>a[min_f]+map[min_f][j])
                a[j]=a[min_f]+map[min_f][j];
        }
    }
    if(a[poit]==100000000)
        printf("Holiday\n");
    else
    printf("%d blips\n",a[poit]);
}
int main()
{
    while(scanf("%d%d",&n,&m)&&n!=0&&m!=0)
    {
        poit=(n+1)*(m+1);
        for(int i=1;i<=poit;i++)
        {
            map[i][i]=0;
            for(int j=i+1;j<=poit;j++)
                map[i][j]=map[j][i]=100000000;
        }
        buildMap();
        dij();
    }
    return 0;
}