forked from alxsoares/topcoder-5
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathVendingMachine.cpp
More file actions
214 lines (199 loc) · 6.17 KB
/
VendingMachine.cpp
File metadata and controls
214 lines (199 loc) · 6.17 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
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 VendingMachine {
public:
int motorUse(vector <string> prices, vector <string> purchases) {
vector<vector<int> > products = tokmat(prices, " ");
vector<vector<int> > events = tokmat(purchases, ",:");
int M = products.size();
int N = products[0].size();
int L = events.size();
int res = 0;
int cur = 0;
for (int i = -1; i < L; i++) {
if (i >= 0) {
int next = events[i][1];
res += min((next-cur+N)%N, (cur-next+N)%N);
cur = next;
if (products[events[i][0]][cur] == 0) return -1;
products[events[i][0]][cur] = 0;
}
if (i == -1 || i == L-1 || (events[i+1][2]- events[i][2] >= 5)){
int max = 0;
int next = 0;
for (int j = 0; j < N; j++) {
int sum = 0;
for (int k = 0; k < M; k++)
sum += products[k][j];
if (sum > max) {
max = sum;
next = j;
}
}
res += min((next-cur+N)%N, (cur-next+N)%N);
cur = next;
}
}
return res;
}
vector<string> tokenize(string s, string ch) {
vector<string> res;
for(int p = 0, p2; p < (int)s.size(); p = p2+1) {
p2 = s.find_first_of(ch, p);
if( p2 == -1 ) p2 = s.size();
if( p2-p > 0 ) res.push_back(s.substr(p, p2-p));
}
return res;
}
vector<int> tokint(string s, string ch) {
vector<int> res;
vector<string> p = tokenize(s, ch);
for(int i = 0; i < (int)p.size(); i++)
res.push_back(atoi(p[i].c_str()));
return res;
}
vector<vector<int> > tokmat(vector<string> s, string ch) {
vector<vector<int> > res;
for(int i = 0; i < (int)s.size(); i++)
res.push_back(tokint(s[i], ch));
return res;
}
};
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.8 (beta) modified by pivanof
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool KawigiEdit_RunTest(int testNum, vector <string> p0, vector <string> p1, bool hasAnswer, int p2) {
cout << "Test " << testNum << ": [" << "{";
for (int i = 0; int(p0.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << "\"" << p0[i] << "\"";
}
cout << "}" << "," << "{";
for (int i = 0; int(p1.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << "\"" << p1[i] << "\"";
}
cout << "}";
cout << "]" << endl;
VendingMachine *obj;
int answer;
obj = new VendingMachine();
clock_t startTime = clock();
answer = obj->motorUse(p0, p1);
clock_t endTime = clock();
delete obj;
bool res;
res = true;
cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
if (hasAnswer) {
cout << "Desired answer:" << endl;
cout << "\t" << p2 << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << answer << endl;
if (hasAnswer) {
res = answer == p2;
}
if (!res) {
cout << "DOESN'T MATCH!!!!" << endl;
} else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
cout << "FAIL the timeout" << endl;
res = false;
} else if (hasAnswer) {
cout << "Match :-)" << endl;
} else {
cout << "OK, but is it right?" << endl;
}
cout << "" << endl;
return res;
}
int main() {
bool all_right;
all_right = true;
vector <string> p0;
vector <string> p1;
int p2;
{
// ----- test 0 -----
string t0[] = {"100 100 100"};
p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
string t1[] = {"0,0:0","0,2:5","0,1:10"};
p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
p2 = 4;
all_right = KawigiEdit_RunTest(0, p0, p1, true, p2) && all_right;
// ------------------
}
{
// ----- test 1 -----
string t0[] = {"100 200 300 400 500 600"};
p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
string t1[] = {"0,2:0","0,3:5","0,1:10","0,4:15"};
p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
p2 = 17;
all_right = KawigiEdit_RunTest(1, p0, p1, true, p2) && all_right;
// ------------------
}
{
// ----- test 2 -----
string t0[] = {"100 200 300 400 500 600"};
p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
string t1[] = {"0,2:0","0,3:4","0,1:8","0,4:12"};
p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
p2 = 11;
all_right = KawigiEdit_RunTest(2, p0, p1, true, p2) && all_right;
// ------------------
}
{
// ----- test 3 -----
string t0[] = {"100 100 100"};
p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
string t1[] = {"0,0:10","0,0:11"};
p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
p2 = -1;
all_right = KawigiEdit_RunTest(3, p0, p1, true, p2) && all_right;
// ------------------
}
{
// ----- test 4 -----
string t0[] = {"100 200 300","600 500 400"};
p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
string t1[] = {"0,0:0","1,1:10","1,2:20","0,1:21","1,0:22","0,2:35"};
p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
p2 = 6;
all_right = KawigiEdit_RunTest(4, p0, p1, true, p2) && all_right;
// ------------------
}
if (all_right) {
cout << "You're a stud (at least on the example cases)!" << endl;
} else {
cout << "Some of the test cases had errors." << endl;
}
return 0;
}
// END KAWIGIEDIT TESTING
//Powered by KawigiEdit 2.1.8 (beta) modified by pivanof!