結果

問題 No.3104 Simple Graph Problem
ユーザー 👑 hos.lyric
提出日時 2025-04-11 22:16:08
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 205 ms / 2,000 ms
コード長 5,143 bytes
コンパイル時間 1,794 ms
コンパイル使用メモリ 140,748 KB
実行使用メモリ 24,196 KB
最終ジャッジ日時 2025-04-11 22:16:21
合計ジャッジ時間 10,940 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 65
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = cast(uint)(x_ % M); }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


int N, M;
Mint[] T;
int[] A, B;

int[][] G;
int[] dep, pari;
int I, U, V;
int[] us;
void dfs(int u, int pi) {
  pari[u] = pi;
  us ~= u;
  foreach (i; G[u]) if (pi != i) {
    const v = A[i] ^ B[i] ^ u;
    if (~dep[v]) {
      if ((dep[u] - dep[v]) % 2 == 0) {
        I = i;
        U = u;
        V = v;
      }
    } else {
      dep[v] = dep[u] + 1;
      dfs(v, i);
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      M = readInt;
      T = new Mint[N];
      foreach (u; 0 .. N) {
        T[u] = readInt;
      }
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      dep = new int[N];
      pari = new int[N];
      dep[] = -1;
      pari[] = -1;
      I = U = V = -1;
      us = [];
      dep[0] = 0;
      dfs(0, -1);
      debug {
        writeln("dep = ", dep);
        writeln("pari = ", pari);
        writefln("I = %s, U = %s, V = %s", I, U, V);
        writeln("us = ", us);
      }
      
      auto ans = new Mint[M];
      auto now = new Mint[N];
      Mint[2] sums;
      foreach (u; 0 .. N) sums[dep[u] & 1] += T[u];
      if (~I) {
        const side = dep[U] & 1;
        const val = (sums[side] - sums[side ^ 1]) / 2;
        ans[I] += val;
        now[U] += val;
        now[V] += val;
      }
      debug writeln(ans, " ", now);
      foreach_reverse (u; us) {
        const i = pari[u];
        if (~i) {
          const val = T[u] - now[u];
          ans[i] += val;
          now[A[i]] += val;
          now[B[i]] += val;
        }
        debug writeln(u, " ", ans, " ", now);
        if (now[u] != T[u]) {
          ans = null;
          break;
        }
      }
      if (ans) {
        foreach (i; 0 .. M) {
          if (i) write(" ");
          write(ans[i]);
        }
        writeln;
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}
0