結果

問題 No.1516 simple 門松列 problem Re:MASTER
ユーザー ansainansain
提出日時 2021-04-11 01:45:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,692 ms / 6,000 ms
コード長 2,624 bytes
コンパイル時間 426 ms
コンパイル使用メモリ 82,364 KB
実行使用メモリ 90,368 KB
最終ジャッジ日時 2024-10-09 04:26:52
合計ジャッジ時間 22,120 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
55,168 KB
testcase_01 AC 324 ms
77,696 KB
testcase_02 AC 1,980 ms
82,560 KB
testcase_03 AC 54 ms
63,744 KB
testcase_04 AC 53 ms
63,360 KB
testcase_05 AC 60 ms
66,688 KB
testcase_06 AC 141 ms
76,808 KB
testcase_07 AC 366 ms
78,208 KB
testcase_08 AC 513 ms
78,464 KB
testcase_09 AC 51 ms
62,848 KB
testcase_10 AC 148 ms
77,056 KB
testcase_11 AC 65 ms
69,248 KB
testcase_12 AC 53 ms
64,000 KB
testcase_13 AC 52 ms
63,104 KB
testcase_14 AC 4,025 ms
88,320 KB
testcase_15 AC 1,896 ms
84,096 KB
testcase_16 AC 928 ms
81,440 KB
testcase_17 AC 376 ms
77,824 KB
testcase_18 AC 141 ms
76,528 KB
testcase_19 AC 91 ms
75,904 KB
testcase_20 AC 4,692 ms
90,368 KB
testcase_21 AC 4,602 ms
89,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def calc(a1, a2, b1, b2, k, mod):
    c1 = [[[[0]*k for y in range(k)] for x in range(k)] for w in range(k)]
    c2 = [[[[0]*k for y in range(k)] for x in range(k)] for w in range(k)]
    for a, b, c, d, e, f in product(range(k), repeat=6):
        c1[a][b][e][f] += a1[a][b][c][d]*b1[c][d][e][f]
        c2[a][b][e][f] += a1[a][b][c][d] * \
            b2[c][d][e][f]+a2[a][b][c][d]*b1[c][d][e][f]
        c1[a][b][e][f] %= mod
        c2[a][b][e][f] %= mod
    return c1, c2


def check(a):
    return a[0] != a[1] and a[1] != a[2] and a[2] != a[0] and a[1] in [max(a), min(a)]


def main():
    mod = 10**9+7
    mod2 = 998244353
    n, k = map(int, input().split())
    a1 = [[[[int(x == y and check((w, x, z))) for z in range(k)]
            for y in range(k)] for x in range(k)] for w in range(k)]
    a2 = [[[[int(x == y and check((w, x, z)))*z for z in range(k)]
            for y in range(k)] for x in range(k)] for w in range(k)]
    ans1 = None
    ans2 = None
    n-=2
    while n:
        n, i = divmod(n, 2)
        if i:
            if ans1:
                ans1, ans2 = calc(ans1, ans2, a1, a2, k, mod2)
            else:
                ans1, ans2 = a1[:][:][:][:], a2[:][:][:][:]
        a1, a2 = calc(a1, a2, a1, a2, k, mod2)
    sumans1 = sum(sum(sum(sum(c) for c in b) for b in a) for a in ans1) % mod2
    sumans2 = 0
    for w in range(k):
        for x in range(k):
            sumans2 += sum(sum(y) for y in ans2[w][x])+(w+x)*sum(sum(y) for y in ans1[w][x])
    print(sumans1, sumans2 % mod2)


if __name__ == '__main__':
    main()
0