結果
問題 | No.2027 (1, 2, 3, …, N) 's Subset Sum |
ユーザー | McGregorsh |
提出日時 | 2022-08-05 21:29:25 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,742 bytes |
コンパイル時間 | 302 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 100,608 KB |
最終ジャッジ日時 | 2024-09-15 17:39:42 |
合計ジャッジ時間 | 9,181 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 165 ms
89,472 KB |
testcase_01 | AC | 154 ms
89,344 KB |
testcase_02 | AC | 191 ms
100,480 KB |
testcase_03 | AC | 160 ms
88,832 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 172 ms
91,392 KB |
testcase_10 | WA | - |
testcase_11 | AC | 164 ms
91,648 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 173 ms
94,848 KB |
testcase_16 | AC | 179 ms
95,104 KB |
testcase_17 | AC | 163 ms
89,728 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 165 ms
89,856 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
ソースコード
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 + mid + 1 if score > s: top = mid else: under = mid cost = s - (under * (under + 1) // 2) print(under + 1) nums = [i + 1 for i in range(under)] nums.append(cost) print(*nums) if __name__ == '__main__': main()