Codeforces Round #155 (Div. 2) D-rats

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int n,m,d;
char e[1001][1001];
int mark[1001][1001],locrat[1001][1001];
int dir[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int main()
{
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	while(scanf("%d %d %d",&n,&m,&d)!=EOF)
	{
		int i,j,k,x,y;
		for(i=0;i >rats;
		for(i=0;i300)     //8秒两个炸弹最多覆盖290个空格 
		{
			printf("-1\n");
			continue;
		}
		vector >mm;
		memset(locrat,-1,sizeof(locrat));
		for(i=0;i=0&&y>=0&&x1200)//两个炸弹范围不重叠，且范围内全是老鼠，则生成的mm.size()也不会超过1200个 
		{
			printf("-1\n");
			continue;
		}
		vector >s(mm.size());  //建立一个mm.size()大的数组bitset，每个有300位 
		memset(mark,-1,sizeof(mark));
		pairqueue[300];
		for(i=0;ifull;
		for(i=0;i=mm.size())
		printf("-1\n");
	}
	return 0;
}