import sys
sys.path.append("../common")
import aoc

data = aoc.data.split("\n")

def remove_reqs(req, insts):
    for res in insts:
        if req in insts[res]:
            insts[res].remove(req)

def parse_entry(l):
    split = l.split(" ")
    firstl = split[1]
    nextl = split[-3]
    return firstl, nextl

def gen_insts():
    global data
    data = [parse_entry(l) for l in data if len(l) != 0]

    insts = dict()

    for ins in data:
        req = ins[0]
        res = ins[1]
        if res not in insts:
            insts[res] = [ req ]
        else:
            insts[res].append(req)

    values = list(insts.values())[:]
    for reslist in values:
        for res in reslist:
            if res not in insts:
                insts[res] = []

    return insts

def overlap(arr1, arr2):
    for a1 in arr1:
        if a1 in arr2:
            return True
    return False

def checkfail(workers):
    done = True
    for w in workers:
        if w[2]:
            done = False
            break
    return done

def solve1(args):
    insts = gen_insts()

    i = 0
    plan = list()
    while i < len(insts):
        res = sorted(insts.keys())[i] # alphabetically
        if len(insts[res]) == 0:
            plan.append(res)
            insts.pop(res, None)
            remove_reqs(res, insts)
            i = 0
        else:
            i += 1

    return "".join(plan)

def solve2(args):
    insts = gen_insts()

    # worker: (task, time, done)
    workers = [["", 0, False] for x in range(5)]

    time = -1
    stop = False
    while not stop:
        time += 1
        for i in range(len(workers)):
            w = workers[i]
            if time >= w[1]:
                if w[2]:
                    remove_reqs(w[0], insts)
                    aoc.debug("end : " + str(i) + " - " + str((w[0], w[1])))
                    w[2] = False
                    if len(insts) == 0 and checkfail(workers):
                        stop = True
                        break

        for i in range(len(workers)):
            w = workers[i]
            if time >= w[1]:
                for res in sorted(insts.keys()):
                    if len(insts[res]) == 0:
                        wtime = time + ord(res)-65+1 + 60
                        aoc.debug("start : " + str(i) + " - " + str((res, time)))
                        w[:] = (res, wtime, True)
                        insts.pop(res, None)
                        break

    return time

aoc.run(solve1, solve2, sols=["JNOIKSYABEQRUVWXGTZFDMHLPC", 1099])