結果
問題 | No.1007 コイン集め |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 12:53:08 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,801 bytes |
コンパイル時間 | 456 ms |
コンパイル使用メモリ | 86,884 KB |
実行使用メモリ | 108,188 KB |
最終ジャッジ日時 | 2023-08-25 21:48:06 |
合計ジャッジ時間 | 8,299 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,584 KB |
testcase_01 | AC | 230 ms
92,528 KB |
testcase_02 | AC | 229 ms
92,540 KB |
testcase_03 | AC | 231 ms
92,728 KB |
testcase_04 | AC | 232 ms
92,476 KB |
testcase_05 | AC | 228 ms
92,532 KB |
testcase_06 | AC | 227 ms
92,676 KB |
testcase_07 | AC | 231 ms
92,600 KB |
testcase_08 | AC | 230 ms
92,596 KB |
testcase_09 | AC | 230 ms
92,748 KB |
testcase_10 | AC | 231 ms
92,556 KB |
testcase_11 | AC | 229 ms
92,820 KB |
testcase_12 | AC | 263 ms
107,856 KB |
testcase_13 | AC | 257 ms
107,876 KB |
testcase_14 | AC | 257 ms
107,652 KB |
testcase_15 | WA | - |
testcase_16 | AC | 250 ms
105,360 KB |
testcase_17 | AC | 245 ms
105,396 KB |
testcase_18 | AC | 255 ms
108,188 KB |
testcase_19 | AC | 252 ms
108,052 KB |
testcase_20 | AC | 251 ms
108,112 KB |
testcase_21 | AC | 252 ms
107,992 KB |
ソースコード
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(): n, k = i_map() A = i_list() k -= 1 if A[k] == 0: print(0) exit() right = 0 for i in range(k+1, n): if A[i] == 1: right += 1 break else: right += A[i] left = 0 for i in range(k-1, -1, -1): if A[i] == 1: left += 1 break else: left += A[i] if A[k] == 1: print(max(left, right) + 1) else: print(left + right + A[k]) if __name__ == '__main__': main()