結果
問題 | No.3055 2019(注:異常な難易度です) |
ユーザー | imulan |
提出日時 | 2019-04-02 04:42:35 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 741 bytes |
コンパイル時間 | 167 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 15,616 KB |
最終ジャッジ日時 | 2024-11-27 16:24:44 |
合計ジャッジ時間 | 8,636 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
15,616 KB |
testcase_01 | AC | 64 ms
15,616 KB |
testcase_02 | AC | 65 ms
15,232 KB |
testcase_03 | AC | 64 ms
15,360 KB |
testcase_04 | AC | 65 ms
15,488 KB |
testcase_05 | AC | 65 ms
15,488 KB |
testcase_06 | AC | 65 ms
15,488 KB |
testcase_07 | AC | 69 ms
15,616 KB |
testcase_08 | AC | 64 ms
15,488 KB |
testcase_09 | AC | 64 ms
15,488 KB |
testcase_10 | AC | 65 ms
15,360 KB |
testcase_11 | AC | 65 ms
15,360 KB |
testcase_12 | AC | 67 ms
15,360 KB |
testcase_13 | AC | 65 ms
15,616 KB |
testcase_14 | AC | 65 ms
15,360 KB |
testcase_15 | AC | 64 ms
15,488 KB |
testcase_16 | AC | 65 ms
15,488 KB |
testcase_17 | AC | 65 ms
15,488 KB |
testcase_18 | AC | 65 ms
15,488 KB |
testcase_19 | AC | 65 ms
15,488 KB |
testcase_20 | AC | 65 ms
15,360 KB |
testcase_21 | AC | 66 ms
15,488 KB |
testcase_22 | AC | 65 ms
15,360 KB |
testcase_23 | AC | 65 ms
15,488 KB |
testcase_24 | AC | 65 ms
15,488 KB |
testcase_25 | AC | 65 ms
15,616 KB |
testcase_26 | AC | 66 ms
15,360 KB |
testcase_27 | AC | 66 ms
15,360 KB |
testcase_28 | AC | 66 ms
15,488 KB |
testcase_29 | AC | 65 ms
15,488 KB |
testcase_30 | AC | 66 ms
15,488 KB |
testcase_31 | AC | 66 ms
15,360 KB |
testcase_32 | AC | 65 ms
15,616 KB |
testcase_33 | AC | 66 ms
15,488 KB |
testcase_34 | AC | 65 ms
15,488 KB |
testcase_35 | AC | 65 ms
15,360 KB |
testcase_36 | AC | 65 ms
15,488 KB |
testcase_37 | AC | 64 ms
15,360 KB |
testcase_38 | AC | 66 ms
15,488 KB |
testcase_39 | AC | 65 ms
15,488 KB |
testcase_40 | AC | 68 ms
15,360 KB |
testcase_41 | AC | 66 ms
15,232 KB |
testcase_42 | AC | 65 ms
15,360 KB |
testcase_43 | AC | 65 ms
15,616 KB |
testcase_44 | AC | 65 ms
15,360 KB |
testcase_45 | AC | 65 ms
15,616 KB |
testcase_46 | AC | 64 ms
15,616 KB |
testcase_47 | AC | 65 ms
15,360 KB |
testcase_48 | AC | 65 ms
15,488 KB |
testcase_49 | AC | 65 ms
15,360 KB |
testcase_50 | AC | 64 ms
15,488 KB |
testcase_51 | AC | 66 ms
15,360 KB |
testcase_52 | AC | 64 ms
15,232 KB |
testcase_53 | AC | 65 ms
15,488 KB |
testcase_54 | AC | 65 ms
15,488 KB |
testcase_55 | AC | 65 ms
15,488 KB |
testcase_56 | AC | 64 ms
15,360 KB |
testcase_57 | AC | 65 ms
15,488 KB |
testcase_58 | AC | 65 ms
15,232 KB |
testcase_59 | AC | 66 ms
15,488 KB |
testcase_60 | AC | 65 ms
15,488 KB |
testcase_61 | AC | 65 ms
15,616 KB |
testcase_62 | AC | 65 ms
15,360 KB |
testcase_63 | AC | 66 ms
15,488 KB |
testcase_64 | AC | 66 ms
15,488 KB |
testcase_65 | AC | 68 ms
15,360 KB |
testcase_66 | AC | 67 ms
15,360 KB |
testcase_67 | AC | 65 ms
15,232 KB |
testcase_68 | AC | 66 ms
15,488 KB |
testcase_69 | AC | 66 ms
15,360 KB |
testcase_70 | AC | 65 ms
15,488 KB |
testcase_71 | AC | 65 ms
15,616 KB |
testcase_72 | AC | 66 ms
15,488 KB |
testcase_73 | AC | 66 ms
15,488 KB |
testcase_74 | AC | 67 ms
15,488 KB |
testcase_75 | AC | 67 ms
15,360 KB |
testcase_76 | AC | 67 ms
15,360 KB |
testcase_77 | AC | 67 ms
15,616 KB |
testcase_78 | AC | 67 ms
15,488 KB |
testcase_79 | AC | 67 ms
15,488 KB |
testcase_80 | AC | 66 ms
15,360 KB |
testcase_81 | AC | 66 ms
15,488 KB |
testcase_82 | AC | 66 ms
15,616 KB |
testcase_83 | AC | 67 ms
15,488 KB |
testcase_84 | AC | 67 ms
15,488 KB |
testcase_85 | AC | 66 ms
15,616 KB |
testcase_86 | AC | 67 ms
15,360 KB |
testcase_87 | AC | 66 ms
15,232 KB |
testcase_88 | AC | 66 ms
15,616 KB |
testcase_89 | AC | 66 ms
15,488 KB |
testcase_90 | AC | 65 ms
15,488 KB |
ソースコード
D = 100000 # sum 1..x def f(x): return x*(x+1)//2 def main(): n = int(input()) x = [1 for i in range(D)] x[0] = 0 for i in range(3,D): x[i] += f(i-2) d,s = 0,0 while s+x[d] < n: s += x[d] d += 1 # print(s,d) b = [1 for i in range(d)] l = 1 while l < d-1: if s + (d-1-l) >= n: break s += (d-1-l) l += 1 # print(s,l) if l < d-1: r = d-2 s += 1 while r > l: if s == n: break s += 1 r -= 1 for i in range(l,r+1): b[i] = 0 ans = 0 for i in b: ans = ans*2 + i print(ans) if __name__ == "__main__": main()