結果

問題 No.1190 Points
ユーザー lam6er
提出日時 2025-04-15 21:41:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 434 ms / 2,000 ms
コード長 2,944 bytes
コンパイル時間 426 ms
コンパイル使用メモリ 82,116 KB
実行使用メモリ 108,548 KB
最終ジャッジ日時 2025-04-15 21:43:34
合計ジャッジ時間 8,575 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque

def main():
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx += 1
    M = int(input[idx]); idx += 1
    P = int(input[idx]); idx += 1
    S = int(input[idx]) - 1; idx += 1  # Convert to 0-based index
    G = int(input[idx]) - 1; idx += 1  # Convert to 0-based index

    # Build adjacency list
    adj = [[] for _ in range(N)]
    for _ in range(M):
        u = int(input[idx]) - 1; idx += 1
        v = int(input[idx]) - 1; idx += 1
        adj[u].append(v)
        adj[v].append(u)

    # BFS from S to compute even_s and odd_s
    even_s = [float('inf')] * N
    odd_s = [float('inf')] * N
    q = deque()
    even_s[S] = 0
    q.append((S, 0))  # (node, parity)
    while q:
        u, parity = q.popleft()
        current_dist = even_s[u] if parity == 0 else odd_s[u]
        for v in adj[u]:
            new_parity = 1 - parity
            new_dist = current_dist + 1
            if new_parity == 0:
                if new_dist < even_s[v]:
                    even_s[v] = new_dist
                    q.append((v, new_parity))
            else:
                if new_dist < odd_s[v]:
                    odd_s[v] = new_dist
                    q.append((v, new_parity))

    # BFS from G to compute even_g and odd_g
    even_g = [float('inf')] * N
    odd_g = [float('inf')] * N
    q = deque()
    even_g[G] = 0
    q.append((G, 0))  # (node, parity)
    while q:
        u, parity = q.popleft()
        current_dist = even_g[u] if parity == 0 else odd_g[u]
        for v in adj[u]:
            new_parity = 1 - parity
            new_dist = current_dist + 1
            if new_parity == 0:
                if new_dist < even_g[v]:
                    even_g[v] = new_dist
                    q.append((v, new_parity))
            else:
                if new_dist < odd_g[v]:
                    odd_g[v] = new_dist
                    q.append((v, new_parity))

    ans = []
    for u in range(N):
        valid = False
        for a_parity in [0, 1]:
            for b_parity in [0, 1]:
                if (a_parity + b_parity) % 2 != P % 2:
                    continue
                a_min = even_s[u] if a_parity == 0 else odd_s[u]
                b_min = even_g[u] if b_parity == 0 else odd_g[u]
                if a_min == float('inf') or b_min == float('inf'):
                    continue
                total_min = a_min + b_min
                if total_min > P:
                    continue
                remaining = P - total_min
                if remaining >= 0 and remaining % 2 == 0:
                    valid = True
                    break
            if valid:
                break
        if valid:
            ans.append(u + 1)  # Convert back to 1-based index

    if not ans:
        print(-1)
    else:
        ans.sort()
        print(len(ans))
        for node in ans:
            print(node)

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