結果
問題 | No.2386 Udon Coupon (Easy) |
ユーザー | cleantted |
提出日時 | 2023-04-26 21:41:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 168 ms / 2,000 ms |
コード長 | 1,409 bytes |
コンパイル時間 | 1,891 ms |
コンパイル使用メモリ | 81,916 KB |
実行使用メモリ | 91,408 KB |
最終ジャッジ日時 | 2023-10-18 00:37:44 |
合計ジャッジ時間 | 9,133 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 159 ms
90,992 KB |
testcase_01 | AC | 153 ms
90,992 KB |
testcase_02 | AC | 154 ms
90,996 KB |
testcase_03 | AC | 152 ms
90,992 KB |
testcase_04 | AC | 157 ms
90,992 KB |
testcase_05 | AC | 153 ms
90,996 KB |
testcase_06 | AC | 154 ms
90,996 KB |
testcase_07 | AC | 158 ms
91,380 KB |
testcase_08 | AC | 153 ms
90,992 KB |
testcase_09 | AC | 153 ms
91,000 KB |
testcase_10 | AC | 162 ms
91,376 KB |
testcase_11 | AC | 157 ms
91,376 KB |
testcase_12 | AC | 160 ms
91,388 KB |
testcase_13 | AC | 163 ms
91,388 KB |
testcase_14 | AC | 163 ms
91,384 KB |
testcase_15 | AC | 168 ms
91,408 KB |
testcase_16 | AC | 163 ms
91,408 KB |
testcase_17 | AC | 162 ms
91,384 KB |
testcase_18 | AC | 165 ms
91,404 KB |
testcase_19 | AC | 161 ms
91,380 KB |
testcase_20 | AC | 161 ms
91,384 KB |
testcase_21 | AC | 168 ms
91,384 KB |
testcase_22 | AC | 158 ms
91,380 KB |
testcase_23 | AC | 158 ms
91,380 KB |
testcase_24 | AC | 159 ms
91,380 KB |
testcase_25 | AC | 158 ms
91,384 KB |
testcase_26 | AC | 163 ms
91,380 KB |
testcase_27 | AC | 164 ms
91,380 KB |
testcase_28 | AC | 162 ms
91,400 KB |
testcase_29 | AC | 158 ms
91,380 KB |
testcase_30 | AC | 161 ms
91,380 KB |
testcase_31 | AC | 162 ms
91,380 KB |
testcase_32 | AC | 166 ms
91,380 KB |
testcase_33 | AC | 162 ms
91,380 KB |
testcase_34 | AC | 164 ms
91,404 KB |
testcase_35 | AC | 162 ms
91,384 KB |
testcase_36 | AC | 164 ms
91,404 KB |
testcase_37 | AC | 162 ms
91,380 KB |
testcase_38 | AC | 164 ms
91,404 KB |
testcase_39 | AC | 162 ms
91,384 KB |
ソースコード
import sys from collections import deque, Counter from math import gcd, log10, pi, sqrt, ceil from bisect import bisect, bisect_left, bisect_right, insort from typing import Iterable, TypeVar, Union, Tuple, Iterator, List # import bisect import copy import heapq import itertools import math import random from fractions import Fraction from functools import lru_cache, partial, cmp_to_key import operator # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') # import string # import networkx as nx input = sys.stdin.readline sys.setrecursionlimit(10000000) # mod = 10 ** 9 + 7 mod = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return tuple(map(int, input().split())) def read_index(): return tuple(map(lambda x: int(x) - 1, input().split())) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def main(): N = int(input()) A, B, C = read_values() 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) dp[i + 1] = max(dp[i + 1], dp[i]) print(dp[-1]) if __name__ == "__main__": main()