結果

問題 No.3104 Simple Graph Problem
ユーザー hint908
提出日時 2025-04-11 22:35:19
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 108 ms / 2,000 ms
コード長 3,643 bytes
コンパイル時間 4,010 ms
コンパイル使用メモリ 288,760 KB
実行使用メモリ 19,840 KB
最終ジャッジ日時 2025-04-11 22:35:31
合計ジャッジ時間 11,440 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 65
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}



void solve(){
    ll n,m;
    cin >> n >> m;
    V<ll> a(n);
    rep(i,n) cin >> a[i];
    V<ll> x(m), y(m);
    VV<pair<ll,ll>> G(n);
    rep(i,m){
        cin >> x[i] >> y[i];
        x[i]--;
        y[i]--;
        G[x[i]].eb(y[i], i);
        G[y[i]].eb(x[i], i);
    }
    V<ll> ans(m, 0);
    V<ll> used(n, 0);
    V<ll> depth(n, 0);
    auto dfs = [&](auto&&dfs, ll nd, ll par, ll flag) -> void {
        used[nd] = 1;
        for(auto [nx, id]:G[nd]) if(!used[nx]){
            depth[nx] = depth[nd] + 1;
            dfs(dfs, nx, nd, flag);
            if(flag){
                ans[id] = a[nx];
                (a[nx] += mod-ans[id])%=mod;
                (a[nd] += mod-ans[id])%=mod;
            }
        }
    };
    dfs(dfs, 0, -1, 0);
    ll odd = 0, even = 0;
    rep(i, n){
        if(depth[i]%2) odd += a[i];
        else even += a[i];
    }
    ll f = 0;
    rep(i, m) if((depth[x[i]]+depth[y[i]])%2 == 0) f = 1;
    if((!f and odd%mod != even%mod)){
        cout << -1 << endl;
        return;
    }
    if(f){
        rep(i, m) if((depth[x[i]]+depth[y[i]])%2 == 0){
            if(depth[x[i]]%2){
                ll b = (odd-even)%mod;
                (b += mod)%=mod;
                if(b%2) b+=mod;
                b /= 2;
                ans[i] = b;
                (a[x[i]] += mod-b)%=mod;
                (a[y[i]] += mod-b)%=mod;
            }else{
                ll b = (even-odd)%mod;
                (b += mod) %= mod;
                if(b%2) b+=mod;
                b /= 2;
                ans[i] = b;
                (a[x[i]] += mod-b)%=mod;
                (a[y[i]] += mod-b)%=mod;
            }
            break;
        }
    }
    used.assign(n, 0);
    dfs(dfs, 0, -1, 1);
    rep(i, m) cout << ans[i] << " \n"[i==m-1];
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}
0