結果

問題 No.2254 Reverse Only
ユーザー first_vilfirst_vil
提出日時 2023-03-24 22:18:53
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,170 bytes
コンパイル時間 283 ms
コンパイル使用メモリ 82,500 KB
実行使用メモリ 135,060 KB
最終ジャッジ日時 2024-09-18 17:15:23
合計ジャッジ時間 9,808 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
53,120 KB
testcase_01 AC 44 ms
52,736 KB
testcase_02 AC 42 ms
52,992 KB
testcase_03 AC 43 ms
53,120 KB
testcase_04 AC 42 ms
52,992 KB
testcase_05 AC 42 ms
52,608 KB
testcase_06 AC 42 ms
52,992 KB
testcase_07 AC 43 ms
52,992 KB
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 135 ms
109,152 KB
testcase_11 AC 211 ms
114,636 KB
testcase_12 AC 206 ms
115,408 KB
testcase_13 AC 134 ms
108,364 KB
testcase_14 AC 208 ms
115,284 KB
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 AC 209 ms
115,372 KB
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 AC 51 ms
61,312 KB
testcase_28 AC 164 ms
87,424 KB
testcase_29 AC 126 ms
104,832 KB
testcase_30 RE -
testcase_31 AC 82 ms
82,304 KB
testcase_32 AC 89 ms
85,376 KB
testcase_33 AC 65 ms
70,528 KB
testcase_34 AC 145 ms
104,064 KB
testcase_35 AC 115 ms
98,048 KB
testcase_36 AC 373 ms
129,696 KB
testcase_37 AC 368 ms
127,368 KB
testcase_38 AC 75 ms
77,184 KB
testcase_39 RE -
testcase_40 AC 50 ms
61,312 KB
testcase_41 AC 104 ms
93,184 KB
testcase_42 AC 78 ms
77,952 KB
testcase_43 AC 149 ms
102,016 KB
testcase_44 AC 207 ms
113,804 KB
testcase_45 RE -
testcase_46 AC 50 ms
60,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

int1 = lambda x: int(x) - 1

# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]

INF = float("inf")
# mod = int(1e9 + 7)
mod = 998244353


class dsu:
    n = 1
    parent_or_size = [-1 for i in range(n)]

    def __init__(self, N):
        self.n = N
        self.parent_or_size = [-1 for i in range(N)]

    def merge(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        x = self.leader(a)
        y = self.leader(b)
        if x == y:
            return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        if self.parent_or_size[a] < 0:
            return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [0 for i in range(self.n)]
        group_size = [0 for i in range(self.n)]
        for i in range(self.n):
            leader_buf[i] = self.leader(i)
            group_size[leader_buf[i]] += 1
        result = [[] for i in range(self.n)]
        for i in range(self.n):
            result[leader_buf[i]].append(i)
        result2 = []
        for i in range(self.n):
            if len(result[i]) > 0:
                result2.append(result[i])
        return result2


n, k = mi()
a = li()
b = li()
if a == b:
    print("Yes")
    exit()
if sorted(a) != sorted(b):
    print("No")
    exit()
if k <= 2:
    print("Yes")
    exit()
if k > n:
    print("No")
    exit()
uf = dsu(n)
for i in range(k + 1, n - 1):
    uf.merge(i, i - (k + 1))
    uf.merge(i, i + 1)
    uf.merge(n - 1 - i, n - 1 - i + k + 1)
    uf.merge(n - 1 - i, n - 1 - (i + 1))
if k == 3:
    for i in range(n - 2):
        uf.merge(i, i + 2)
sa = [list() for i in range(n)]
sb = [list() for i in range(n)]
for i in range(n):
    r = uf.leader(i)
    sa[r].append(a[i])
    sb[r].append(b[i])
ans = "Yes"
for i in range(n):
    if sorted(sa[i]) != sorted(sb[i]):
        ans = "No"
        break
if k == 3:
    print(ans)
    exit()
if ans == "No":
    exit(-1)
    r = uf.leader(0)
    x = [a[i] for i in range(n) if uf.leader(i) != r]
    y = [b[i] for i in range(n) if uf.leader(i) != r]
    if sorted(sa[r]) == sorted(sb[r]) and (x == y or x == y[::-1]):
        ans = "Yes"
print(ans)
0