結果
問題 |
No.2390 Udon Coupon (Hard)
|
ユーザー |
![]() |
提出日時 | 2023-07-15 18:41:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 563 ms / 2,000 ms |
コード長 | 1,570 bytes |
コンパイル時間 | 355 ms |
コンパイル使用メモリ | 82,816 KB |
実行使用メモリ | 92,800 KB |
最終ジャッジ日時 | 2024-10-06 01:45:47 |
合計ジャッジ時間 | 14,049 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
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()) S = read_lists(3) S += S A = max(a for a, _ in S) res = 0 for k in range(3): A1, B1 = S[k] A2, B2 = S[k + 1] A3, B3 = S[k + 2] for i in range(A + 10): N1 = N - A1 * i if N1 < 0: break r1 = i * B1 for j in range(A + 10): N2 = N1 - A2 * j if N2 < 0: break res = max(res, r1 + j * B2 + (N2 // A3) * B3) print(res) if __name__ == "__main__": main()