2015 多校赛 第四场 1009 (hdu 5335)

Problem Description

In an n∗m maze, the right-bottom corner is the exit (position (n,m) is the exit). In every position of this maze, there is either a 0 or a 1 written on it.

An explorer gets lost in this grid. His position now is (1,1), and he wants to go to the exit. Since to arrive at the exit is easy for him, he wants to do something more difficult. At first, he'll write down the number on position (1,1). Every time, he could make a move to one adjacent position (two positions are adjacent if and only if they share an edge). While walking, he will write down the number on the position he's on to the end of his number. When finished, he will get a binary number. Please determine the minimum value of this number in binary system.

 

Input

The first line of the input is a single integer T (T=10), indicating the number of testcases.

For each testcase, the first line contains two integers n and m (1≤n,m≤1000). The i-th line of the next n lines contains one 01 string of length m, which represents i-th row of the maze.

 

Output

For each testcase, print the answer in binary system. Please eliminate all the preceding 0 unless the answer itself is 0 (in this case, print 0 instead).

 

Sample Input

2

2 2

11

11

3 3

001

111

101

 

Sample Output

111

101

题意：给出一幅图，起点在左上角终点在左下角。沿途走过的数字连起来为最后所得的二进制数，设法令该数最小，输出之。

思路：

起点为1的情况，令二进制数长度最小，则每次只往右走或往下走，并且步数相同时走 0 优先。

起点为0的情况，则按着 0 搜到离终点最近的为 1 的点，再按上述的方式走即可。

广搜题，，但 T 到跪。看了标程打了一份。这种 bfs 方式第一次见，确实6，我还是太年轻。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
char g[][];
int n,m,t,head,tail;
#define maxn 1000005
int vis[][],x[maxn],y[maxn];
int dx[]={,-,,},dy[]={,,,-};
string bfs(){
    memset(vis,,sizeof(vis));
    vis[head=][tail=]=;
    x[head]=,y[head++]=;
    while(head!=tail){
        if(g[x[tail]][y[tail]]==''){
            for(int i=;i<;i++){
                int X=x[tail]+dx[i],Y=y[tail]+dy[i];
                if(X>=&&X<n&&Y>=&&Y<m&&!vis[X][Y]){
                    x[head]=X,y[head++]=Y;
                    vis[X][Y]=;
                }
            }
        }
        tail++;
    }
    if(vis[n-][m-]&&g[n-][m-]=='')    return "";
    int sum=;
    string ans="";
    for(int i=;i<n;i++){
        for(int j=;j<m;j++)
            if(vis[i][j]) sum=max(sum,i+j);
    }
    for(int k=sum;k<n+m-;k++){
        char c='';
        for(int i=,j=k-i;i<n;i++,j--) if(j>=&&j<m&&vis[i][j]){
            if(i+<n) c=min(c,g[i+][j]);
            if(j+<m) c=min(c,g[i][j+]);
        }
        ans+=c;
        for(int i=,j=k-i;i<n;i++,j--) if(j>=&&j<m&&vis[i][j]){
            if(i+<n&&g[i+][j]==c) vis[i+][j]=;
            if(j+<m&&g[i][j+]==c) vis[i][j+]=;
        }
    }
    return ans;
}
int main(){
    //freopen("in.txt","r",stdin);
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(int i=;i<n;i++)
            scanf("%s",g[i]);
        cout<<bfs()<<endl;
    }
    return ;
}