Problem description error:
∆T = ⌈β2(h2 − h1)⌉ + γ, if h1 < h2 , here if we use γ as problem description,we get WA from online judge,so use δ here to get accepted.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 |
#include <iostream> #include <queue> #include <cstdio> #include <cstring> #include <cmath> #define INF 100000000 using namespace std; int M,N; int gr[20][20]; int dirx[4]={1,0,0,-1}; int diry[4]={0,1,-1,0}; float alpha1,alpha2; int gema; float beta1,beta2; int delta; int Rs,Cs,Rt,Ct; int E; int Time[20][20][205]; bool visit[20][20][205]; int MX; struct State{ int x,y,_energy,_time; }; struct cmp{ bool operator()(State one,State two) { return one._time<two._time; } }; bool bfs() { priority_queue<State,vector<State>,cmp> q; MX = INF; int valu,tt; for(int i=0;i<20;i++) { for(int j=0;j<20;j++) { for(int k=0;k<205;k++) { Time[i][j][k]=0; visit[i][j][k]=false; } } } visit[Rs][Cs][0]=1; State stat; stat.x = Rs;stat.y = Cs,stat._energy = 0; stat._time = 0; q.push(stat); int r,c,en,tm; Time[Rs][Cs][0]=0; bool Found=0; while(!q.empty()) { State tstat = q.top(); q.pop(); r = tstat.x;//q.front();q.pop(); c = tstat.y;//q.front();q.pop(); en = tstat._energy;//q.front();q.pop(); tm = tstat._time; if(r==Rt && c==Ct) { if(tm<MX) { MX = tm;//Time[r][c][en]; Found = 1; } continue; } for(int i=0;i<4;i++) { if(r+dirx[i]>=1 && r+dirx[i]<=M && c+diry[i]>=1 && c+diry[i]<=N) { if(gr[r][c]>gr[r+dirx[i]][c+diry[i]]) { valu = ceilf((gr[r][c]-gr[r+dirx[i]][c+diry[i]])*alpha1)+gema; tt = ceilf((gr[r][c]-gr[r+dirx[i]][c+diry[i]])*beta1)+delta; } else if(gr[r][c]<gr[r+dirx[i]][c+diry[i]]) { valu = ceilf((gr[r+dirx[i]][c+diry[i]]-gr[r][c])*alpha2)+gema; tt = ceilf((gr[r+dirx[i]][c+diry[i]]-gr[r][c])*beta2)+delta;//gema } else if(gr[r][c]==gr[r+dirx[i]][c+diry[i]]) { valu = gema; tt = delta; } if(en+valu>E) continue; if(visit[r+dirx[i]][c+diry[i]][en+valu]) continue; visit[r+dirx[i]][c+diry[i]][en+valu] = 1; Time[r+dirx[i]][c+diry[i]][en+valu] = tm+tt;//Time[r][c][en]+tt; tstat.x = r+dirx[i]; tstat.y = c+diry[i]; tstat._energy = en+valu; tstat._time = tm+tt;//Time[r+dirx[i]][c+diry[i]][en+valu]; q.push(tstat); } } } return Found; } int main() { while(cin>>M) { cin>>N; if(M+N==0) break; cin>>alpha1>>alpha2>>gema; cin>>beta1>>beta2>>delta; for(int i=1;i<=M;i++) { for(int j=1;j<=N;j++) cin>>gr[i][j]; } cin>>Rs>>Cs>>Rt>>Ct>>E; if(!bfs()) cout<<"failed\n";//failed else cout<<MX<<"\n"; } return 0; } |