結果
問題 | No.2142 Segment Zero |
ユーザー | McGregorsh |
提出日時 | 2022-12-02 22:39:09 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,831 bytes |
コンパイル時間 | 447 ms |
コンパイル使用メモリ | 82,360 KB |
実行使用メモリ | 186,808 KB |
最終ジャッジ日時 | 2024-04-18 07:30:05 |
合計ジャッジ時間 | 8,433 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
89,552 KB |
testcase_01 | AC | 207 ms
186,656 KB |
testcase_02 | AC | 137 ms
89,604 KB |
testcase_03 | AC | 153 ms
105,488 KB |
testcase_04 | AC | 171 ms
114,300 KB |
testcase_05 | AC | 169 ms
115,576 KB |
testcase_06 | AC | 144 ms
89,544 KB |
testcase_07 | WA | - |
testcase_08 | AC | 218 ms
186,596 KB |
testcase_09 | WA | - |
testcase_10 | AC | 218 ms
186,364 KB |
testcase_11 | AC | 218 ms
186,680 KB |
testcase_12 | AC | 214 ms
186,512 KB |
testcase_13 | AC | 221 ms
186,776 KB |
testcase_14 | AC | 219 ms
186,428 KB |
testcase_15 | AC | 222 ms
186,468 KB |
testcase_16 | AC | 222 ms
186,808 KB |
testcase_17 | AC | 214 ms
166,704 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 188 ms
142,404 KB |
testcase_21 | WA | - |
testcase_22 | AC | 198 ms
157,892 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 178 ms
131,404 KB |
testcase_29 | AC | 190 ms
141,968 KB |
testcase_30 | AC | 199 ms
157,556 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 219 ms
185,756 KB |
testcase_36 | AC | 166 ms
107,052 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, K = i_map() nums = [i for i in range(1, N+1)] nums = nums[::-1] counts = [] for i in range(N): if K - nums[i] >= 0: K -= nums[i] else: counts.append(nums[i]) lencounts = len(counts) if lencounts == 0: print(0) exit() counts = counts[::-1] ans = 1 for i in range(lencounts-1): a = counts[i] b = counts[i+1] if a + 1 < b: ans += 1 print(ans) if __name__ == '__main__': main()