結果
問題 | No.2053 12345... |
ユーザー | McGregorsh |
提出日時 | 2022-08-22 21:45:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 181 ms / 2,000 ms |
コード長 | 1,763 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 81,976 KB |
実行使用メモリ | 123,208 KB |
最終ジャッジ日時 | 2024-04-18 13:31:11 |
合計ジャッジ時間 | 6,434 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
88,896 KB |
testcase_01 | AC | 132 ms
89,284 KB |
testcase_02 | AC | 135 ms
89,660 KB |
testcase_03 | AC | 141 ms
93,544 KB |
testcase_04 | AC | 160 ms
110,628 KB |
testcase_05 | AC | 137 ms
91,380 KB |
testcase_06 | AC | 159 ms
107,604 KB |
testcase_07 | AC | 151 ms
100,700 KB |
testcase_08 | AC | 145 ms
99,232 KB |
testcase_09 | AC | 161 ms
110,436 KB |
testcase_10 | AC | 169 ms
116,684 KB |
testcase_11 | AC | 138 ms
90,340 KB |
testcase_12 | AC | 137 ms
89,796 KB |
testcase_13 | AC | 177 ms
121,548 KB |
testcase_14 | AC | 147 ms
98,244 KB |
testcase_15 | AC | 143 ms
94,884 KB |
testcase_16 | AC | 143 ms
95,060 KB |
testcase_17 | AC | 139 ms
92,548 KB |
testcase_18 | AC | 181 ms
123,208 KB |
testcase_19 | AC | 170 ms
111,108 KB |
testcase_20 | AC | 143 ms
90,260 KB |
testcase_21 | AC | 157 ms
104,404 KB |
testcase_22 | AC | 134 ms
89,844 KB |
testcase_23 | AC | 137 ms
89,692 KB |
testcase_24 | AC | 144 ms
94,752 KB |
testcase_25 | AC | 170 ms
116,960 KB |
testcase_26 | AC | 151 ms
101,500 KB |
testcase_27 | AC | 142 ms
94,688 KB |
testcase_28 | AC | 139 ms
92,568 KB |
testcase_29 | AC | 155 ms
105,888 KB |
testcase_30 | AC | 145 ms
93,796 KB |
testcase_31 | AC | 162 ms
105,660 KB |
testcase_32 | AC | 173 ms
120,928 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 = int(input()) A = i_list() nums = [] now = A[0] score = 1 for i in range(1, N): point = A[i] if now + 1 == point: score += 1 else: nums.append(score) score = 1 now = point nums.append(score) ans = 0 for i in range(len(nums)): cost = nums[i] ans += cost * (cost-1) // 2 print(ans) if __name__ == '__main__': main()