[最短路]uva 12295 Optimal Symmetric Paths

/**
uva 12295 Optimal Symmetric Paths__DP 
正解，最短路
*/
#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

#define N 1005
#define INF 1000000000LL
#define MOD 1000000009LL

struct node
{
    int d,x,y;
    node(int a = 0,int b = 0,int c = 0)
    {
        x = a;
        y = b;
        d = c;
    }
};
bool operator<(node a,node b)
{
    return a.d > b.d;
}

#define MK node
__int64 d[N][N],ds[N][N];

int n,mat[N][N];
bool vis[N][N];
node p,pt;
int move[][2]= {0,1,1,0,0,-1,-1,0};
int ok(int x,int y)
{
    return x >= 0 && x < n && y >= 0 && y < n && x >= y ;
}
void dij()
{
    int i,j;
    for(i = 0; i < n; +