結果
問題 | No.482 あなたの名は |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 20:59:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,693 bytes |
コンパイル時間 | 1,624 ms |
コンパイル使用メモリ | 86,016 KB |
実行使用メモリ | 124,972 KB |
最終ジャッジ日時 | 2023-08-21 09:03:00 |
合計ジャッジ時間 | 13,159 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 249 ms
92,232 KB |
testcase_01 | AC | 249 ms
92,160 KB |
testcase_02 | AC | 251 ms
92,120 KB |
testcase_03 | AC | 252 ms
91,724 KB |
testcase_04 | AC | 255 ms
91,816 KB |
testcase_05 | WA | - |
testcase_06 | AC | 250 ms
92,116 KB |
testcase_07 | AC | 251 ms
92,000 KB |
testcase_08 | AC | 248 ms
92,100 KB |
testcase_09 | AC | 247 ms
91,996 KB |
testcase_10 | AC | 249 ms
92,244 KB |
testcase_11 | AC | 248 ms
92,076 KB |
testcase_12 | WA | - |
testcase_13 | AC | 247 ms
92,224 KB |
testcase_14 | AC | 248 ms
92,084 KB |
testcase_15 | AC | 306 ms
124,972 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 300 ms
124,788 KB |
testcase_19 | AC | 304 ms
124,716 KB |
testcase_20 | AC | 301 ms
124,472 KB |
testcase_21 | AC | 300 ms
124,760 KB |
testcase_22 | AC | 303 ms
124,864 KB |
testcase_23 | AC | 304 ms
124,720 KB |
testcase_24 | AC | 296 ms
124,496 KB |
testcase_25 | AC | 297 ms
124,460 KB |
testcase_26 | WA | - |
testcase_27 | AC | 300 ms
124,564 KB |
testcase_28 | WA | - |
testcase_29 | AC | 297 ms
124,772 KB |
testcase_30 | WA | - |
ソースコード
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] ans += 1 if ans > K: print('NO') exit() if ans % 2 == K % 2: print('YES') else: print('NO') if __name__ == '__main__': main()