結果
問題 | No.1687 What the Heck? |
ユーザー | McGregorsh |
提出日時 | 2022-07-25 18:52:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,984 bytes |
コンパイル時間 | 650 ms |
コンパイル使用メモリ | 87,152 KB |
実行使用メモリ | 126,580 KB |
最終ジャッジ日時 | 2023-09-22 03:55:45 |
合計ジャッジ時間 | 9,118 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 263 ms
92,196 KB |
testcase_01 | AC | 263 ms
92,460 KB |
testcase_02 | WA | - |
testcase_03 | AC | 260 ms
92,492 KB |
testcase_04 | AC | 260 ms
92,408 KB |
testcase_05 | AC | 264 ms
92,176 KB |
testcase_06 | AC | 262 ms
92,508 KB |
testcase_07 | AC | 281 ms
102,880 KB |
testcase_08 | AC | 290 ms
108,164 KB |
testcase_09 | WA | - |
testcase_10 | AC | 275 ms
99,168 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 314 ms
126,240 KB |
testcase_14 | AC | 314 ms
126,460 KB |
testcase_15 | AC | 321 ms
126,284 KB |
testcase_16 | AC | 312 ms
126,468 KB |
testcase_17 | AC | 265 ms
93,292 KB |
testcase_18 | AC | 314 ms
126,580 KB |
testcase_19 | AC | 266 ms
93,288 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 = [False] * (n+2) nums[0] = True nums[-1] = True p_ = p[::-1] cou = n count1 = 0 count2 = 0 point = 1 for i in range(n): if nums[p_[i] + 1] == False: nums[p_[i]+1] = True count1 += cou else: if nums[p_[i]]: count2 += cou for j in range(point, n+1): if nums[j] == False: nums[j] = True nx = j break point = nx else: nums[p_[i]] = True cou -= 1 print(count1 - count2) if __name__ == '__main__': main()