|
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 146 147 148 |
#include <iostream> #include <cstdio> #include <queue> #define INF 1000000 using namespace std; struct state{ int presnt; double rem_gas; double cost; }; double d[55],price_gal[55]; double gr[55][55],dst[55][55]; bool visit[55]; int L; double dist,cango; double capacity,dist_pergal,price; int station; double MN; int recurs(state a) { int pos = a.presnt; double gaso = a.rem_gas; double cst = a.cost; state t; if(pos==L) { if(MN>cst) MN = cst; return 0; } if(gaso>=capacity/2) { bool flag = true; for(int i=pos+1;i<=L;i++) { if(visit[i]) continue; double distance = dst[i][pos]; if((dist_pergal*gaso)>=distance) { t.presnt = i; t.cost = cst; t.rem_gas= gaso - distance/dist_pergal; visit[i]=1; recurs(t); visit[i]=0; flag=0; } } if(flag) { a.presnt = pos; a.cost = cst + (capacity-gaso)*price_gal[pos]+2; a.rem_gas = capacity; recurs(a); visit[pos]=0; } } else { for(int i=pos+1;i<=L;i++) { if(visit[i]) continue; double distance = dst[i][pos]; if((dist_pergal*gaso)>=distance) { t.presnt = i; t.cost = cst; t.rem_gas= gaso - distance/dist_pergal; visit[i]=1; recurs(t); visit[i]=0; } } a.presnt = pos; a.cost = cst + (capacity-gaso)*price_gal[pos]+2; a.rem_gas = capacity; recurs(a); visit[pos]=0; } return 0; } int main() { int kase=1; while(cin>>dist) { if(dist<0) break; cin>>capacity>>dist_pergal>>price; cango = capacity/dist_pergal; cin>>station; L=1; for(int i=0;i<55;i++) { visit[i]=false; for(int j=0;j<55;j++) { if(i==j) dst[i][j]=0; else dst[i][j]=INF; } } d[0]=0; price_gal[0]=price/capacity; while(station--) { cin>>d[L]>>price_gal[L]; price_gal[L]/=100; for(int i=0;i<L;i++) { dst[L][i]=d[L]-d[i]; } L++; } if(d[L-1]<dist) { d[L] = dist; for(int i=0;i<L;i++) { dst[L][i]=d[L]-d[i]; } } MN = INF; state s; s.presnt = 0; s.rem_gas = capacity; s.cost = price; visit[0]=1; recurs(s); visit[0]=0; cout<<"Data Set #"<<kase++<<"\n"; printf("minimum cost = $%.2lf\n",MN); } return 0; } |