十滴水，半成品，大多数关卡可以过去，不过也有几个过不去，仍在调试中，不断更新

/*
宽搜+记忆化搜索
*/
#include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <string>
#define  leftedge 1
#define  rightedge    5
#define  topedge  1
#define  downedge 6
using namespace std;
struct status{
    int map[7][6];
    int step;
};
bool success;
int resx,resy;
int steps[1000];
int limit;
void output(status s){
    int i,j;
    printf("

---------------
");
    for(i=topedge;i<=downedge;++i){
        for(j=leftedge;j<=rightedge;++j)
            printf("%d ",s.map[i][j]);
        printf("
");
    }
    printf("---------------


");
    return;
}

bool check(status s){
    int i,j;
    for(i=topedge;i<=downedge;++i)
        for(j=leftedge;j<=rightedge;++j){
            if(s.map[i][j]!=0) return 0;
        }
    return 1;
}
struct node{
    int x,y;
};
status update(int x,int y,status s){  //已经爆了的气球
    queue<node>order;
    while(order.size()>0) order.pop();
    int i,j,k,ii,jj,tx,ty;
    node t,t1,t2;
    t.x=x;  t.y=y;
    order.push(t);
    while(order.size()>0){
        t1=order.front();
        tx=t1.x;    ty=t1.y;
        order.pop();
        s.map[tx][ty]=0;
        for(i=tx-1;i>=topedge;--i){
            if(s.map[i][ty]==0) continue;
            else {
                s.map[i][ty]++; t2.x=i; t2.y=ty;
                if(s.map[i][ty]==5) {s.map[i][ty]=0;order.push(t2);}
                break;
            }
        }
        for(i=tx+1;i<=downedge;++i){
            if(s.map[i][ty]==0) continue;
            else {
                s.map[i][ty]++; t2.x=i; t2.y=ty;
                if(s.map[i][ty]==5) {s.map[i][ty]=0;order.push(t2);}
                break;
            }
        }
        for(i=ty-1;i>=leftedge;--i){
            if(s.map[tx][i]==0) continue;
            else {
                s.map[tx][i]++; t2.x=tx; t2.y=i;
                if(s.map[tx][i]==5) {s.map[tx][i]=0;order.push(t2);}
                break;
            }
        }
        for(i=ty+1;i<=rightedge;++i){
            if(s.map[tx][i]==0) continue;
            else {
                s.map[tx][i]++; t2.x=tx; t2.y=i;
                if(s.map[tx][i]==5) {s.map[tx][i]=0;order.push(t2);}
                break;
            }
        }
    }
    if(check(s)==1) {resx=x;resy=y; success=1;output(s);}
    //output(s);
    return s;
}
void change(int step,status s){
    int i,j,ii,jj;
    status temp;
    if(success==1||step>limit||check(s)==1)
        return;
    for(i=topedge;i<=downedge;++i)
        for(j=leftedge;j<=rightedge;++j){
            temp=s;
            if(temp.map[i][j]==0) continue;
            temp.map[i][j]++;

            temp.step=i*10+j;
            steps[step*100+temp.step]=s.step;



            if(temp.map[i][j]==5) temp=update(i,j,temp);
            if(success==1){
                return;
            }
            change(step+1,temp);
            if(success==1){
                printf("ok
");




                return ;
            }



        }
    return;
}
int main(){
    int i,j,tx,ty;
    status s;
    int res[10];
    while(true){
        success=0;
        printf("请输入限制步数
");
        scanf("%d",&limit);
        for(i=topedge;i<=downedge;++i)
            for(j=leftedge;j<=rightedge;++j)
                scanf("%d",&s.map[i][j]);
        s.step=0;

        change(1,s);
        printf("success=%d
",success);


        res[limit]=limit*100+resx*10+resy;
        tx=resx;    ty=resy;

        for(i=limit-1;i>=1;--i){
            res[i]= steps[ (i+1)*100+ tx*10+ty  ];
            tx=res[i]/10;   ty=res[i]%10;
        }
        for(i=1;i<=limit;i++)
        {
            res[i]=res[i]%100;
            printf("%d %d
",res[i]/10,res[i]%10);
        }
    }
    return 0;
}