結果
問題 | No.1010 折って重ねて |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 21:50:07 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,626 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 86,920 KB |
実行使用メモリ | 92,792 KB |
最終ジャッジ日時 | 2023-08-26 08:59:02 |
合計ジャッジ時間 | 11,636 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 195 ms
92,560 KB |
testcase_01 | AC | 201 ms
92,704 KB |
testcase_02 | AC | 203 ms
92,556 KB |
testcase_03 | AC | 198 ms
92,652 KB |
testcase_04 | AC | 199 ms
92,624 KB |
testcase_05 | AC | 193 ms
92,648 KB |
testcase_06 | AC | 194 ms
92,780 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 196 ms
92,408 KB |
testcase_11 | AC | 199 ms
92,408 KB |
testcase_12 | WA | - |
testcase_13 | AC | 199 ms
92,584 KB |
testcase_14 | AC | 195 ms
92,672 KB |
testcase_15 | AC | 193 ms
92,556 KB |
testcase_16 | AC | 197 ms
92,684 KB |
testcase_17 | AC | 191 ms
92,532 KB |
testcase_18 | AC | 191 ms
92,508 KB |
testcase_19 | WA | - |
testcase_20 | AC | 191 ms
92,564 KB |
testcase_21 | AC | 196 ms
92,408 KB |
testcase_22 | WA | - |
testcase_23 | AC | 199 ms
92,656 KB |
testcase_24 | AC | 200 ms
92,724 KB |
testcase_25 | AC | 208 ms
92,692 KB |
testcase_26 | WA | - |
testcase_27 | AC | 201 ms
92,684 KB |
testcase_28 | AC | 200 ms
92,580 KB |
testcase_29 | AC | 204 ms
92,412 KB |
testcase_30 | AC | 209 ms
92,560 KB |
testcase_31 | AC | 198 ms
92,456 KB |
testcase_32 | WA | - |
testcase_33 | AC | 193 ms
92,720 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 194 ms
92,728 KB |
testcase_37 | AC | 203 ms
92,732 KB |
testcase_38 | WA | - |
testcase_39 | AC | 230 ms
92,508 KB |
testcase_40 | WA | - |
testcase_41 | AC | 204 ms
92,668 KB |
testcase_42 | AC | 199 ms
92,764 KB |
testcase_43 | AC | 198 ms
92,732 KB |
testcase_44 | AC | 192 ms
92,792 KB |
testcase_45 | WA | - |
ソースコード
import sys, re 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(): x, y, h = i_map() x *= 1000 y *= 1000 ans = 0 while x > h or y > h: if x > h: x /= 2 x = ceil(x) h *= 2 ans += 1 continue if y > h: y /= 2 y = ceil(y) h *= 2 ans += 1 print(ans) if __name__ == '__main__': main()