結果
問題 | No.2027 (1, 2, 3, …, N) 's Subset Sum |
ユーザー | McGregorsh |
提出日時 | 2022-08-05 21:44:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 1,911 bytes |
コンパイル時間 | 327 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 103,104 KB |
最終ジャッジ日時 | 2023-10-13 22:22:50 |
合計ジャッジ時間 | 8,847 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 222 ms
92,568 KB |
testcase_01 | AC | 227 ms
92,528 KB |
testcase_02 | AC | 260 ms
102,880 KB |
testcase_03 | AC | 214 ms
92,500 KB |
testcase_04 | AC | 247 ms
103,104 KB |
testcase_05 | AC | 251 ms
103,044 KB |
testcase_06 | AC | 255 ms
102,864 KB |
testcase_07 | AC | 235 ms
96,252 KB |
testcase_08 | AC | 253 ms
101,644 KB |
testcase_09 | AC | 241 ms
96,480 KB |
testcase_10 | AC | 242 ms
99,116 KB |
testcase_11 | AC | 235 ms
96,856 KB |
testcase_12 | AC | 241 ms
98,276 KB |
testcase_13 | AC | 231 ms
95,016 KB |
testcase_14 | AC | 227 ms
93,776 KB |
testcase_15 | AC | 239 ms
98,644 KB |
testcase_16 | AC | 236 ms
98,948 KB |
testcase_17 | AC | 219 ms
93,548 KB |
testcase_18 | AC | 223 ms
92,552 KB |
testcase_19 | AC | 223 ms
92,328 KB |
testcase_20 | AC | 230 ms
93,460 KB |
testcase_21 | AC | 225 ms
93,060 KB |
testcase_22 | AC | 243 ms
99,096 KB |
testcase_23 | AC | 237 ms
96,464 KB |
testcase_24 | AC | 230 ms
93,724 KB |
testcase_25 | AC | 241 ms
100,180 KB |
testcase_26 | AC | 226 ms
94,272 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 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, s = i_map() top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 score = mid * (mid + 1) // 2 if score > s: top = mid else: under = mid cost = s - (under * (under + 1) // 2) nums = [i + 1 for i in range(under)] start = under-1 while cost > 0: if start < 0: start = under - 1 nums[start] += 1 start -= 1 cost -= 1 if nums[-1] > n: print(-1) else: print(under) print(*nums) if __name__ == '__main__': main()