結果
問題 | No.1645 AB's abs |
ユーザー | McGregorsh |
提出日時 | 2022-07-23 09:45:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 276 ms / 2,000 ms |
コード長 | 1,862 bytes |
コンパイル時間 | 397 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 93,416 KB |
最終ジャッジ日時 | 2023-09-18 03:31:07 |
合計ジャッジ時間 | 13,076 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
93,052 KB |
testcase_01 | AC | 239 ms
92,848 KB |
testcase_02 | AC | 257 ms
93,284 KB |
testcase_03 | AC | 238 ms
92,892 KB |
testcase_04 | AC | 241 ms
93,008 KB |
testcase_05 | AC | 242 ms
93,160 KB |
testcase_06 | AC | 246 ms
93,224 KB |
testcase_07 | AC | 243 ms
93,060 KB |
testcase_08 | AC | 257 ms
93,080 KB |
testcase_09 | AC | 253 ms
93,032 KB |
testcase_10 | AC | 250 ms
93,296 KB |
testcase_11 | AC | 252 ms
93,292 KB |
testcase_12 | AC | 251 ms
93,028 KB |
testcase_13 | AC | 272 ms
93,376 KB |
testcase_14 | AC | 268 ms
93,164 KB |
testcase_15 | AC | 270 ms
93,072 KB |
testcase_16 | AC | 275 ms
93,356 KB |
testcase_17 | AC | 267 ms
93,344 KB |
testcase_18 | AC | 272 ms
93,212 KB |
testcase_19 | AC | 272 ms
93,048 KB |
testcase_20 | AC | 271 ms
93,200 KB |
testcase_21 | AC | 270 ms
93,128 KB |
testcase_22 | AC | 268 ms
93,024 KB |
testcase_23 | AC | 276 ms
93,260 KB |
testcase_24 | AC | 272 ms
93,416 KB |
testcase_25 | AC | 270 ms
93,244 KB |
testcase_26 | AC | 275 ms
93,036 KB |
testcase_27 | AC | 275 ms
93,260 KB |
testcase_28 | AC | 272 ms
93,344 KB |
testcase_29 | AC | 270 ms
93,040 KB |
testcase_30 | AC | 273 ms
93,288 KB |
testcase_31 | AC | 268 ms
93,084 KB |
testcase_32 | AC | 268 ms
93,080 KB |
testcase_33 | AC | 268 ms
93,084 KB |
testcase_34 | AC | 270 ms
93,080 KB |
testcase_35 | AC | 266 ms
93,168 KB |
testcase_36 | AC | 268 ms
93,028 KB |
testcase_37 | AC | 268 ms
93,124 KB |
testcase_38 | AC | 265 ms
93,128 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] * 10100 for i in range(n+1)] dp[1][A[0]] = 2 for i in range(1, n): for j in range(10100): if j + A[i] <= 10000: dp[i+1][j+A[i]] += dp[i][j] dp[i+1][j+A[i]] %= MOD2 if abs(j - A[i]) >= 0: dp[i+1][abs(j-A[i])] += dp[i][j] dp[i+1][abs(j-A[i])] %= MOD2 #print(dp) ans = 0 for i in range(10100): ans += i * dp[-1][i] ans %= MOD2 print(ans) if __name__ == '__main__': main()