結果
問題 | No.2063 ±2^k operations (easy) |
ユーザー | McGregorsh |
提出日時 | 2022-09-02 21:43:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 153 ms / 2,000 ms |
コード長 | 1,877 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 82,700 KB |
実行使用メモリ | 89,788 KB |
最終ジャッジ日時 | 2024-04-27 21:13:36 |
合計ジャッジ時間 | 4,840 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,236 KB |
testcase_01 | AC | 143 ms
89,400 KB |
testcase_02 | AC | 146 ms
89,336 KB |
testcase_03 | AC | 151 ms
89,300 KB |
testcase_04 | AC | 149 ms
89,408 KB |
testcase_05 | AC | 147 ms
89,112 KB |
testcase_06 | AC | 143 ms
89,632 KB |
testcase_07 | AC | 149 ms
89,412 KB |
testcase_08 | AC | 144 ms
89,596 KB |
testcase_09 | AC | 141 ms
89,088 KB |
testcase_10 | AC | 140 ms
89,068 KB |
testcase_11 | AC | 141 ms
89,048 KB |
testcase_12 | AC | 139 ms
89,048 KB |
testcase_13 | AC | 144 ms
89,396 KB |
testcase_14 | AC | 148 ms
89,044 KB |
testcase_15 | AC | 153 ms
89,268 KB |
testcase_16 | AC | 147 ms
89,288 KB |
testcase_17 | AC | 148 ms
89,100 KB |
testcase_18 | AC | 140 ms
89,548 KB |
testcase_19 | AC | 147 ms
89,512 KB |
testcase_20 | AC | 148 ms
89,788 KB |
testcase_21 | AC | 141 ms
89,224 KB |
testcase_22 | AC | 140 ms
89,084 KB |
testcase_23 | AC | 139 ms
89,444 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 = input() juge = False if N.count('1') == 2: juge = True if N.count('1') == 1: print('No') exit() nums = [] for i in range(len(N)): if N[i] == '1': nums.append(i) break for i in range(len(N)-1, -1, -1): if N[i] == '1': nums.append(i) break lines = N[nums[0]:nums[1]+1] if len(lines) == lines.count('1'): juge = True if juge: print('Yes') else: print('No') if __name__ == '__main__': main()