結果
問題 | No.1007 コイン集め |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 22:33:29 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,706 bytes |
コンパイル時間 | 282 ms |
コンパイル使用メモリ | 87,132 KB |
実行使用メモリ | 108,104 KB |
最終ジャッジ日時 | 2023-08-22 00:18:26 |
合計ジャッジ時間 | 7,661 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,424 KB |
testcase_01 | AC | 236 ms
92,600 KB |
testcase_02 | AC | 238 ms
92,584 KB |
testcase_03 | AC | 238 ms
92,652 KB |
testcase_04 | AC | 242 ms
92,604 KB |
testcase_05 | AC | 238 ms
92,368 KB |
testcase_06 | AC | 239 ms
92,368 KB |
testcase_07 | AC | 239 ms
92,368 KB |
testcase_08 | AC | 240 ms
92,596 KB |
testcase_09 | WA | - |
testcase_10 | AC | 235 ms
92,576 KB |
testcase_11 | AC | 240 ms
92,492 KB |
testcase_12 | AC | 263 ms
107,720 KB |
testcase_13 | AC | 262 ms
107,844 KB |
testcase_14 | AC | 265 ms
107,832 KB |
testcase_15 | AC | 256 ms
105,416 KB |
testcase_16 | AC | 259 ms
105,504 KB |
testcase_17 | AC | 256 ms
105,308 KB |
testcase_18 | AC | 258 ms
108,104 KB |
testcase_19 | AC | 256 ms
108,028 KB |
testcase_20 | AC | 259 ms
108,076 KB |
testcase_21 | AC | 264 ms
107,916 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, K = i_map() A = i_list() if A[K-1] == 0: print(0) exit() ans = 0 for i in range(K-1, -1, -1): if A[i] > 1: ans += A[i] else: ans += A[i] break for i in range(K, N): if A[i] > 1: ans += A[i] else: ans += A[i] break print(ans) if __name__ == '__main__': main()