結果
問題 | No.482 あなたの名は |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 21:03:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 294 ms / 2,000 ms |
コード長 | 1,716 bytes |
コンパイル時間 | 887 ms |
コンパイル使用メモリ | 87,332 KB |
実行使用メモリ | 125,128 KB |
最終ジャッジ日時 | 2023-08-21 09:04:49 |
合計ジャッジ時間 | 11,343 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
92,348 KB |
testcase_01 | AC | 240 ms
92,484 KB |
testcase_02 | AC | 238 ms
92,468 KB |
testcase_03 | AC | 237 ms
92,580 KB |
testcase_04 | AC | 240 ms
92,548 KB |
testcase_05 | AC | 243 ms
92,496 KB |
testcase_06 | AC | 237 ms
92,332 KB |
testcase_07 | AC | 239 ms
92,452 KB |
testcase_08 | AC | 241 ms
92,380 KB |
testcase_09 | AC | 241 ms
92,464 KB |
testcase_10 | AC | 241 ms
92,636 KB |
testcase_11 | AC | 241 ms
92,416 KB |
testcase_12 | AC | 237 ms
92,304 KB |
testcase_13 | AC | 239 ms
92,384 KB |
testcase_14 | AC | 240 ms
92,628 KB |
testcase_15 | AC | 285 ms
124,964 KB |
testcase_16 | AC | 288 ms
124,756 KB |
testcase_17 | AC | 284 ms
124,812 KB |
testcase_18 | AC | 284 ms
125,016 KB |
testcase_19 | AC | 281 ms
124,844 KB |
testcase_20 | AC | 280 ms
124,876 KB |
testcase_21 | AC | 284 ms
125,128 KB |
testcase_22 | AC | 283 ms
124,736 KB |
testcase_23 | AC | 294 ms
125,100 KB |
testcase_24 | AC | 282 ms
124,820 KB |
testcase_25 | AC | 285 ms
125,036 KB |
testcase_26 | AC | 287 ms
124,736 KB |
testcase_27 | AC | 287 ms
124,984 KB |
testcase_28 | AC | 286 ms
124,752 KB |
testcase_29 | AC | 284 ms
125,112 KB |
testcase_30 | AC | 242 ms
92,464 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, K = i_map() D = i_list() now = [0] * (N+1) for i in range(N): now[D[i]] = i ans = 0 for i in range(N): if D[i] != i+1: p = now[i+1] D[p] = D[i] now[D[i]] = p ans += 1 if ans > K: print('NO') exit() if ans % 2 == K % 2: print('YES') else: print('NO') if __name__ == '__main__': main()