結果

問題 No.3104 Simple Graph Problem
コンテスト
ユーザー lif4635
提出日時 2025-04-11 22:27:15
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,342 bytes
コンパイル時間 287 ms
コンパイル使用メモリ 82,444 KB
実行使用メモリ 216,696 KB
最終ジャッジ日時 2025-04-11 22:27:45
合計ジャッジ時間 21,264 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 56 WA * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


# 連結だよ！！！
n,m = MI()
b = LI()

edge = [[] for i in range(n)]
e = []

for i in range(m):
    u,v = MI_1()
    edge[u].append((v, i))
    edge[v].append((u, i))
    e.append((u, v))

# if n-1 == m: # tree
#     que = [(0, inf),(0, -1)]
#     ans = [0] * m
#     par = [-1] * n
#     a = [0] * n
#     while que:
#         u, f = que.pop()
#         if f == -1:
#             for v, i in edge[u]:
#                 if par[u] == v: continue
#                 par[v] = u
#                 que.append((v, i))
#                 que.append((v, -1))
#         else:
#             p = par[u]
#             if p == -1:
#                 # print(a, b)
#                 if a == b:
#                     print(*ans)
#                 else:
#                     print(-1)
#                 exit()
            
#             x = (b[u] - a[u]) % mod
#             ans[i] = x
#             a[u] = (a[u] + x) % mod
#             a[p] = (a[p] + x) % mod
            

# 木ではない場合 
# 適当な全域木を取る
# それでだめな時適当な辺を取る
# これで調節する

cnt = [0, 0] # 累積わ
dis = [-1] * n # 0,1
edgeuse = [False] * m

def dfs(p, v, i):
    cnt[dis[v]] += b[v]
    cnt[dis[v]] %= mod
    edgeuse[i] = True
    for u, i in edge[v]:
        if dis[u] != -1: continue
        dis[u] = dis[v] ^ 1
        dfs(v, u, i)
    
dis[0] = 0
# cnt[0] += b[0]
dfs(-1, 0, -1)
# print(cnt)
a = [0] * n
ans = [0] * m
if (cnt[0] - cnt[1]) % mod != 0:
    for i, (u, v) in enumerate(e):
        if dis[u] != dis[v]:
            continue
        f = dis[u]
        d = cnt[f] - cnt[f^1]
        x = d * pow(2, -1, mod) % mod
        # これを双方に足す
        ans[i] = x
        a[v] += x
        a[u] += x 
        break
    else:
        print(-1)
        exit()

def dfs2(p, v, i):
    # print(p, v, i)
    for u, j in edge[v]:
        if edgeuse[j]:
            edgeuse[j] = False
            dfs2(v, u, j)
    
    if p == -1:
        return
    
    x = (b[v] - a[v]) % mod
    ans[i] = x
    a[v] = (x + a[v]) % mod
    a[p] = (x + a[p]) % mod
    return

# print(a)
dfs2(-1, 0, -1)
# print(a)
print(*ans)
0