Submission #1177818

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()

def log(s):
    print(s, flush=True)

def main():
    n = 8

    for t in range(1000):

        de,ti = LI()
        ca = LI()
        am = LI()
        sa = list(ca[i]-am[i] for i in range(n))
        ms = max(sa)

        def ama():
            a = [100 for _ in range(51)]
            ami = [[] for _ in range(51)]
            a[0] = 0
            for i in range(n):
                ai = am[i]
                if ai == 0:
                    continue
                for j in range(50,ai-1,-1):
                    b = a[j-ai]
                    if b > n:
                        continue
                    c = a[j]
                    if 100 > c > b:
                        continue
                    a[j] = b+1
                    ami[j] = ami[j-ai] + [i]

            return [a,ami[de]]

        if ms > 3 and ti > 2 and t < 995:
            log('fill {}'.format(sa.index(ms) + 1))
            continue

        a,aa = ama()

        if a[de] > 99 or de < min(29, (1000-t)**4):
            if min(am) > 0:
                log('pass')
                continue
            if a[de] > 99 and de >= min(29, (1000-t)**4) and ti > 1:
                sai = -1
                sam = 0
                for i in range(n):
                    if a[de-sa[i]] < 99 and sam < sa[i]:
                        sai = i
                        sam = sa[i]
                if sai > -1:
                    log('fill {}'.format(sai+1))
                    continue

            if ms > 3:
                log('fill {}'.format(sa.index(ms) + 1))
                continue
            mc = min(ca)
            log('change {}'.format(ca.index(mc) + 1))
            continue

        log('sell {} {}'.format(len(aa), ' '.join(map(lambda x: str(x + 1), aa))))


main()

Submission Info

Judge Result