bfs.在地图上又若干炮塔(随便翻译啦),给出地图大小和炮塔个数以及限定时间,问是否能在限定时间内从左上角跑到右下角。每个炮塔都会开炮的,给出他们开炮的方向,时间间隔,炮弹速度,以及坐标。
首先,怎么判断能不能进入下一个点呢?换句话说就是怎么判断下一时刻,那个点是否有停留的炮弹。假如枚举每个炮塔,再计算是否可行,这样不仅不好写代码,也会浪费时间。不妨用3维数组,表示在t时刻,x,y点是否可以进入。至于计算这个数组的方法,就是枚举每个炮塔,模拟它的子弹,每当炮弹顺利停留在某点时,就把首次到该点的时间,加时间间隔,直至超过限定时间的所有点记为1即可。最后bfs一下。第一组样例是错的,应该是Bad luck!。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
#define PC(cas) printf("Game %d:\n", cas)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 111;
const int M = 1111;
//const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};
struct Pao
{
int d, t, v, x, y;
}pao[N];
struct point
{
int x, y, t;
point(){};
point(int a, int b, int c){x = a, y = b, t = c;};
}p;
bool can[N][N][M], vis[N][N];
int n, m, k, T;
int move[5][2] = {-1, 0, 1, 0, 0, -1, 0, 1, 0, 0};
bool check(int x, int y)
{
return x >= 0 && y >= 0 && x < n && y < m;
}
void bfs()
{
int tx, ty;
queue<point> q;
q.push(point(0, 0, 0));
while(!q.empty())
{
p = q.front();
q.pop();
if(p.t >= T)break;
REP(i, 5)
{
tx = p.x + move[i][0];
ty = p.y + move[i][1];
if(check(tx, ty) && !can[tx][ty][p.t + 1] && !vis[tx][ty])
{
if(i != 4)vis[tx][ty] = 1;
if(tx == n - 1 && ty == m - 1)
{
PI(p.t + 1);
return;
}
q.push(point(tx, ty, p.t + 1));
}
}
}
puts("Bad luck!");
}
void calc(int x, int y, int t, int v, int d)
{
int tx = x, ty = y, k, time = 1;
while(1)
{
REP(i, v)
{
tx += move[d][0];
ty += move[d][1];
if(!check(tx, ty) || vis[tx][ty])return;
}
for(k = time; k <= T; k += t)can[tx][ty][k] = 1;
time++;
}
}
int main()
{
//freopen("input.txt", "r", stdin);
int tx, ty, c;
char dir[5];
while(RIV(n, m, k, T) != EOF)
{
n++;m++;
CLR(vis, 0);
CLR(can, 0);
REP(i, k)
{
RS(dir);
RIV(pao[i].t, pao[i].v, pao[i].x, pao[i].y);
if(dir[0] == 'N')pao[i].d = 0;
else if(dir[0] == 'S')pao[i].d = 1;
else if(dir[0] == 'W')pao[i].d = 2;
else if(dir[0] == 'E')pao[i].d = 3;
vis[pao[i].x][pao[i].y] = 1;
}
REP(i, k)calc(pao[i].x, pao[i].y, pao[i].t, pao[i].v, pao[i].d);
bfs();
}
return 0;
}