Problem:
   Problem Statement AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.   The satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.  Holding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i} .  If a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i , and at the end of each day d=1,2,...,D , the satisfaction decreases as follows. Let \mathrm{last}(d,i) be the last day before day d (including d ) on which a contest of type i was held. If contests of type i have never been held yet, we define \mathrm{last}(d,i)=0 . At the end of day d , the satisfaction decreases by \sum _{i=1}^{26}c_i \times (d-\mathrm{last}(d,i)) .   Please schedule contests on behalf of AtCoder.
If the satisfaction at the end of day D is S , you will get a score of \max(10^6 + S, 0) .
There are 50 test cases, and the score of a submission is the total scores for each test case.
You can make submissions multiple times, and the highest score among your submissions will be your score.      Constraints  D = 365  Each c_i is an integer satisfying 0\leq c_i \leq 100 .  Each s_{d,i} is an integer satisfying 0\leq s_{d,i} \leq 20000 .         Input Input is given from Standard Input in the following format:  D  c_1  c_2  \cdots  c_{26}  s_{1,1}  s_{1,2}  \cdots  s_{1,26}  \vdots  s_{D,1}  s_{D,2}  \cdots  s_{D,26}       Output Let t_d ( 1\leq t_d \leq 26 ) be the type of the contest that will be held at day d .
Print D integers t_d to Standard Output in the following format:  t_1  t_2  \vdots  t_D   Any output that does not follow the above format may result in 0 points WA for that test case.      Input Generation Each integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.        Sample Input 1 5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192      Sample Output 1 1
17
13
14
13  Note that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.  Input generator, score calculator, and visualizer      Beginner's Guide If you don't know what to do, proceed to problem B or C.

Solution (Python):
from random import choice
from random import random
from time import time


class Optimizer:
    def __init__(self, C, S):
        self.C = C
        self.S = S
        X = []
        L = [-1] * 26
        for i in range(365):
            max_diff = -10**10
            best_j = 0
            for j in range(26):
                memo = L[j]
                L[j] = i
                diff = self.S[i][j] - \
                    sum([self.C[jj] * (i - L[jj]) for jj in range(26)])
                if diff > max_diff:
                    max_diff = diff
                    best_j = j
                L[j] = memo
            L[best_j] = i
            X.append(best_j)
        self.X = X

    def calc_score(self):
        score = 0
        L = [-1 for j in range(26)]
        A = [0 for j in range(26)]
        for i in range(365):
            score += self.S[i][self.X[i]]
            A[self.X[i]] += (i - L[self.X[i]]) * \
                (i - L[self.X[i]] - 1) // 2
            L[self.X[i]] = i
        for j in range(26):
            A[j] += (365 - L[j]) * (365 - L[j] - 1) // 2
            score -= self.C[j] * A[j]
        return score

    def optimize(self, temp, threp, interval, start_time, lim=1.8):
        max_score = self.calc_score()
        while True:
            t = (time() - start_time) / 2
            if random() < threp:
                i = choice(range(365))
                j = choice(range(26))
                memo = self.X[i]
                self.X[i] = j
                new_score = self.calc_score()
                if new_score > max_score:
                    max_score = new_score
                elif random() < pow(2.7, (new_score - max_score) / pow(2000, 1 - t)):
                    max_score = new_score
                else:
                    self.X[i] = memo
            else:
                a = choice(range(interval))
                i0 = choice(range(365 - a))
                i1 = i0 + a
                self.X[i0], self.X[i1] = self.X[i1], self.X[i0]
                new_score = self.calc_score()
                if new_score > max_score:
                    max_score = new_score
                elif random() < pow(2.7, (new_score - max_score) / pow(2000, 1 - t)):
                    max_score = new_score
                else:
                    self.X[i0], self.X[i1] = self.X[i1], self.X[i0]
            if time() - start_time > lim:
                break
        return max(max_score + 10**6, 0)


if __name__ == "__main__":
    d = int(input())
    *C, = map(int, input().split())
    S = [list(map(int, input().split())) for i in range(d)]
    start_time = time()
    opt = Optimizer(C, S)
    opt.optimize(400, 0.8, 10, start_time)
    for x in opt.X:
        print(x + 1)

