結果

問題 No.1612 I hate Construct a Palindrome
コンテスト
ユーザー tamato
提出日時 2021-07-21 22:38:38
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 4,615 bytes
コンパイル時間 145 ms
コンパイル使用メモリ 82,684 KB
実行使用メモリ 214,704 KB
最終ジャッジ日時 2024-07-17 19:40:39
合計ジャッジ時間 13,554 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34 RE * 2
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    from collections import deque
    input = sys.stdin.readline

    class UnionFind():
        def __init__(self, n):
            self.n = n
            self.root = [-1] * (n + 1)
            self.rnk = [0] * (n + 1)

        def find_root(self, x):
            while self.root[x] >= 0:
                x = self.root[x]
            return x

        def unite(self, x, y):
            x = self.find_root(x)
            y = self.find_root(y)
            if x == y:
                return
            elif self.rnk[x] > self.rnk[y]:
                self.root[x] += self.root[y]
                self.root[y] = x
            else:
                self.root[y] += self.root[x]
                self.root[x] = y
                if self.rnk[x] == self.rnk[y]:
                    self.rnk[y] += 1

        def isSameGroup(self, x, y):
            return self.find_root(x) == self.find_root(y)

        def size(self, x):
            return -self.root[self.find_root(x)]

    def is_pal(S):
        if S == list(reversed(S)):
            return 1
        else:
            return 0

    N, M = map(int, input().split())
    adj = [[] for _ in range(N+1)]
    S = set()
    E = {}
    I = {}
    ABC = []
    for i in range(M):
        a, b, c = input().split()
        a = int(a)
        b = int(b)
        S.add(c)
        adj[a].append((b, c))
        adj[b].append((a, c))
        E[a * (N+1) + b] = c
        E[b * (N+1) + a] = c
        I[a * (N + 1) + b] = i+1
        I[b * (N + 1) + a] = i+1
        ABC.append((a, b, c))
    if len(S) == 1:
        print(-1)
        exit()

    que = deque()
    que.append(1)
    seen = [-1] * (N+1)
    seen[1] = 0
    par = [0] * (N+1)
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u, _ in adj[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                que.append(u)

    v = N
    ans = []
    color = []
    while v != 1:
        p = par[v]
        color.append(E[v * (N+1) + p])
        ans.append(I[v * (N+1) + p])
        v = p
    ans.reverse()
    color.reverse()
    if not is_pal(color):
        print(len(ans))
        print(*ans, sep="\n")
        exit()

    for _ in range(2):
        ans.append(ans[-1])
        color.append(color[-1])
    if not is_pal(color):
        print(len(ans))
        print(*ans, sep="\n")
        exit()

    c0 = color[0]
    adj_new = [[] for _ in range(N+1)]
    UF = UnionFind(N)
    for a, b, c in ABC:
        if c == c0:
            adj_new[a].append((b, c))
            adj_new[b].append((a, c))
            UF.unite(a, b)

    assert UF.isSameGroup(1, N)
    flg = 0
    for v in range(1, N+1):
        if UF.isSameGroup(1, v):
            for u, _ in adj[v]:
                if flg:
                    break
                c = E[v * (N+1) + u]
                if c != c0:
                    adj_new[v].append((u, c))
                    adj_new[u].append((v, c))
                    uu = u
                    flg = 1
                    break
        if flg:
            break

    # go to uu
    que = deque()
    que.append(1)
    seen = [-1] * (N + 1)
    seen[1] = 0
    par = [0] * (N + 1)
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u, _ in adj_new[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                que.append(u)

    v = uu
    ans = []
    color = []
    while v != 1:
        p = par[v]
        color.append(E[v * (N + 1) + p])
        ans.append(I[v * (N + 1) + p])
        v = p
    ans.reverse()
    color.reverse()

    # go to N
    que = deque()
    que.append(uu)
    seen = [-1] * (N + 1)
    seen[uu] = 0
    par = [0] * (N + 1)
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u, _ in adj_new[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                que.append(u)

    v = N
    ans2 = []
    color2 = []
    while v != uu:
        p = par[v]
        color2.append(E[v * (N + 1) + p])
        ans2.append(I[v * (N + 1) + p])
        v = p
    ans2.reverse()
    color2.reverse()

    ans.extend(ans2)
    color.extend(color2)
    if not is_pal(color):
        print(len(ans))
        print(*ans, sep="\n")
    else:
        for _ in range(2):
            ans.append(ans[-1])
            color.append(color[-1])
        assert is_pal(color) == 0
        print(len(ans))
        print(*ans, sep="\n")


if __name__ == '__main__':
    main()
0