結果
問題 | No.1687 What the Heck? |
ユーザー | cozy_sauna |
提出日時 | 2021-10-11 12:58:55 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,719 bytes |
コンパイル時間 | 123 ms |
コンパイル使用メモリ | 10,880 KB |
実行使用メモリ | 33,412 KB |
最終ジャッジ日時 | 2023-10-13 13:54:02 |
合計ジャッジ時間 | 2,404 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
9,436 KB |
testcase_01 | AC | 23 ms
9,436 KB |
testcase_02 | AC | 23 ms
9,496 KB |
testcase_03 | AC | 23 ms
9,604 KB |
testcase_04 | AC | 23 ms
9,468 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 43 ms
17,176 KB |
testcase_10 | AC | 36 ms
14,764 KB |
testcase_11 | AC | 39 ms
15,452 KB |
testcase_12 | AC | 88 ms
33,272 KB |
testcase_13 | AC | 86 ms
33,232 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque from itertools import permutations, combinations, product from functools import lru_cache from random import sample, choice, randint, random from heapq import heappush, heappop from math import factorial, gcd, exp from copy import copy, deepcopy from time import time setrecursionlimit(500000) readline = stdin.readline # @lru_cache(maxsize=None) INF = 10 ** 18 MOD = 1000000007 MOD2 = 998244353 DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)] def I(): return int(readline()) def S(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x)-1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] def NODE(x): return [[] for _ in [0] * x] def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])] def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx] def imax(A, idx=-1, m=-(1<<18)): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a] return idx def imin(A, idx=-1, m=1<<18): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a] return idx def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x def gen(x, *args): ret = [x] * args[-1] for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e] return ret def puts(E): for e in E: print(e) def pprint(E): print() puts(E) #################################################################### N = I() P = LI() ans = N * (N+1)//2 ans -= 2 * (P.index(N) + 1) print(max(0, ans))