版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/IDrandom/article/details/87922700
加一个时间维,暴力
#include<bits/stdc++.h>
using namespace std;
char mp[105][105][1005];
bool vis[105][105][1005];
int dx[5]={-1,1,0,0,0};
int dy[5]={0,0,-1,1,0};
const int INF=0x3f3f3f3f;
int m,n,k,d;
struct castle{
int x,y,t,v;
char dir;
}ca[105];
struct node{
int x,y,t;
node(){}
node(int a,int b,int c){x=a,y=b,t=c;}
};
int bfs(node st){
queue<node>mq;
vis[st.x][st.y][st.t]=1;
mq.push(st);
while(!mq.empty()){
node nw=mq.front();
if(nw.x==m&&nw.y==n)return nw.t;
mq.pop();
for(int i=0;i<5;i++){
int nx=nw.x+dx[i];
int ny=nw.y+dy[i];
int nt=nw.t+1;
if(nx<0||nx>m||ny<0||ny>n||nt>d||vis[nx][ny][nt]||mp[nx][ny][nt])continue;
mq.push(node(nx,ny,nt));
//cout<<nx<<" "<<ny<<" "<<nt<<endl;
vis[nx][ny][nt]=true;
}
}
return 2000;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
while(cin>>m>>n>>k>>d){
memset(mp,0,sizeof mp);
memset(vis,0,sizeof vis);
for(int i=1;i<=k;i++){
cin>>ca[i].dir>>ca[i].t>>ca[i].v>>ca[i].x>>ca[i].y;
for(int j=0;j<=d;j++){
mp[ca[i].x][ca[i].y][j]=-1;
if(ca[i].dir=='N')ca[i].dir=0;
if(ca[i].dir=='S')ca[i].dir=1;
if(ca[i].dir=='W')ca[i].dir=2;
if(ca[i].dir=='E')ca[i].dir=3;
}
}
for(int i=1;i<=k;i++){
for(int dt=0;dt<=d;dt+=ca[i].t){
for(int dd=1;;dd++){
int nx=ca[i].x+dd*dx[ca[i].dir];
int ny=ca[i].y+dd*dy[ca[i].dir];
int nt=dt+dd/ca[i].v;
if(nx<0||nx>m||ny<0||ny>n||nt>d)break;
if(mp[nx][ny][nt]==-1)break;
if(dd%ca[i].v)continue;
mp[nx][ny][nt]=1;
}
}
}
int ans=bfs(node(0,0,0));
if (ans<=d)cout<<ans<<endl;
else cout<<"Bad luck!"<<endl;
}
return 0;
}