結果
問題 | No.1513 simple 門松列 problem |
ユーザー | ansain |
提出日時 | 2021-04-10 20:54:32 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,537 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 12,544 KB |
実行使用メモリ | 10,880 KB |
最終ジャッジ日時 | 2024-10-09 04:31:43 |
合計ジャッジ時間 | 6,223 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
10,752 KB |
testcase_01 | AC | 1,488 ms
10,624 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | AC | 26 ms
10,624 KB |
testcase_10 | AC | 2,173 ms
10,752 KB |
testcase_11 | AC | 38 ms
10,752 KB |
testcase_12 | AC | 40 ms
10,752 KB |
testcase_13 | AC | 1,139 ms
10,624 KB |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
ソースコード
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 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 check2(a): return all(check((x, y, z)) for x, y, z in zip(a, a[1:], a[2:])) def main(): mod = 10**9+7 mod2 = 998244353 n, k = map(int, input().split()) ans=0 ans2=0 assert k**n <= 10**8 for retu in product(range(k), repeat=n): if check2(list(retu)): #print(retu) ans+=1 ans2+=sum(retu) print(ans,ans2) if __name__ == '__main__': main()