forked from kaushal02/interview-coding-problems
-
Notifications
You must be signed in to change notification settings - Fork 0
/
energyDifference.cpp
executable file
·49 lines (40 loc) · 1.26 KB
/
energyDifference.cpp
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
/*
Samsung Delhi IITD 2018
Initially you have H amount of energy and D distance to travel. You may travel
with any of the given 5 speeds. But you may only travel in units of 1 km. For
each km distance traveled, you will spend corresponding amount of energy.
e.g. the given speeds are:
Cost of traveling 1 km: [4, 5, 2, 3, 6]
Time taken to travel 1 km: [200, 210, 230, 235, 215]
Find minimum time required to cover total D km with remaining H >= 0
1 <= H <= 4000
1 <= D <= 1000
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 2E9;
int dp[4040][1010][5];
inline int fun(int i, int j, int k, vector<int> &a, vector<int> &b) {
if (i < 0) return INF;
if (j == 0) return 0;
if (k < 0) return INF;
if (dp[i][j][k] != -1) return dp[i][j][k];
return dp[i][j][k] = min(fun(i, j, k - 1, a, b), b[k] + fun(i - a[k], j - 1, k, a, b));
}
int getMinTime(vector<int> &cost, vector<int> &time, int H, int D) {
memset(dp, -1, sizeof dp);
return fun(H, D, 4, cost, time);
}
int main() {
int t (14);
vector<int> cost {4, 5, 2, 3, 6};
vector<int> time {200, 210, 230, 235, 215};
cout << getMinTime(cost, time, t, 4);
return 0;
}
/* Verify for the following t values..
*
* t = 16, 17, … -> 800
* t = 14, 15 -> 830
* t = 13 -> 860
*/