結果
問題 | No.365 ジェンガソート |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 23:03:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 1,527 bytes |
コンパイル時間 | 1,873 ms |
コンパイル使用メモリ | 86,896 KB |
実行使用メモリ | 106,512 KB |
最終ジャッジ日時 | 2023-08-20 21:44:13 |
合計ジャッジ時間 | 12,780 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
92,352 KB |
testcase_01 | AC | 255 ms
92,344 KB |
testcase_02 | AC | 256 ms
92,140 KB |
testcase_03 | AC | 253 ms
92,144 KB |
testcase_04 | AC | 250 ms
92,204 KB |
testcase_05 | AC | 253 ms
92,356 KB |
testcase_06 | AC | 254 ms
92,168 KB |
testcase_07 | AC | 252 ms
92,396 KB |
testcase_08 | AC | 248 ms
92,248 KB |
testcase_09 | AC | 249 ms
92,432 KB |
testcase_10 | AC | 254 ms
92,372 KB |
testcase_11 | AC | 251 ms
92,396 KB |
testcase_12 | AC | 251 ms
92,424 KB |
testcase_13 | AC | 252 ms
92,352 KB |
testcase_14 | AC | 254 ms
92,332 KB |
testcase_15 | AC | 254 ms
92,124 KB |
testcase_16 | AC | 267 ms
102,740 KB |
testcase_17 | AC | 268 ms
106,092 KB |
testcase_18 | AC | 258 ms
93,156 KB |
testcase_19 | AC | 268 ms
105,984 KB |
testcase_20 | AC | 253 ms
95,236 KB |
testcase_21 | AC | 251 ms
94,080 KB |
testcase_22 | AC | 262 ms
103,068 KB |
testcase_23 | AC | 257 ms
97,316 KB |
testcase_24 | AC | 263 ms
101,696 KB |
testcase_25 | AC | 250 ms
93,672 KB |
testcase_26 | AC | 256 ms
99,220 KB |
testcase_27 | AC | 266 ms
106,356 KB |
testcase_28 | AC | 264 ms
100,216 KB |
testcase_29 | AC | 264 ms
104,584 KB |
testcase_30 | AC | 256 ms
100,500 KB |
testcase_31 | AC | 255 ms
94,908 KB |
testcase_32 | AC | 256 ms
94,548 KB |
testcase_33 | AC | 267 ms
106,496 KB |
testcase_34 | AC | 249 ms
92,984 KB |
testcase_35 | AC | 262 ms
101,704 KB |
testcase_36 | AC | 269 ms
106,304 KB |
testcase_37 | AC | 266 ms
106,512 KB |
testcase_38 | AC | 265 ms
106,428 KB |
testcase_39 | AC | 268 ms
106,504 KB |
testcase_40 | AC | 270 ms
106,508 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() ans = 0 now = N for i in range(N-1, -1, -1): if now == A[i]: ans += 1 now -= 1 print(N - ans) if __name__ == '__main__': main()