結果
問題 | No.115 遠足のおやつ |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 12:54:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 277 ms / 5,000 ms |
コード長 | 1,978 bytes |
コンパイル時間 | 386 ms |
コンパイル使用メモリ | 86,980 KB |
実行使用メモリ | 101,620 KB |
最終ジャッジ日時 | 2023-08-20 02:40:57 |
合計ジャッジ時間 | 13,324 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
92,088 KB |
testcase_01 | AC | 236 ms
92,240 KB |
testcase_02 | AC | 238 ms
92,768 KB |
testcase_03 | AC | 235 ms
92,284 KB |
testcase_04 | AC | 249 ms
93,336 KB |
testcase_05 | AC | 234 ms
92,136 KB |
testcase_06 | AC | 235 ms
92,132 KB |
testcase_07 | AC | 244 ms
92,372 KB |
testcase_08 | AC | 240 ms
92,456 KB |
testcase_09 | AC | 240 ms
92,276 KB |
testcase_10 | AC | 241 ms
92,500 KB |
testcase_11 | AC | 241 ms
92,420 KB |
testcase_12 | AC | 245 ms
92,296 KB |
testcase_13 | AC | 244 ms
92,164 KB |
testcase_14 | AC | 251 ms
92,596 KB |
testcase_15 | AC | 250 ms
92,776 KB |
testcase_16 | AC | 255 ms
92,908 KB |
testcase_17 | AC | 248 ms
93,128 KB |
testcase_18 | AC | 243 ms
92,984 KB |
testcase_19 | AC | 245 ms
93,200 KB |
testcase_20 | AC | 247 ms
92,876 KB |
testcase_21 | AC | 242 ms
92,560 KB |
testcase_22 | AC | 247 ms
93,088 KB |
testcase_23 | AC | 243 ms
92,536 KB |
testcase_24 | AC | 247 ms
93,132 KB |
testcase_25 | AC | 251 ms
93,404 KB |
testcase_26 | AC | 246 ms
93,264 KB |
testcase_27 | AC | 247 ms
93,128 KB |
testcase_28 | AC | 247 ms
92,804 KB |
testcase_29 | AC | 250 ms
93,260 KB |
testcase_30 | AC | 248 ms
92,808 KB |
testcase_31 | AC | 242 ms
92,796 KB |
testcase_32 | AC | 249 ms
93,024 KB |
testcase_33 | AC | 244 ms
93,284 KB |
testcase_34 | AC | 257 ms
93,324 KB |
testcase_35 | AC | 256 ms
93,368 KB |
testcase_36 | AC | 255 ms
93,004 KB |
testcase_37 | AC | 256 ms
93,376 KB |
testcase_38 | AC | 277 ms
101,620 KB |
testcase_39 | AC | 267 ms
93,004 KB |
testcase_40 | AC | 238 ms
92,176 KB |
testcase_41 | AC | 243 ms
92,196 KB |
testcase_42 | AC | 240 ms
92,288 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, ROUND_HALF_UP 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, D, K = i_map() dp = [[[False] * (D+1) for i in range(K+1)] for i in range(N+1)] dp[0][0][0] = True for i in range(N): for j in range(K+1): for k in range(D+1): if dp[i][j][k]: if k + (i+1) <= D and j + 1 <= K: dp[i+1][j+1][k+(i+1)] = True dp[i+1][j][k] = True if dp[-1][-1][D] == False: print(-1) exit() ans = [] now = D Kp = K-1 for i in range(N, 0, -1): if now - i < 0: continue if dp[i][Kp][now-i]: ans.append(i) now -= i Kp -= 1 print(*ans[::-1]) if __name__ == '__main__': main()