pku3009 Curling 2.0 WA了艾。。。最近很不顺阿。。。。。。。。。

/*




Curling 2.0
Time Limit: 1000MS        Memory Limit: 65536K
Total Submissions: 1905        Accepted: 736

Description

On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked. They use only a single stone. The purpose of the game is to lead the stone from the start to the goal with the minimum number of moves.

Fig. 1 shows an example of a game board. Some squares may be occupied with blocks. There are two special squares namely the start and the goal, which are not occupied with blocks. (These two squares are distinct.) Once the stone begins to move, it will proceed until it hits a block. In order to bring the stone to the goal, you may have to stop the stone by hitting it against a block, and throw again.


Fig. 1: Example of board (S: start, G: goal)

The movement of the stone obeys the following rules:

    * At the beginning, the stone stands still at the start square.
    * The movements of the stone are restricted to x and y directions. Diagonal moves are prohibited.
    * When the stone stands still, you can make it moving by throwing it. You may throw it to any direction unless it is blocked immediately(Fig. 2(a)).
    * Once thrown, the stone keeps moving to the same direction until one of the following occurs:
          o The stone hits a block (Fig. 2(b), (c)).
                + The stone stops at the square next to the block it hit.
                + The block disappears.
          o The stone gets out of the board.
                + The game ends in failure.
          o The stone reaches the goal square.
                + The stone stops there and the game ends in success.
    * You cannot throw the stone more than 10 times in a game. If the stone does not reach the goal in 10 moves, the game ends in failure.


Fig. 2: Stone movements

Under the rules, we would like to know whether the stone at the start can reach the goal and, if yes, the minimum number of moves required.

With the initial configuration shown in Fig. 1, 4 moves are required to bring the stone from the start to the goal. The route is shown in Fig. 3(a). Notice when the stone reaches the goal, the board configuration has changed as in Fig. 3(b).


Fig. 3: The solution for Fig. D-1 and the final board configuration

Input

The input is a sequence of datasets. The end of the input is indicated by a line containing two zeros separated by a space. The number of datasets never exceeds 100.

Each dataset is formatted as follows.

    the width(=w) and the height(=h) of the board
    First row of the board
    ...
    h-th row of the board

The width and the height of the board satisfy: 2 <= w <= 20, 1 <= h <= 20.

Each line consists of w decimal numbers delimited by a space. The number describes the status of the corresponding square.

    0     vacant square
    1     block
    2     start position
    3     goal position

The dataset for Fig. D-1 is as follows:

    6 6
    1 0 0 2 1 0
    1 1 0 0 0 0
    0 0 0 0 0 3
    0 0 0 0 0 0
    1 0 0 0 0 1
    0 1 1 1 1 1

Output

For each dataset, print a line having a decimal integer indicating the minimum number of moves along a route from the start to the goal. If there are no such routes, print -1 instead. Each line should not have any character other than this number.

Sample Input

2 1
3 2
6 6
1 0 0 2 1 0
1 1 0 0 0 0
0 0 0 0 0 3
0 0 0 0 0 0
1 0 0 0 0 1
0 1 1 1 1 1
6 1
1 1 2 1 1 3
6 1
1 0 2 1 1 3
12 1
2 0 1 1 1 1 1 1 1 1 1 3
13 1
2 0 1 1 1 1 1 1 1 1 1 1 3
0 0

Sample Output

1
4
-1
4
10
-1

Source
Japan 2006 Domestic
*/




#include <iostream>
#include <vector>
using namespace std;

int goaltime = 60000;

