結果
問題 | No.482 あなたの名は |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 20:59:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,693 bytes |
コンパイル時間 | 745 ms |
コンパイル使用メモリ | 82,396 KB |
実行使用メモリ | 121,088 KB |
最終ジャッジ日時 | 2024-05-08 14:20:45 |
合計ジャッジ時間 | 7,878 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
89,244 KB |
testcase_01 | AC | 145 ms
89,368 KB |
testcase_02 | AC | 146 ms
89,728 KB |
testcase_03 | AC | 146 ms
89,728 KB |
testcase_04 | AC | 145 ms
89,364 KB |
testcase_05 | WA | - |
testcase_06 | AC | 144 ms
89,472 KB |
testcase_07 | AC | 146 ms
89,728 KB |
testcase_08 | AC | 147 ms
89,376 KB |
testcase_09 | AC | 145 ms
89,408 KB |
testcase_10 | AC | 145 ms
89,472 KB |
testcase_11 | AC | 145 ms
89,216 KB |
testcase_12 | WA | - |
testcase_13 | AC | 146 ms
89,696 KB |
testcase_14 | AC | 146 ms
89,472 KB |
testcase_15 | AC | 193 ms
120,860 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 191 ms
120,448 KB |
testcase_19 | AC | 192 ms
120,960 KB |
testcase_20 | AC | 191 ms
120,660 KB |
testcase_21 | AC | 189 ms
120,900 KB |
testcase_22 | AC | 189 ms
121,088 KB |
testcase_23 | AC | 190 ms
120,448 KB |
testcase_24 | AC | 188 ms
120,704 KB |
testcase_25 | AC | 188 ms
120,960 KB |
testcase_26 | WA | - |
testcase_27 | AC | 188 ms
120,864 KB |
testcase_28 | WA | - |
testcase_29 | AC | 188 ms
120,960 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()