http://poj.org/problem?id=1009
很好的一个模拟题,强烈建议做一下。
附代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int dr[8][2] = {{-1,0},{1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
struct node
{
int v,t;
}s[1010],e[100000];
int cnt;
int ss = 0;
int w;
bool valid(int x,int y)
{
if(x>=0 && y>=0 && x<w && y*w+x < ss)
return true;
return false;
}
int find(int x,int y)
{
int temp = y*w+x;
int tt = 0;
int i;
for(i=0;i<cnt;i++)
{
if(tt <= temp && tt+s[i].t > temp) return s[i].v;
tt += s[i].t;
}
}
int code(int x,int y)
{
int ret = 0;
for(int i=0;i<8;i++)
{
int xx = x+dr[i][0],yy = y+dr[i][1];
if(valid(xx,yy))
ret = max(ret,abs(find(x,y) - find(xx,yy)));
}
return ret;
}
bool cmp(const node n1,const node n2)
{
return n1.t < n2.t;
}
int main()
{
freopen("input.txt","r",stdin);
while(scanf("%d",&w)!=EOF)
{
if(!w)break;
printf("%d\n",w);
int x,y;
cnt = 0;
ss = 0;
while(scanf("%d%d",&x,&y)!=EOF)
{
if(x+y == 0)break;
ss += y;
s[cnt].v = x;
s[cnt++].t = y;
}
//cout << find(0,0) << endl;
int dt = 0;
int rcnt = 0;
for(int i=0;i<=cnt;i++)
{
int dx,dy;
dx = dt%w;dy = dt/w;
for(x=dx-1;x<=dx+1;x++)
{
for(y=dy-1;y<=dy+1;y++)
{
if(valid(x,y))
{
e[rcnt].v = code(x,y);
e[rcnt++].t = y*w+x;
}
}
}
dt += s[i].t;
}
sort(e,e+rcnt,cmp);
int last = 0;
for(int i=1;i<rcnt;i++)
{
if(e[i].v != e[i-1].v)
{
printf("%d %d\n",e[i-1].v,e[i].t-last);
last = e[i].t;
}
//printf("%d %d\n",e[i].v,e[i].t);
}
printf("%d %d\n0 0\n",e[rcnt-1].v,ss-last);
// cout << endl;
}
printf("0\n");
return 0;
}