結果
問題 | No.914 Omiyage |
ユーザー | McGregorsh |
提出日時 | 2023-07-09 22:17:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 237 ms / 2,000 ms |
コード長 | 1,647 bytes |
コンパイル時間 | 844 ms |
コンパイル使用メモリ | 86,644 KB |
実行使用メモリ | 90,816 KB |
最終ジャッジ日時 | 2023-10-01 02:23:14 |
合計ジャッジ時間 | 7,897 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
90,764 KB |
testcase_01 | AC | 233 ms
90,740 KB |
testcase_02 | AC | 228 ms
90,288 KB |
testcase_03 | AC | 229 ms
90,600 KB |
testcase_04 | AC | 230 ms
90,728 KB |
testcase_05 | AC | 225 ms
89,720 KB |
testcase_06 | AC | 225 ms
89,784 KB |
testcase_07 | AC | 226 ms
89,736 KB |
testcase_08 | AC | 227 ms
89,796 KB |
testcase_09 | AC | 234 ms
89,764 KB |
testcase_10 | AC | 236 ms
89,932 KB |
testcase_11 | AC | 230 ms
89,928 KB |
testcase_12 | AC | 232 ms
90,816 KB |
testcase_13 | AC | 223 ms
90,748 KB |
testcase_14 | AC | 227 ms
90,768 KB |
testcase_15 | AC | 223 ms
90,064 KB |
testcase_16 | AC | 225 ms
89,724 KB |
testcase_17 | AC | 229 ms
90,672 KB |
testcase_18 | AC | 227 ms
89,804 KB |
testcase_19 | AC | 225 ms
89,736 KB |
testcase_20 | AC | 229 ms
89,760 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, M, K = i_map() A = [i_list() for i in range(N)] dp = [[False] * (K+1) for i in range(N+1)] dp[0][0] = True for i in range(N): for j in range(K+1): if dp[i][j]: for k in range(M): if j + A[i][k] <= K: dp[i+1][j+A[i][k]] = True for i in range(K, -1, -1): if dp[-1][i]: print(K-i) exit() print(-1) if __name__ == '__main__': main()