Hdu 5336 XYZ and Drops（模拟）

解析：一秒一秒的来处理就好。

[code]:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#include<queue>

using namespace std;
const int maxn = 105;

struct Node{
int x,y,sz;
}a[maxn];
struct Drop{
int x,y,dir,time;
Drop(int x,int y,int dir,int time):x(x),y(y),dir(dir),time(time){}
};
int n,T,r,c;
int b[maxn][maxn],ans[maxn];
queue<Drop> que;
int dx[4] = {0,0,-1,1};
int dy[4] = {-1,1,0,0};

void init(){
memset(b,0,sizeof(b));
memset(ans,-1,sizeof(ans));
while(!que.empty()) que.pop();
}
void sol(){
int i,j,t,nx,ny;
for(t = 1;t <= T;t++){
while(!que.empty()){
Drop d = que.front();
if(d.time>t) break;
que.pop();
nx = d.x+dx[d.dir];
ny = d.y+dy[d.dir];
if(nx<1||nx>r||ny<1||ny>c) continue;
if(b[nx][ny]){
b[nx][ny] += 1;
}else{
que.push(Drop(nx,ny,d.dir,d.time+1));
}
}
for(i = 0;i < n;i++){
if(b[a[i].x][a[i].y]>4){
for(j = 0;j < 4;j++) que.push(Drop(a[i].x,a[i].y,j,t+1));
b[a[i].x][a[i].y] = 0;
ans[i] = t;
}
}
}
for(i = 0;i < n;i++){
if(ans[i]!=-1) printf("0 %d\n",ans[i]);
else printf("1 %d\n",b[a[i].x][a[i].y]);
}
}

int main(){
int i,j,cas,u,v;
//scanf("%d",&cas);
//while(cas--){
while(~scanf("%d%d%d%d",&r,&c,&n,&T)){
init();
for(i = 0;i < n;i++){
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].sz);
b[a[i].x][a[i].y] = a[i].sz;
}
scanf("%d%d",&u,&v);
for(i = 0;i < 4;i++) que.push(Drop(u,v,i,1));
sol();
}
return 0;
}