学生宿舍分配方案优化

#Student Dorm Optimization
import random
import math

dorms = ['Zeus','Athena','Hercules','Bacchus','Pluto']
prefs = [('Toby',('Bacchus','Hercules')),('Steve',('Zeus','Pluto')),('Andrea',('Andrea','Zeus')),
         ('Sarah',('Zeus','Pluto')),('Dave',('Athena','Bacchus')),('Jeff',('Hercules','Pluto')),
         ('Fred',('Pluto','Athena')),('Suzie',('Bacchus','Hercules')),('Laura',('Bacchus','Hercules')),
         ('Neil',('Hercules','Athena'))]

domain = [(0,(len(dorms)*2)-i-1) for i in range(0,len(dorms)*2)]

def printsolution(vec):
    slots = []
    for i in range(len(dorms)):slots+=[i,i]
    for i in range(len(vec)):
        x=int(vec[i])
        dorm=dorms[slots[x]]
        print prefs[i][0],dorm
        del slots[x]

def dormcost(vec):
    cost=0
    slots=[0,0,1,1,2,2,3,3,4,4]
    for i in range(len(vec)):
        x=int(vec[i])
        dorm=dorms[slots[x]]
        pref=prefs[i][1]
        if pref[0]==dorm:cost+=0
        elif pref[1]==dorm:cost+=1
        else:cost+=3
        del slots[x]
        
    return cost