Acdream 1191 Dragon Maze bfs

Dragon Maze

Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)

Submit Statistic Next Problem

Problem Description

You are the prince of Dragon Kingdom and your kingdom is in danger of running out of power. You must find power to save your kingdom and its people. An old legend states that power comes from a place known as Dragon Maze. Dragon Maze appears randomly out of nowhere without notice and suddenly disappears without warning. You know where Dragon Maze is now, so it is important you retrieve some power before it disappears.

Dragon Maze is a rectangular maze, an N×M grid of cells. The top left corner cell of the maze is (0, 0) and the bottom right corner is(N-1, M-1). Each cell making up the maze can be either a dangerous place which you never escape after entering, or a safe place that contains a certain amount of power. The power in a safe cell is automatically gathered once you enter that cell, and can only be gathered once. Starting from a cell, you can walk up/down/left/right to adjacent cells with a single step.

Now you know where the entrance and exit cells are, that they are different, and that they are both safe cells. In order to get out of Dragon Maze before it disappears, you must walk from the entrance cell to the exit cell taking as few steps as possible.

If there are multiple choices for the path you could take, you must choose the one on which you collect as much power as possible in order to save your kingdom.

Input

The first line of the input gives the number of test cases, T(1 ≤ T ≤ 30). T test cases follow.

Each test case starts with a line containing two integers N and M(1 ≤ N, M ≤ 100), which give the size of Dragon Maze as described above.

The second line of each test case contains four integers enx, eny, exx, exy(0 ≤ enx, exx < N, 0 ≤ eny, exy < M), describing the position of entrance cell (enx, eny) and exit cell (exx, exy).

Then N lines follow and each line has M numbers, separated by spaces, describing the N×M cells of Dragon Maze from top to bottom.

Each number for a cell is either -1, which indicates a cell is dangerous, or a positive integer, which indicates a safe cell containing a certain amount of power.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1).

If it's possible for you to walk from the entrance to the exit, y should be the maximum total amount of power you can collect by taking the fewest steps possible.

If you cannot walk from the entrance to the exit, y should be the string "Mission Impossible." (quotes for clarity).

Sample Input

2
2 3
0 2 1 0
2 -1 5
3 -1 6
4 4
0 2 3 2
-1 1 1 2
1 1 1 1
2 -1 -1 1
1 1 1 1

Sample Output

Case #1: Mission Impossible.
Case #2: 7

Source

codejam

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
 
using namespace std;
 
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define DWN(i,h,l) for(int i=(h);i>=(l);--i)
#define CLR(vis,pos) memset(vis,pos,sizeof(vis))
#define PI acos(-1.0)
#define INF 0x7FFFFFFF
#define LINF 1000000000000000000LL
#define eps 1e-8
 
typedef long long ll;
 
int dx[4]={-1,1,0,0};
int dy[4]={0,0,1,-1};
 
int n,m;
int a[123][123];
pair<int,int> x,y;
int ans;
int vis[123][123];
int step[123][123],val[123][123];
struct node{
    int x,y;
};
 
int bfs(int i,int j){
    if(a[i][j]==-1) return -1;
    node tmp;
    tmp.x=i,tmp.y=j;
    queue<node> q;
    q.push(tmp);
    step[tmp.x][tmp.y]=1;
    val[tmp.x][tmp.y]=a[tmp.x][tmp.y];
    while(!q.empty()){
        tmp=q.front();
        q.pop();
        vis[tmp.x][tmp.y]=1;
        node p;
        REP(k,4){
            p.x=tmp.x+dx[k];
            p.y=tmp.y+dy[k];
            if( (step[p.x][p.y]<0 || step[p.x][p.y]>=step[tmp.x][tmp.y]+1) && a[p.x][p.y]!=-1 && !vis[p.x][p.y]){
                if(step[p.x][p.y]<0)
                    q.push(p);
                step[p.x][p.y]=step[tmp.x][tmp.y]+1;
                val[p.x][p.y]=max(val[p.x][p.y],a[p.x][p.y]+val[tmp.x][tmp.y]);
            }
        }
    }
    return val[y.first][y.second];
}
 
 
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    scanf("%d",&T);
    REP(cas,T){
        scanf("%d%d",&n,&m);
        scanf("%d%d%d%d",&x.first,&x.second,&y.first,&y.second);
        x.first++,x.second++,y.first++,y.second++;
        CLR(a,-1);
        FOR(i,1,n){
            FOR(j,1,m){
                scanf("%d",&a[i][j]);
            }
        }
        CLR(vis,0),CLR(val,-1),CLR(step,-1);
        ans=bfs(x.first,x.second);
        if(ans==-1){
            printf("Case #%d: Mission Impossible.\n",cas+1);
        }
        else{
            printf("Case #%d: %d\n",cas+1,ans);
        }
 
    }
    return 0;
}