結果
問題 | No.2053 12345... |
ユーザー | McGregorsh |
提出日時 | 2022-08-22 21:45:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 192 ms / 2,000 ms |
コード長 | 1,763 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 123,264 KB |
最終ジャッジ日時 | 2024-10-10 06:42:56 |
合計ジャッジ時間 | 6,840 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
88,988 KB |
testcase_01 | AC | 142 ms
89,428 KB |
testcase_02 | AC | 142 ms
89,416 KB |
testcase_03 | AC | 152 ms
93,536 KB |
testcase_04 | AC | 175 ms
110,576 KB |
testcase_05 | AC | 149 ms
90,964 KB |
testcase_06 | AC | 166 ms
107,664 KB |
testcase_07 | AC | 159 ms
101,448 KB |
testcase_08 | AC | 158 ms
99,980 KB |
testcase_09 | AC | 172 ms
110,468 KB |
testcase_10 | AC | 182 ms
117,572 KB |
testcase_11 | AC | 146 ms
90,888 KB |
testcase_12 | AC | 143 ms
89,988 KB |
testcase_13 | AC | 185 ms
121,544 KB |
testcase_14 | AC | 157 ms
98,184 KB |
testcase_15 | AC | 155 ms
94,856 KB |
testcase_16 | AC | 157 ms
95,440 KB |
testcase_17 | AC | 150 ms
92,764 KB |
testcase_18 | AC | 192 ms
123,264 KB |
testcase_19 | AC | 176 ms
110,980 KB |
testcase_20 | AC | 148 ms
90,084 KB |
testcase_21 | AC | 169 ms
104,280 KB |
testcase_22 | AC | 147 ms
90,008 KB |
testcase_23 | AC | 143 ms
90,048 KB |
testcase_24 | AC | 156 ms
94,604 KB |
testcase_25 | AC | 180 ms
117,264 KB |
testcase_26 | AC | 162 ms
101,884 KB |
testcase_27 | AC | 156 ms
94,952 KB |
testcase_28 | AC | 153 ms
92,792 KB |
testcase_29 | AC | 166 ms
105,832 KB |
testcase_30 | AC | 150 ms
93,808 KB |
testcase_31 | AC | 167 ms
105,576 KB |
testcase_32 | AC | 187 ms
120,860 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()