Solution (Python):
from random import choice
from random import random
from time import time


class Optimizer:
    def __init__(self, C, S):
        self.C = C
        self.S = S
        X = []
        L = [-1] * 26
        for i in range(365):
            max_diff = -10**10
            best_j = 0
            for j in range(26):
                memo = L[j]
                L[j] = i
                diff = self.S[i][j] - \
                    sum([self.C[jj] * (i - L[jj]) for jj in range(26)])
                if diff > max_diff:
                    max_diff = diff
                    best_j = j
                L[j] = memo
            L[best_j] = i
            X.append(best_j)
        self.X = X

    def calc_score(self):
        score = 0
        L = [-1 for j in range(26)]
        A = [0 for j in range(26)]
        for i in range(365):
            score += self.S[i][self.X[i]]
            A[self.X[i]] += (i - L[self.X[i]]) * \
                (i - L[self.X[i]] - 1) // 2
            L[self.X[i]] = i
        for j in range(26):
            A[j] += (365 - L[j]) * (365 - L[j] - 1) // 2
            score -= self.C[j] * A[j]
        return score

    def optimize(self, temp, threp, interval, start_time, lim=1.8):
        max_score = self.calc_score()
        while True:
            t = (time() - start_time) / 2
            if random() < threp:
                i = choice(range(365))
                j = choice(range(26))
                memo = self.X[i]
                self.X[i] = j
            else:
                a = choice(range(interval))
                i0 = choice(range(365 - a))
                i1 = i0 + a
                self.X[i0], self.X[i1] = self.X[i1], self.X[i0]
            new_score = self.calc_score()
            if new_score > max_score:
                max_score = new_score
            elif random() < pow(2.7, (new_score - max_score) / pow(2000, 1 - t)):
                max_score = new_score
            else:
                try:
                    self.X[i0], self.X[i1] = self.X[i1], self.X[i0]
                except BaseException:
                    self.X[i] = memo
            if time() - start_time > lim:
                break
        return max(max_score + 10**6, 0)


if __name__ == "__main__":
    d = int(input())
    *C, = map(int, input().split())
    S = [list(map(int, input().split())) for i in range(d)]
    opt = Optimizer(C, S)
    opt.optimize(400, 0.8, 10, time(), lim=1.8)
    for x in opt.X:
        print(x + 1)

Solution (Python):
import random

def down_score(d, c, last_d, score):
    sum = 0
    for i in range(26):
        sum += c[i]*(d-last_d[i])
        
    return (score - sum)

def main():
    D = int(input())

    c = list(map(int, input().split()))

    s = [list(map(int, input().split())) for i in range(D)]

    

    

    last_d = [0 for i in range(26)]
    
    ans = []
    
    score = 0
    
    for i in range(D):
        max = 0
        idx = 0
        for j in range(26):
            if max < (s[i][j] + c[j] * (i-last_d[j])) and c[j] != 0:
                max = s[i][j] + c[j] * (i-last_d[j])
                idx = j
            elif max == (s[i][j] + c[j] * (i-last_d[j])) and c[j] > c[idx]:
                idx = j
        last_d[idx] = i+1
        score += s[i][j]
        down_score(i+1,c,last_d,score)
        
        ans.append(idx)

    for i in range(D):
        print(ans[i]+1)

if __name__ == "__main__":
    main()

Solution (Python):



from time import time
t0 = time()

import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


INF = 2**31  

from bisect import bisect_left, bisect_right, insort_left
from random import randint, random
from math import exp

D = a_int()
C = ints()
S = read_tuple(D)


def annealing(oldscore, newscore, T):
    '''p(newscore-oldscore,T)=min(1,exp((newscore-oldscore)/T)) の確率でnewscoreを採用する
    newが選ばれた時はTrueを返す'''
    if oldscore < newscore:
        return True
    else:
        p = exp((newscore - oldscore) / T)
        return random() < p


def T_to_date_by_contest(T):
    '''Tを日付形式にしつつscoreも計算'''
    date_by_contest = [[-1] for _ in range(26)]
    for d, t in enumerate(T):
        date_by_contest[t].append(d)
    for i in range(26):
        date_by_contest[i].append(D)  
    return date_by_contest


