My favorites
▼
|
Sign in
hefdoeshwk
Code exercises for the blog Hef Does Homework.
Project Home
Downloads
Wiki
Issues
Source
Checkout
Browse
Changes
Source path:
svn
/
trunk
/
topcoder
/
Srm145
/
Div2
/
VendingMachine.cs
r24
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
using System;
namespace Hef.TopCoder.Srm145.Div2
{
public class VendingMachine
{
int[][] prices;
int colCount;
public int motorUse(string[] prices, string[] purchases)
{
this.prices = new int[prices.Length][];
for (int s = 0; s < prices.Length; s += 1)
{
string[] ps = prices[s].Split(' ');
this.prices[s] = new int[ps.Length];
for (int c = 0; c < ps.Length; c += 1)
{
this.prices[s][c] = Int32.Parse(ps[c]);
}
}
this.colCount = this.prices[0].Length;
int usage = 0;
// start at best column
usage += this.rotate(this.calcBestCol());
// process purchases
foreach (string p in purchases)
{
string[] args = p.Split(',', ':');
int sec = this.purchase(int.Parse(args[0]), int.Parse(args[1]), int.Parse(args[2]));
if (sec == -1)
return -1;
usage += sec;
}
// end at best column
usage += this.rotate(this.calcBestCol());
return usage;
}
int lastTime = 0;
int lastCol = 0;
int purchase(int shelf, int column, int atTime)
{
if (this.prices[shelf][column] == 0)
return -1;
int sec = 0;
if (atTime - this.lastTime >= 5)
sec += this.rotate(this.calcBestCol());
sec += this.rotate(column);
this.prices[shelf][column] = 0;
this.lastTime = atTime;
return sec;
}
int rotate(int column)
{
int maxCol = Math.Max(this.lastCol, column);
int minCol = Math.Min(this.lastCol, column);
int sec = Math.Min(maxCol - minCol, this.colCount - maxCol + minCol);
this.lastCol = column;
return sec;
}
int calcBestCol()
{
int bestCol = 0;
int bestPrice = 0;
for (int c = 0; c < this.colCount; c += 1)
{
int colPrice = 0;
for (int s = 0; s < this.prices.Length; s += 1)
colPrice += this.prices[s][c];
if (colPrice > bestPrice)
{
bestCol = c;
bestPrice = colPrice;
}
}
return bestCol;
}
}
}
Show details
Hide details
Change log
r5
by jonathan.hefner on Jun 22, 2008
Diff
Sync
Go to:
/trunk/eopl2/scheme/1.26.scm
/trunk/eopl2/scheme/1.31.scm
/trunk/eopl2/scheme/1.32.scm
/trunk/eopl2/scheme/1.33.scm
/trunk/shiftsrt
/trunk/shiftsrt/perl
/trunk/shiftsrt/perl/shiftsrt.pl
/trunk/shiftsrt/python
/trunk/shiftsrt/python/shiftsrt.py
/trunk/topcoder
/trunk/topcoder/Properties
...coder/Properties/AssemblyInfo.cs
/trunk/topcoder/Srm144
/trunk/topcoder/Srm144/Div1
...nk/topcoder/Srm144/Div1/1100.doc
/trunk/topcoder/Srm144/Div1/300.txt
/trunk/topcoder/Srm144/Div1/550.doc
.../topcoder/Srm144/Div1/Lottery.cs
...coder/Srm144/Div1/LotteryTest.cs
/trunk/topcoder/Srm144/Div2
...nk/topcoder/Srm144/Div2/1100.doc
/trunk/topcoder/Srm144/Div2/200.doc
/trunk/topcoder/Srm144/Div2/550.doc
...pcoder/Srm144/Div2/BinaryCode.cs
...er/Srm144/Div2/BinaryCodeTest.cs
...coder/Srm144/Div2/PowerOutage.cs
...r/Srm144/Div2/PowerOutageTest.cs
/trunk/topcoder/Srm144/Div2/Time.cs
...topcoder/Srm144/Div2/TimeTest.cs
/trunk/topcoder/Srm145
/trunk/topcoder/Srm145/Div2
...nk/topcoder/Srm145/Div2/1100.doc
/trunk/topcoder/Srm145/Div2/250.doc
/trunk/topcoder/Srm145/Div2/500.doc
...r/Srm145/Div2/ExerciseMachine.cs
...m145/Div2/ExerciseMachineTest.cs
...er/Srm145/Div2/ImageDithering.cs
...rm145/Div2/ImageDitheringTest.cs
...er/Srm145/Div2/VendingMachine.cs
...rm145/Div2/VendingMachineTest.cs
/trunk/topcoder/Srm146
/trunk/topcoder/Srm146/Div2
...nk/topcoder/Srm146/Div2/1000.doc
/trunk/topcoder/Srm146/Div2/250.doc
/trunk/topcoder/Srm146/Div2/500.doc
...er/Srm146/Div2/BridgeCrossing.cs
...rm146/Div2/BridgeCrossingTest.cs
...r/Srm146/Div2/RectangularGrid.cs
...m146/Div2/RectangularGridTest.cs
...oder/Srm146/Div2/YahtzeeScore.cs
Project members,
sign in
to write a code review
Older revisions
All revisions of this file
File info
Size: 2232 bytes, 102 lines
View raw file
Powered by
Google Project Hosting