SRM145 DIV1 600

有关vending machine (自动售货机) 的模拟题，需要吐槽的是：能够转的自动售货机？你找一个出来给我看看

总之，虽然现在觉得意思明白，但是在写代码之前只觉得题目莫名其妙

class VendingMachine:
    def motorUse(self, prices, purchases):
        machine = Machine(prices)
        lastBuyTime = 0

        machine.moveToMaxPrice()
        for i in range(0, len(purchases)):
            pur = processPurchase(purchases[i])
            if pur[2] - lastBuyTime >= 5:
                machine.moveToMaxPrice()
            lastBuyTime = pur[2]
            if machine.pick(pur[0], pur[1]) == -1:
                return -1
        machine.moveToMaxPrice()
        
        return machine.motoUse()
            

def processPurchase(string):
    s1 = string.find(',')
    s2 = string.find(':')
    shelf = int(string[0:s1])
    column = int(string[s1+1:s2])
    time = int(string[s2+1:])
    return (shelf, column, time)


class Machine:
    def __init__(self, prices):
        self._column = []
        self._motoUse = 0
        self._curPlace = 0
        
        totalColumn = len(prices[0].split(' '))
        for i in range(0, totalColumn):
            self._column.append(Column())
            
        for shelfIndex in range(0, len(prices)):
            string = prices[shelfIndex]
            p = string.split(' ')
            p = [int(numStr) for numStr in p]
            for columnIndex in range(0, len(p)):
                self._column[columnIndex].append(p[columnIndex])                


    def motoUse(self):
        return self._motoUse


    # 返回-1表示无效
    def pick(self, shelfIndex, columnIndex):
        price = self._column[columnIndex].pickShelf(shelfIndex)
        if price == -1:
            return -1
        self._moveTo(columnIndex)
        return True
        
    def moveToMaxPrice(self):
        place = self._findMaxPrice()
        self._moveTo(place)

    def _moveTo(self, place):
        self._motoUse += self._countMinMove(place, self._curPlace)
        self._curPlace = place
        
    def _countMinMove(self, place1, place2):
        offset = abs(place1 - place2)
        return min(offset, len(self._column) - offset)

    def _findMaxPrice(self):
        maxNum = -999
        index = -999
        for i in range(0, len(self._column)):
            if self._column[i].totalPrice() > maxNum:
                maxNum = self._column[i].totalPrice()
                index = i
        return index


class Column:
    def __init__(self):
        self._totalPrice = 0
        self._shelf = []

    def totalPrice(self):
        return self._totalPrice

    def pickShelf(self, index):
        price = self._shelf[index]
        if price == -1:
            return -1
        else:
            self._totalPrice -= price
            self._shelf[index] = -1
            return price

    def append(self, price):
        self._totalPrice += price
        self._shelf.append(price)





# test
o = VendingMachine()
m = Machine(("100 100 100", ))
assert(len(m._column) == 3)


# test case
assert(o.motorUse(("100 100 100", ), ("0,0:0", "0,2:5", "0,1:10")) == 4)
assert(o.motorUse(("100 200 300 400 500 600", ),
("0,2:0", "0,3:5", "0,1:10", "0,4:15")) == 17)
assert(o.motorUse(("100 100 100", ), ("0,0:10", "0,0:11")) == -1)
assert(o.motorUse(("100 200 300",
 "600 500 400"), ("0,0:0", "1,1:10", "1,2:20",
 "0,1:21", "1,0:22", "0,2:35")) == 6)

 感觉代码写的有点太多了，比赛的时候肯定没时间写