結果
問題 | No.2386 Udon Coupon (Easy) |
ユーザー | McGregorsh |
提出日時 | 2023-08-21 13:03:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 272 ms / 2,000 ms |
コード長 | 1,556 bytes |
コンパイル時間 | 1,364 ms |
コンパイル使用メモリ | 86,860 KB |
実行使用メモリ | 92,176 KB |
最終ジャッジ日時 | 2023-08-21 13:03:35 |
合計ジャッジ時間 | 12,918 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
89,944 KB |
testcase_01 | AC | 229 ms
89,776 KB |
testcase_02 | AC | 231 ms
89,820 KB |
testcase_03 | AC | 240 ms
89,980 KB |
testcase_04 | AC | 238 ms
90,004 KB |
testcase_05 | AC | 238 ms
89,892 KB |
testcase_06 | AC | 238 ms
89,872 KB |
testcase_07 | AC | 242 ms
92,176 KB |
testcase_08 | AC | 261 ms
89,964 KB |
testcase_09 | AC | 235 ms
89,840 KB |
testcase_10 | AC | 240 ms
90,996 KB |
testcase_11 | AC | 238 ms
90,540 KB |
testcase_12 | AC | 245 ms
91,608 KB |
testcase_13 | AC | 243 ms
91,760 KB |
testcase_14 | AC | 242 ms
91,708 KB |
testcase_15 | AC | 249 ms
91,628 KB |
testcase_16 | AC | 245 ms
91,416 KB |
testcase_17 | AC | 241 ms
91,772 KB |
testcase_18 | AC | 272 ms
90,956 KB |
testcase_19 | AC | 233 ms
90,396 KB |
testcase_20 | AC | 239 ms
91,144 KB |
testcase_21 | AC | 238 ms
91,776 KB |
testcase_22 | AC | 242 ms
91,136 KB |
testcase_23 | AC | 267 ms
91,064 KB |
testcase_24 | AC | 238 ms
90,644 KB |
testcase_25 | AC | 238 ms
91,320 KB |
testcase_26 | AC | 241 ms
91,692 KB |
testcase_27 | AC | 239 ms
91,644 KB |
testcase_28 | AC | 268 ms
91,056 KB |
testcase_29 | AC | 238 ms
90,784 KB |
testcase_30 | AC | 238 ms
90,472 KB |
testcase_31 | AC | 238 ms
91,036 KB |
testcase_32 | AC | 235 ms
90,508 KB |
testcase_33 | AC | 265 ms
92,068 KB |
testcase_34 | AC | 244 ms
91,064 KB |
testcase_35 | AC | 242 ms
91,476 KB |
testcase_36 | AC | 243 ms
91,808 KB |
testcase_37 | AC | 241 ms
91,580 KB |
testcase_38 | AC | 245 ms
91,172 KB |
testcase_39 | AC | 240 ms
91,120 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 = int(input()) A, B, C = i_map() dp = [0] * (N+1) for i in range(N): if i + 3 <= N: dp[i+3] = max(dp[i+3], dp[i] + A) if i + 5 <= N: dp[i+5] = max(dp[i+5], dp[i] + B) if i + 10 <= N: dp[i+10] = max(dp[i+10], dp[i] + C) print(dp[N]) if __name__ == '__main__': main()