void dfs(int  blocks[][22],int s1,int s2,int g1,int g2,int time,int w,int h)
{
    if(time > 10 || time >= goaltime)
    {
        return;
    }
    if(s1 == g1)
    {
        int tmp1,tmp2;
        int sign1 = 0;
        if(s2 < g2)
        {
            tmp1 = s2;
            tmp2 = g2;
        }
        else
        {
            tmp1 = g2;
            tmp2 = s2;
        }
        if(tmp1 + 1 == tmp2)
        {
            time++;
            if(time <= 10 && goaltime > time)
            {
                goaltime = time;
            
                
            }
            return;
        }
        else
        {
            for(int a = tmp1 + 1;a < tmp2;a++)
            {
                if(blocks[s1][a] == 1)
                {
                    sign1 = 1;
                    break;
                }
            }
            if(sign1 == 0)
            {
                time++;
                if(time <= 10 && goaltime > time)
                {
                    goaltime = time;
            
                }
                return;
            }
        }

    }
    if(s2 == g2)
    {
        int tmp11,tmp22;
        int sign2 = 0;
        if(s1 < g1)
        {
            tmp11 = s1;
            tmp22 = g1;
        }
        else
        {
            tmp11 = g1;
            tmp22 = s1;
        }
        if(tmp11 + 1 == tmp22)
        {
            time++;
            if(time <= 10 && goaltime > time)
            {
                goaltime = time;
        
                
            }
            return;
        }
        else
        {
            for(int z = tmp11 + 1;z < tmp22;z++)
            {
                if(blocks[s1][z] == 1)
                {
                    sign2 = 1;
                    break;
                }
            }
            if(sign2 == 0)
            {
                time++;
                if(time <= 10 && goaltime > time)
                {
                    goaltime = time;
            
                }
                return;
            }
        }

    }
    else
    {
        
        if(s2 - 1 >= 0 && blocks[s1][s2 - 1] == 0)
        {
            for(int hj = s2 - 2;hj >= 0;hj--)
            {
                if(blocks[s1][hj] == 1)
                {
                    blocks[s1][hj] = 0;
                    blocks[s1][s2] = 0;
                    dfs(blocks,s1,hj + 1,g1,g2,time + 1,w,h);
                    blocks[s1][hj] = 1;
                    blocks[s1][s2] = 2;
                    break;
                }
            }
        }
        if(s2 + 1 < w && blocks[s1][s2 + 1] == 0)
        {
            for(int k = s2 + 2;k < w;k++)
            {
                if(blocks[s1][k] == 1)
                {
                    blocks[s1][k] = 0;
                    blocks[s1][s2] = 0;
                    dfs(blocks,s1,k - 1,g1,g2,time + 1,w,h);
                    blocks[s1][k] = 1;
                    blocks[s1][s2] = 2;
                    break;
                }
            }
        }
        if(s1 - 1 >= 0 && blocks[s1 - 1][s2] == 0)
        {
            for(int u = s1 - 2;u >= 0;u--)
            {
                if(blocks[u][s2] == 1)
                {
                    blocks[u][s2] = 0;
                    blocks[s1][s2] = 0;
                    dfs(blocks,u + 1,s2,g1,g2,time + 1,w,h);
                    blocks[u][s2] = 1;
                    blocks[s1][s2] = 2;
                    break;
                }
            }
        }
        if(s1 + 1 < h && blocks[s1 + 1][s2] == 0)
        {
            for(int m = s1 + 2;m < h;m++)
            {
                if(blocks[m][s2] == 1)
                {
                    blocks[m][s2] = 0;
                    blocks[s1][s2] = 0;
                    dfs(blocks,m - 1,s2,g1,g2,time + 1,w,h);
                    blocks[m][s2] = 1;
                    blocks[s1][s2] = 2;
                    break;
                }
            }
        }
    }
    return;
}

int main(void)
{
    int w,h;
    int s1,s2,g1,g2;
    int blocks[22][22];
    while(cin>>w>>h)
    {
        if(w == 0 || h == 0)
        {
            break;
        }
        else
        {
            for(int i = 0;i < h;i++)
            {
                for(int j = 0;j < w;j++)
                {
                    cin>>blocks[i][j];
                    if(blocks[i][j] == 2)
                    {
                        s1 = i;
                        s2 = j;
                    }
                    else if(blocks[i][j] == 3)
                    {
                        g1 = i;
                        g2 = j;
                    }
                }
            }
            dfs(blocks,s1,s2,g1,g2,0,w,h);
            if(goaltime == 60000)
            {
                cout<<-1<<endl;
            }
            else
            {
                cout<<goaltime<<endl;
            }
            goaltime = 60000;
        
        }
    }

    return 0;
}

测试了题目里的数据还有讨论里的所有数据也都测了。。。WA。。。（为了找测试数据都跑到日本人的BLOG里去找了。。。。。。。。。。）

但是这题收获非常大。。。。。。。。。首先完全搞清楚了一个区别

void dfs(int a[],int x)

void dfs(vector<int> a,int x)

void dfs(vector<int> &a,int x)

第一个在函数内部对数据的更改成立

第二个在函数内部的更改实际上是无效的

而第三个对应本题的情况是在函数体内 比如函数里有2个递归 dfs(a,1);dfs(a,2);那么在每个递归里对数据的修改是成立的。。而当到第2个递归是vector a实际上又变回了原来那个。。注意这里是因为vector自行进行了复制。。。所以

  dfs(blocks,u + 1,s2,g1,g2,time + 1,w,h);
                    blocks[u][s2] = 1;
                    blocks[s1][s2] = 2;
                    break;

如果是使用vector & 那么

    blocks[u][s2] = 1;
    blocks[s1][s2] = 2;

因为vector自动以再复制的方式把数组恢复了。。。但是这样浪费了时间所以会TLE

所以要记住正确的办法应该是用int（即不整个把数组复制一遍）然后在递归的后面加上那2句局部还原。

另外这题向我那样前面if(s1 == g1)什么的完全都是罗嗦根本可以不要直接在4个递归里判断，懒的改了。。。。。。。。