結果
問題 | No.648 お や す み |
ユーザー | Coki628 |
提出日時 | 2020-05-19 16:32:56 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 1,201 bytes |
コンパイル時間 | 163 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 10,880 KB |
最終ジャッジ日時 | 2024-10-01 22:52:24 |
合計ジャッジ時間 | 4,963 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,880 KB |
testcase_01 | AC | 30 ms
10,752 KB |
testcase_02 | AC | 30 ms
10,880 KB |
testcase_03 | AC | 30 ms
10,880 KB |
testcase_04 | AC | 31 ms
10,752 KB |
testcase_05 | AC | 31 ms
10,880 KB |
testcase_06 | AC | 31 ms
10,752 KB |
testcase_07 | AC | 30 ms
10,752 KB |
testcase_08 | AC | 30 ms
10,752 KB |
testcase_09 | AC | 31 ms
10,752 KB |
testcase_10 | AC | 31 ms
10,752 KB |
testcase_11 | AC | 32 ms
10,752 KB |
testcase_12 | AC | 32 ms
10,880 KB |
testcase_13 | AC | 30 ms
10,752 KB |
testcase_14 | AC | 31 ms
10,752 KB |
testcase_15 | AC | 30 ms
10,752 KB |
testcase_16 | AC | 31 ms
10,752 KB |
testcase_17 | AC | 31 ms
10,752 KB |
testcase_18 | AC | 31 ms
10,752 KB |
testcase_19 | AC | 30 ms
10,624 KB |
testcase_20 | AC | 31 ms
10,752 KB |
testcase_21 | AC | 31 ms
10,880 KB |
testcase_22 | AC | 31 ms
10,880 KB |
testcase_23 | AC | 30 ms
10,752 KB |
testcase_24 | AC | 31 ms
10,624 KB |
testcase_25 | AC | 31 ms
10,880 KB |
testcase_26 | AC | 30 ms
10,880 KB |
testcase_27 | AC | 30 ms
10,752 KB |
testcase_28 | AC | 29 ms
10,880 KB |
testcase_29 | AC | 30 ms
10,624 KB |
testcase_30 | AC | 30 ms
10,624 KB |
testcase_31 | AC | 30 ms
10,880 KB |
testcase_32 | AC | 30 ms
10,880 KB |
testcase_33 | AC | 30 ms
10,880 KB |
testcase_34 | AC | 31 ms
10,880 KB |
testcase_35 | AC | 32 ms
10,752 KB |
testcase_36 | AC | 30 ms
10,880 KB |
testcase_37 | AC | 31 ms
10,752 KB |
testcase_38 | AC | 30 ms
10,624 KB |
testcase_39 | AC | 30 ms
10,752 KB |
testcase_40 | AC | 31 ms
10,752 KB |
testcase_41 | AC | 30 ms
10,880 KB |
testcase_42 | AC | 30 ms
10,880 KB |
testcase_43 | AC | 29 ms
10,880 KB |
testcase_44 | AC | 29 ms
10,752 KB |
testcase_45 | AC | 30 ms
10,880 KB |
testcase_46 | AC | 30 ms
10,752 KB |
testcase_47 | AC | 30 ms
10,752 KB |
testcase_48 | AC | 32 ms
10,880 KB |
testcase_49 | AC | 30 ms
10,624 KB |
testcase_50 | AC | 31 ms
10,752 KB |
testcase_51 | AC | 31 ms
10,624 KB |
testcase_52 | AC | 31 ms
10,752 KB |
testcase_53 | AC | 30 ms
10,624 KB |
testcase_54 | AC | 30 ms
10,752 KB |
testcase_55 | AC | 30 ms
10,880 KB |
testcase_56 | AC | 31 ms
10,752 KB |
testcase_57 | AC | 30 ms
10,624 KB |
testcase_58 | AC | 29 ms
10,624 KB |
testcase_59 | AC | 30 ms
10,752 KB |
testcase_60 | AC | 31 ms
10,880 KB |
testcase_61 | AC | 30 ms
10,624 KB |
testcase_62 | AC | 31 ms
10,752 KB |
testcase_63 | AC | 31 ms
10,880 KB |
testcase_64 | AC | 29 ms
10,752 KB |
testcase_65 | AC | 29 ms
10,624 KB |
testcase_66 | AC | 30 ms
10,880 KB |
testcase_67 | AC | 31 ms
10,752 KB |
testcase_68 | AC | 29 ms
10,880 KB |
testcase_69 | AC | 30 ms
10,624 KB |
testcase_70 | AC | 30 ms
10,880 KB |
testcase_71 | AC | 30 ms
10,624 KB |
testcase_72 | AC | 29 ms
10,752 KB |
testcase_73 | AC | 30 ms
10,752 KB |
testcase_74 | AC | 30 ms
10,880 KB |
testcase_75 | AC | 29 ms
10,624 KB |
testcase_76 | AC | 29 ms
10,752 KB |
testcase_77 | AC | 31 ms
10,880 KB |
testcase_78 | AC | 30 ms
10,880 KB |
testcase_79 | AC | 30 ms
10,880 KB |
testcase_80 | AC | 30 ms
10,752 KB |
testcase_81 | AC | 31 ms
10,752 KB |
testcase_82 | AC | 31 ms
10,752 KB |
testcase_83 | AC | 31 ms
10,752 KB |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 18 MOD = 10 ** 9 + 7 EPS = 10 ** -10 def bisearch_min(mn, mx, func): """ 条件を満たす最小値を見つける二分探索 """ ok = mx ng = mn while ng+1 < ok: mid = (ok+ng) // 2 if func(mid): ok = mid else: ng = mid return ok def get_sum(a, d, n): """ 等差数列の和:(初項a, 公差d, 項数n) """ return (2*a + (n-1)*d) * n // 2 N = INT() res = bisearch_min(0, INF, lambda x: get_sum(1, 1, x) >= N) ans = get_sum(1, 1, res) if ans == N: YES() print(res) else: NO()