Skip to content
Navigation Menu
{{ message }}
forked from oeddyo/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1000.cpp
More file actions
294 lines (281 loc) · 8.1 KB
/
Copy path1000.cpp
File metadata and controls
294 lines (281 loc) · 8.1 KB
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
class PowerPlants {
public:
int minCost(vector <string>, string, int);
};
const int MAXN = 17;
const int MAXSTATE = 1<<17;
int dp[MAXN][1<<17];
const int INF = 999999999;
int PowerPlants::minCost(vector <string> connectionCost, string plantList, int numPlants) {
for(int i=0; i<MAXN; i++){
for(int j=0; j<MAXSTATE; j++){
dp[i][j] = INF;
}
}
int init_state = 0;
int cnt_Y = 0;
for(int i=0; i<plantList.size(); i++){
if(plantList[i]=='Y'){
cnt_Y ++;
init_state =( init_state<<1) + 1;
}else{
init_state = init_state<<1;
}
}
cout<<"INIT STATE IS "<<init_state<<endl;
int sz = plantList.size();
dp[0][init_state] = 0;
if(numPlants-cnt_Y<=0){
return 0;
}
for(int i=0; i<numPlants-cnt_Y; i++){
for(int s=0; s<(1<<sz); s++){
if(dp[i][s]!=INF){
for(int k=0; k<sz; k++){
if(((s>>k)&1)==1){
for(int j=0; j<sz; j++){
if (((s>>j)&1)==0){
//open j
//from k
int n_s = s|(1<<j);
int cost;
int from = sz-k-1;
int to = sz-j-1;
if(connectionCost[from][to]<='9'&&connectionCost[from][to]>='0'){
cost = connectionCost[from][to]-'0';
}else{
cost = connectionCost[from][to]-'A'+10;
}
/*
if(connectionCost[k][j]<='9'&&connectionCost[k][j]>='0'){
cost = connectionCost[k][j]-'0';
}else{
cost = connectionCost[k][j]-'A'+10;
}
*/
//cout<<"now at "<<i<<" "<<s<<" and turn from "<<k<<" to "<<j<<" with cost "<<cost<<" next is "<<n_s<<endl;
dp[i+1][n_s] = min(dp[i+1][n_s], dp[i][s] + cost);
}
}
}
}
}
}
}
int ans = INF;
for(int i=0; i<(1<<sz); i++){
ans = min(ans, dp[numPlants-cnt_Y][i]);
}
return ans;
}
double test0() {
string t0[] = {"024",
"203",
"430"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "YNN";
int p2 = 3;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 5;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
double test1() {
string t0[] = {"0AB",
"A0C",
"CD0"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "YNN";
int p2 = 3;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 21;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
double test2() {
string t0[] = {"1ABCD",
"35HF8",
"FDM31",
"AME93",
"01390"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "NYNNN";
int p2 = 5;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 14;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
double test3() {
string t0[] = {"012",
"123",
"234"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "NNY";
int p2 = 2;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 2;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
double test4() {
string t0[] = {"1309328",
"DS2389U",
"92EJFAN",
"928FJNS",
"FJS0DJF",
"9FWJW0E",
"23JFNFS"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "YYNYYNY";
int p2 = 4;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 0;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
double test5() {
string t0[] = {"01","20"};
vector <string> p0(t0, t0+sizeof(t0)/sizeof(string));
string p1 = "YN";
int p2 = 2;
PowerPlants * obj = new PowerPlants();
clock_t start = clock();
int my_answer = obj->minCost(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 1;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
int main() {
int time;
bool errors = false;
time = test0();
if (time < 0)
errors = true;
time = test1();
if (time < 0)
errors = true;
time = test2();
if (time < 0)
errors = true;
time = test3();
if (time < 0)
errors = true;
time = test4();
if (time < 0)
errors = true;
time = test5();
if (time < 0)
errors = true;
if (!errors)
cout <<"You're a stud (at least on the example cases)!" <<endl;
else
cout <<"Some of the test cases had errors." <<endl;
}
You can’t perform that action at this time.