HDU 4527

搞了好久，发现自己是想法没错的，错在输入，必须是while(){}

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

struct Water{
    int px,py;
    int dirx,diry;
    Water(){}
    Water(int x,int y,int dx,int dy){px=x,py=y;dirx=dx,diry=dy;}
}que[];
struct Posover{
    int x,y;
    Posover(int tx,int ty){x=tx,y=ty;}
    Posover(){}
};
vector<Posover>vec;
int head,tail;

int map[][];

void work(int x,int y){
    map[x-][y-]++;
    if(map[x-][y-]>=){
        map[x-][y-]=;
        que[tail++]=Water(x-,y-,,-);
        que[tail++]=Water(x-,y-,,);
        que[tail++]=Water(x-,y-,,);
        que[tail++]=Water(x-,y-,-,);
    }
    int sz;
    vec.clear();
    int cnt=;
    while(head<tail){
        sz=tail-head;
        cnt++;
        while(sz--){
            int tx=que[head].px+que[head].dirx;
            int ty=que[head].py+que[head].diry;
            if(tx>=&&tx<=&&ty>=&&ty<=){
                if(map[tx][ty]>){
                    map[tx][ty]++;
                    if(map[tx][ty]==){
                        vec.push_back(Posover(tx,ty));
                    }
                }
                else{
                    que[tail++]=Water(tx,ty,que[head].dirx,que[head].diry);
                }
            }
            head++;
        }
        int vsz=vec.size();
        for(int i=;i<vsz;i++){
            map[vec[i].x][vec[i].y]=;
            que[tail++]=Water(vec[i].x,vec[i].y,,);
            que[tail++]=Water(vec[i].x,vec[i].y,,-);
            que[tail++]=Water(vec[i].x,vec[i].y,,);
            que[tail++]=Water(vec[i].x,vec[i].y,-,);
        }
        vec.clear();
    }
//    cout<<cnt<<endl;
}

int main(){
    while(scanf("%d",&map[][])!=EOF){
        int j;
    for(int i=;i<;i++){
        for(i==?j=:j=;j<;j++)
        scanf("%d",&map[i][j]);
    }
    int nop,x,y;
    scanf("%d",&nop);
    while(nop--){
        tail=head=;
        scanf("%d%d",&x,&y);
        if(x>=&&x<=&&y>=&&y<=)
        work(x,y);
    }
    for(int i=;i<;i++){
        printf("%d",map[i][]);
        for(int j=;j<;j++){
            printf(" %d",map[i][j]);
        }
        printf("\n");
    }
    printf("\n");
    }
    return ;
}