def eval(D, C, S, date_by_contest):
    '''2~3*D回のループでスコアを計算する'''
    score = 0
    for c, dates in enu(date_by_contest):
        for d in dates[1:-1]:
            score += S[d][c]
        for i in range(len(dates) - 1):
            dd = (dates[i + 1] - dates[i])
            
            
            score -= C[c] * (dd - 1) * dd // 2
    return score


def maximizer(newT, bestT, bestscore):
    '''具体的なTの最大化用'''
    tmpscore = eval(D, C, S, T_to_date_by_contest(newT))
    if tmpscore > bestscore:
        return newT, tmpscore
    else:
        return bestT, bestscore


def ret_init_T():
    '''greedyで作ったTを初期値とする。
    return
    ----------
    T, score ... 初期のTとそのTで得られるscore
    '''
    def _make_T(n_days):
        
        
        T = []
        last = [-1] * 26
        for d in range(D):
            ma = -INF
            for i in range(26):
                tmp = S[d][i]
                dd = d - last[i]
                tmp += C[i] * (((dd + n_days + dd) * (n_days) // 2))
                if tmp > ma:
                    t = i
                    ma = tmp
            last[t] = d  
            T.append(t)
        return T
    T = _make_T(3)
    sco = eval(D, C, S, T_to_date_by_contest(T))
    for i in range(4, 13):
        T, sco = maximizer(_make_T(i), T, sco)
    return T, sco


class Schedule:
    def __init__(self, T: list, date_by_contest, score: int):
        self.T = T
        self.date_by_contest = date_by_contest
        self.score = score

    def try_change_contest(self, d, j):
        '''d日目をjに変更したときのscore'''
        score = self.score
        i = self.T[d]  
        if i == j:
            return score  
        score += S[d][j] - S[d][i]

        
        
        d_i_idx = self.date_by_contest[i].index(d)  
        dd = self.date_by_contest[i][d_i_idx + 1] - \
            self.date_by_contest[i][d_i_idx - 1]
        score -= C[i] * (dd - 1) * dd // 2
        dd = self.date_by_contest[i][d_i_idx + 1] - d
        score += C[i] * (dd - 1) * dd // 2
        dd = d - self.date_by_contest[i][d_i_idx - 1]
        score += C[i] * (dd - 1) * dd // 2
        
        d_j_idx = bisect_left(self.date_by_contest[j], d)
        dd = self.date_by_contest[j][d_j_idx] - \
            self.date_by_contest[j][d_j_idx - 1]
        score += C[j] * (dd - 1) * dd // 2
        dd = self.date_by_contest[j][d_j_idx] - d
        score -= C[j] * (dd - 1) * dd // 2
        dd = d - self.date_by_contest[j][d_j_idx - 1]
        score -= C[j] * (dd - 1) * dd // 2
        return score

    def change_contest(self, d, j):
        '''d日目をjに変更する'''
        self.score = self.try_change_contest(d, j)
        i = self.T[d]
        self.T[d] = j
        self.date_by_contest[i].remove(d)
        insort_left(self.date_by_contest[j], d)


def trial(sche, thre_p, days_near, Tt):
    '''確率的にどちらかの操作を行ってよかったらScheduleを更新する
    1.日付dとコンテストqをランダムに選びd日目に開催するコンテストのタイプをqに変更する
    2.10日以内の点でコンテストを入れ替える
    thre_pはどちらの行動を行うかを調節、days_nearは近さのパラメータ'''
    if random() < thre_p:
        
        d = randint(0, D - 1)
        q = randint(0, 25)
        if annealing(sche.score, sche.try_change_contest(d, q), Tt):
            sche.change_contest(d, q)
        return sche  
    else:
        T = sche.T.copy()
        i = randint(0, D - 2)
        j = randint(i - days_near, i + days_near)
        j = max(j, 0)
        j = min(j, D - 1)
        if i == j:
            j += 1
        T[i], T[j] = T[j], T[i]
        new_score = eval(D, C, S, T_to_date_by_contest(T))
        if annealing(sche.score, new_score, Tt):
            return Schedule(T, T_to_date_by_contest(T), new_score)
        else:
            return sche


bestT, bestscore = ret_init_T()
sche = Schedule(bestT, T_to_date_by_contest(bestT), bestscore)

T0 = 400
T1 = 5
TL = 1.91

now = time()
while now - t0 < TL:
    Tt = (T0**((now - t0) / TL)) * (T1**(1 - (now - t0) / TL))
    for _ in range(3000):
        sche = trial(sche, 0.8, 20, Tt)
    now = time()



print(*mina(*sche.T, sub=-1), sep='\n')

Solution (Python):


from time import perf_counter
limit = 1.92
tick = perf_counter()

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from random import randrange
from bisect import bisect


def resolve():
    G = 26
    it = map(int, sys.stdin.read().split())
    D = next(it)
    C = [next(it) for i in range(G)]
    S = [[next(it) for i in range(G)] for i in range(D)]
    L = [[-1] for i in range(G)]
    T = [0] * D

    def update(di, qi):
        score = 0
        t0 = T[di]
        score += S[di][qi]-S[di][t0]

        a1 = li = L[t0][:]
        ii = li.index(di)
        la = D if len(li)-1 == ii else li[ii+1]
        score -= C[t0] * (di-li[ii-1])*(la-di)
        li.pop(ii)

        a2 = li = L[qi][:]
        ii = bisect(li, di)
        li.insert(ii, di)
        la = D if len(li)-1 == ii else li[ii+1]
        score += C[qi] * (di-li[ii-1])*(la-di)

        return score, (a1, a2)

    U = 7
    def calc(i, j):
        score = S[i][j]
        for k in range(G):
            u = k - L[k][-1]
            score -= C[k] * (u + u + U) * U // 2
        score += C[k] * U * (i-L[j][-1])
        return score

    def dswap(di, dj):
        qi, qj = T[di], T[dj]
        swap0 = (L[qi], L[qj])

        score, swap1 = update(di, qj)
        T[di] = qj
        L[qi], L[qj] = swap1
        diff, swap2 = update(dj, qi)

        score += diff

        if score > 0:
            T[dj] = qi
            L[qj], L[qi] = swap2
        else:
            score = 0
            T[di], T[dj] = qi, qj
            L[qi], L[qj] = swap0
        return score

    def fullscore():
        score = 0
        last = [-1] * 26
        for i, ti in enumerate(T):
            score += S[i][ti]
            last[ti] = i
            for ci, la in zip(C, last):
                score -= ci * (i-la)
        return score

    for di in range(D):
        i, score = 0, calc(di, 0)
        for qi in range(1, G):
            x = calc(di, qi)
            if x > score:
                i, score = qi, x
        T[di] = i
        L[i].append(di)

    t = 0
    
    while t < limit:
        ab = randrange(0, 100)
        if ab > 50:
            di, qi = randrange(0, D), randrange(0, G)
            diff, swap = update(di, qi)
            if diff > 0:
                
                q0, T[di] = T[di], qi
                L[q0], L[qi] = swap
        else:
            di = randrange(0, (D-1)//2)
            dj = randrange(di+1, D)
            diff = dswap(di, dj)
            
        t = perf_counter() - tick

    print(*(i+1 for i in T), sep="\n")



if __name__ == "__main__":
    resolve()

Solution (Python):


from time import perf_counter
limit = 1.92
tick = perf_counter()

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from random import randrange
from bisect import bisect


def resolve():
    G = 26
    it = map(int, sys.stdin.read().split())
    D = next(it)
    C = [next(it) for i in range(G)]
    S = [[next(it) for i in range(G)] for i in range(D)]
    L = [[-1] for i in range(G)]
    T = [0] * D

    def update(di, qi):
        score = 0
        t0 = T[di]
        score += S[di][qi]-S[di][t0]

        a1 = li = L[t0][:]
        ii = li.index(di)
        la = D if len(li)-1 == ii else li[ii+1]
        score -= C[t0] * (di-li[ii-1])*(la-di)
        li.pop(ii)

        a2 = li = L[qi][:]
        ii = bisect(li, di)
        li.insert(ii, di)
        la = D if len(li)-1 == ii else li[ii+1]
        score += C[qi] * (di-li[ii-1])*(la-di)

        return score, (a1, a2)

    U = 7
    def calc(i, j):
        score = S[i][j]
        for k in range(G):
            u = k - L[k][-1]
            score -= C[k] * (u + u + U) * U // 2
        score += C[k] * U * (i-L[j][-1])
        return score

    def dswap(di, dj):
        qi, qj = T[di], T[dj]
        swap0 = (L[qi], L[qj])

        score, swap1 = update(di, qj)
        T[di] = qj
        L[qi], L[qj] = swap1
        diff, swap2 = update(dj, qi)

        score += diff

        if score > 0:
            T[dj] = qi
            L[qj], L[qi] = swap2
        else:
            score = 0
            T[di], T[dj] = qi, qj
            L[qi], L[qj] = swap0
        return score

    def fullscore():
        score = 0
        last = [-1] * 26
        for i, ti in enumerate(T):
            score += S[i][ti]
            last[ti] = i
            for ci, la in zip(C, last):
                score -= ci * (i-la)
        return score

    for di in range(D):
        i, score = 0, calc(di, 0)
        for qi in range(1, G):
            x = calc(di, qi)
            if x > score:
                i, score = qi, x
        T[di] = i
        L[i].append(di)


    print(*(i+1 for i in T), sep="\n")



if __name__ == "__main__":
    resolve()

Solution (Python):



from time import time
t0 = time()

import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


INF = 2**31  

from bisect import bisect_left, bisect_right, insort_left
from random import randint, random
from math import exp

D = a_int()
C = ints()
S = read_tuple(D)


def annealing(oldscore, newscore, T):
    '''p(newscore-oldscore,T)=min(1,exp((newscore-oldscore)/T)) の確率でnewscoreを採用する
    newが選ばれた時はTrueを返す'''
    if oldscore < newscore:
        return True
    else:
        p = exp((newscore - oldscore) / T)
        return random() < p


def T_to_date_by_contest(T):
    '''Tを日付形式にしつつscoreも計算'''
    date_by_contest = [[-1] for _ in range(26)]
    for d, t in enumerate(T):
        date_by_contest[t].append(d)
    for i in range(26):
        date_by_contest[i].append(D)  
    return date_by_contest


def eval(D, C, S, date_by_contest):
    '''2~3*D回のループでスコアを計算する'''
    score = 0
    for c, dates in enu(date_by_contest):
        for d in dates[1:-1]:
            score += S[d][c]
        for i in range(len(dates) - 1):
            dd = (dates[i + 1] - dates[i])
            
            
            score -= C[c] * (dd - 1) * dd // 2
    return score


def maximizer(newT, bestT, bestscore):
    '''具体的なTの最大化用'''
    tmpscore = eval(D, C, S, T_to_date_by_contest(newT))
    if tmpscore > bestscore:
        return newT, tmpscore
    else:
        return bestT, bestscore


def ret_init_T():
    '''greedyで作ったTを初期値とする。
    return
    ----------
    T, score ... 初期のTとそのTで得られるscore
    '''
    def _make_T(n_days):
        
        
        T = []
        last = [-1] * 26
        for d in range(D):
            ma = -INF
            for i in range(26):
                tmp = S[d][i]
                dd = d - last[i]
                tmp += C[i] * (((dd + n_days + dd) * (n_days) // 2))
                if tmp > ma:
                    t = i
                    ma = tmp
            last[t] = d  
            T.append(t)
        return T
    T = _make_T(2)
    sco = eval(D, C, S, T_to_date_by_contest(T))
    for i in range(3, 16):
        T, sco = maximizer(_make_T(i), T, sco)
    return T, sco


class Schedule:
    def __init__(self, T: list, date_by_contest, score: int):
        self.T = T
        self.date_by_contest = date_by_contest
        self.score = score

    def try_change_contest(self, d, j):
        '''d日目をjに変更したときのscore'''
        score = self.score
        i = self.T[d]  
        if i == j:
            return score  
        score += S[d][j] - S[d][i]

        
        
        d_i_idx = self.date_by_contest[i].index(d)  
        dd = self.date_by_contest[i][d_i_idx + 1] - \
            self.date_by_contest[i][d_i_idx - 1]
        score -= C[i] * (dd - 1) * dd // 2
        dd = self.date_by_contest[i][d_i_idx + 1] - d
        score += C[i] * (dd - 1) * dd // 2
        dd = d - self.date_by_contest[i][d_i_idx - 1]
        score += C[i] * (dd - 1) * dd // 2
        
        d_j_idx = bisect_left(self.date_by_contest[j], d)
        dd = self.date_by_contest[j][d_j_idx] - \
            self.date_by_contest[j][d_j_idx - 1]
        score += C[j] * (dd - 1) * dd // 2
        dd = self.date_by_contest[j][d_j_idx] - d
        score -= C[j] * (dd - 1) * dd // 2
        dd = d - self.date_by_contest[j][d_j_idx - 1]
        score -= C[j] * (dd - 1) * dd // 2
        return score

    def change_contest(self, d, j):
        '''d日目をjに変更する'''
        self.score = self.try_change_contest(d, j)
        i = self.T[d]
        self.T[d] = j
        self.date_by_contest[i].remove(d)
        insort_left(self.date_by_contest[j], d)


def trial(sche, thre_p, days_near, Tt):
    '''確率的にどちらかの操作を行ってよかったらScheduleを更新する
    1.日付dとコンテストqをランダムに選びd日目に開催するコンテストのタイプをqに変更する
    2.10日以内の点でコンテストを入れ替える
    thre_pはどちらの行動を行うかを調節、days_nearは近さのパラメータ'''
    if random() < thre_p:
        
        d = randint(0, D - 1)
        q = randint(0, 25)
        if annealing(sche.score, sche.try_change_contest(d, q), Tt):
            sche.change_contest(d, q)
        return sche  
    else:
        T = sche.T.copy()
        i = randint(0, D - 2)
        j = randint(i - days_near, i + days_near)
        j = max(j, 0)
        j = min(j, D - 1)
        if i == j:
            j += 1
        T[i], T[j] = T[j], T[i]
        new_score = eval(D, C, S, T_to_date_by_contest(T))
        if annealing(sche.score, new_score, Tt):
            return Schedule(T, T_to_date_by_contest(T), new_score)
        else:
            return sche


bestT, bestscore = ret_init_T()
sche = Schedule(bestT, T_to_date_by_contest(bestT), bestscore)

T0 = 200
T1 = 1
TL = 1.91
now = time()
while now - t0 < TL:
    Tt = (T0**((now - t0) / TL)) * (T1**(1 - (now - t0) / TL))
    for _ in range(3000):
        sche = trial(sche, 0.9, 13, Tt)
    now = time()



print(*mina(*sche.T, sub=-1), sep='\n')

Solution (Python):


from time import perf_counter
limit = 1.92
tick = perf_counter()

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from random import randrange
from bisect import bisect


def resolve():
    G = 26
    it = map(int, sys.stdin.read().split())
    D = next(it)
    C = [next(it) for i in range(G)]
    S = [[next(it) for i in range(G)] for i in range(D)]
    L = [[-1] for i in range(G)]
    T = [0] * D

    def update(di, qi):
        score = 0
        t0 = T[di]
        score += S[di][qi]-S[di][t0]

        a1 = li = L[t0][:]
        ii = li.index(di)
        la = D if len(li)-1 == ii else li[ii+1]
        score -= C[t0] * (di-li[ii-1])*(la-di)
        li.pop(ii)

        a2 = li = L[qi][:]
        ii = bisect(li, di)
        li.insert(ii, di)
        la = D if len(li)-1 == ii else li[ii+1]
        score += C[qi] * (di-li[ii-1])*(la-di)

        return score, (a1, a2)

    U = 7
    def calc(i, j):
        score = S[i][j]
        for k in range(G):
            u = k - L[k][-1]
            score -= C[k] * (u + u + U) * U // 2
        score += C[k] * U * (i-L[j][-1])
        return score

    def dswap(di, dj):
        qi, qj = T[di], T[dj]
        swap0 = (L[qi], L[qj])

        score, swap1 = update(di, qj)
        T[di] = qj
        L[qi], L[qj] = swap1
        diff, swap2 = update(dj, qi)

        score += diff

        if score > 0:
            T[dj] = qi
            L[qj], L[qi] = swap2
        else:
            score = 0
            T[di], T[dj] = qi, qj
            L[qi], L[qj] = swap0
        return score

    def fullscore():
        score = 0
        last = [-1] * 26
        for i, ti in enumerate(T):
            score += S[i][ti]
            last[ti] = i
            for ci, la in zip(C, last):
                score -= ci * (i-la)
        return score

    for di in range(D):
        i, score = 0, calc(di, 0)
        for qi in range(1, G):
            x = calc(di, qi)
            if x > score:
                i, score = qi, x
        T[di] = i
        L[i].append(di)

    t = 0
    AB = 1
    score = fullscore()
    while t < limit:
        ab = randrange(0, AB)
        if ab > 50:
            di, qi = randrange(0, D), randrange(0, G)
            diff, swap = update(di, qi)
            if diff > 0:
                score += diff
                q0, T[di] = T[di], qi
                L[q0], L[qi] = swap
            else:
                if AB > 2:
                    AB -= 1
        else:
            di = randrange(0, (D-1)//2)
            dj = randrange(di+1, D)
            diff = dswap(di, dj)
            if diff > 0:
                score += diff
                AB = 100
        t = perf_counter() - tick


    print(*(i+1 for i in T), sep="\n")


if __name__ == "__main__":
    resolve()

Solution (Python):


from time import perf_counter
limit = 1.92
tick = perf_counter()

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from random import randrange
from bisect import bisect


def resolve():
    G = 26
    it = map(int, sys.stdin.read().split())
    D = next(it)
    C = [next(it) for i in range(G)]
    S = [[next(it) for i in range(G)] for i in range(D)]
    L = [[-1] for i in range(G)]
    T = [0] * D

    def update(di, qi):

        score = 0
        t0 = T[di]
        score += S[di][qi]-S[di][t0]

        a1 = li = L[t0][:]
        ii = li.index(di)
        la = D if len(li)-1 == ii else li[ii+1]
        score -= C[t0] * (di-li[ii-1])*(la-di)
        li.pop(ii)

        a2 = li = L[qi][:]
        ii = bisect(li, di)
        li.insert(ii, di)
        la = D if len(li)-1 == ii else li[ii+1]
        score += C[qi] * (di-li[ii-1])*(la-di)

        return score, (a1, a2)

    U = 7
    def calc(i, j):
        score = S[i][j]
        for k in range(G):
            u = k - L[k][-1]
            score -= C[k] * (u + u + U) * U // 2
        score += C[k] * U * (i-L[j][-1])
        return score

    for di in range(D):
        i, score = 0, calc(di, 0)
        for qi in range(1, G):
            x = calc(di, qi)
            if x > score:
                i, score = qi, x
        T[di] = i
        L[i].append(di)

    def dswap(di, dj):
        qi, qj = T[di], T[dj]
        swap0 = (L[qi], L[qj])

        score, swap1 = update(di, qj)
        T[di] = qj
        L[qi], L[qj] = swap1
        diff, swap2 = update(dj, qi)

        score += diff

        if score > 0:
            T[dj] = qi
            L[qj], L[qi] = swap2
        else:
            score = 0
            T[di], T[dj] = qi, qj
            L[qi], L[qj] = swap0
        return score

    t = 0
    while t < limit:
        if False:
            di, qi = randrange(0, D), randrange(0, G)
            diff, swap = update(di, qi)
            if diff > 0:
                score += diff
                q0, T[di] = T[di], qi
                L[q0], L[qi] = swap
                raise 1
            t = perf_counter() - t
        else:
            di = randrange(0, D-1)
            dj = randrange(di+1, D)
            diff = dswap(di, dj)
            if diff > 0:
                score += diff
        t = perf_counter() - tick

    print(*(i+1 for i in T), sep="\n")

if __name__ == "__main__":
    resolve()