結果
問題 | No.1687 What the Heck? |
ユーザー | McGregorsh |
提出日時 | 2022-07-25 08:51:11 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,788 bytes |
コンパイル時間 | 1,005 ms |
コンパイル使用メモリ | 86,936 KB |
実行使用メモリ | 128,064 KB |
最終ジャッジ日時 | 2023-09-21 11:46:44 |
合計ジャッジ時間 | 6,517 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,384 KB |
testcase_01 | AC | 224 ms
92,456 KB |
testcase_02 | WA | - |
testcase_03 | AC | 227 ms
92,228 KB |
testcase_04 | AC | 230 ms
92,256 KB |
testcase_05 | AC | 228 ms
92,332 KB |
testcase_06 | AC | 227 ms
92,288 KB |
testcase_07 | AC | 259 ms
112,652 KB |
testcase_08 | AC | 264 ms
121,988 KB |
testcase_09 | WA | - |
testcase_10 | AC | 244 ms
105,776 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 289 ms
128,064 KB |
testcase_14 | AC | 288 ms
127,992 KB |
testcase_15 | AC | 288 ms
128,064 KB |
testcase_16 | AC | 292 ms
127,992 KB |
testcase_17 | AC | 241 ms
94,028 KB |
testcase_18 | AC | 294 ms
127,744 KB |
testcase_19 | AC | 229 ms
93,284 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 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()) p = i_list() nums = set() for i in range(1, n+1): nums.add(i) p_ = p[::-1] cou = n count1 = 0 count2 = 0 for i in range(n): if p_[i] + 1 in nums: nums.remove(p_[i]+1) count1 += cou else: if p_[i] not in nums: count2 += cou else: nums.remove(p_[i]) cou -= 1 print(count1 - count2) if __name__ == '__main__': main()