結果
問題 | No.1231 Make a Multiple of Ten |
ユーザー | McGregorsh |
提出日時 | 2022-07-14 09:18:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 409 ms / 2,000 ms |
コード長 | 1,714 bytes |
コンパイル時間 | 701 ms |
コンパイル使用メモリ | 87,252 KB |
実行使用メモリ | 140,060 KB |
最終ジャッジ日時 | 2023-09-07 21:59:32 |
合計ジャッジ時間 | 8,303 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,540 KB |
testcase_01 | AC | 244 ms
92,360 KB |
testcase_02 | AC | 255 ms
92,508 KB |
testcase_03 | AC | 258 ms
92,428 KB |
testcase_04 | AC | 332 ms
110,076 KB |
testcase_05 | AC | 326 ms
109,572 KB |
testcase_06 | AC | 295 ms
101,408 KB |
testcase_07 | AC | 322 ms
111,780 KB |
testcase_08 | AC | 283 ms
105,992 KB |
testcase_09 | AC | 260 ms
97,332 KB |
testcase_10 | AC | 303 ms
110,444 KB |
testcase_11 | AC | 312 ms
111,644 KB |
testcase_12 | AC | 409 ms
137,880 KB |
testcase_13 | AC | 396 ms
140,060 KB |
testcase_14 | AC | 228 ms
92,380 KB |
testcase_15 | AC | 394 ms
140,028 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): n = int(input()) A = i_list() dp = [[0] * 10 for i in range(n+1)] dp[1][A[0]%10] = 1 for i in range(1, n): for j in range(10): if dp[i][j] > 0: dp[i+1][(j+(A[i]%10))%10] = max(dp[i+1][(j+(A[i]%10))%10], dp[i][j] + 1) dp[i+1][j] = max(dp[i+1][j], dp[i][j]) print(dp[-1][0]) if __name__ == '__main__': main()