結果

問題 No.2377 SUM AND XOR on Tree
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-09-16 20:50:14
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 230 ms / 4,000 ms
コード長 4,276 bytes
コンパイル時間 3,645 ms
コンパイル使用メモリ 151,936 KB
実行使用メモリ 45,428 KB
最終ジャッジ日時 2024-07-03 19:58:03
合計ジャッジ時間 10,165 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 188 ms
9,972 KB
testcase_09 AC 203 ms
9,848 KB
testcase_10 AC 190 ms
9,972 KB
testcase_11 AC 200 ms
9,844 KB
testcase_12 AC 197 ms
9,968 KB
testcase_13 AC 189 ms
9,964 KB
testcase_14 AC 187 ms
9,764 KB
testcase_15 AC 183 ms
9,756 KB
testcase_16 AC 180 ms
9,724 KB
testcase_17 AC 184 ms
9,776 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 174 ms
9,192 KB
testcase_24 AC 183 ms
9,188 KB
testcase_25 AC 197 ms
10,072 KB
testcase_26 AC 213 ms
45,428 KB
testcase_27 AC 230 ms
45,344 KB
testcase_28 AC 225 ms
45,428 KB
testcase_29 AC 177 ms
9,844 KB
testcase_30 AC 180 ms
9,844 KB
testcase_31 AC 180 ms
9,844 KB
testcase_32 AC 174 ms
9,408 KB
testcase_33 AC 174 ms
9,408 KB
testcase_34 AC 179 ms
9,404 KB
権限があれば一括ダウンロードができます

ソースコード

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;


enum E = 30;

int N;
int[] A, B;
int[] C;

int[][] graph;

Mint[2][E] dfs(int u, int p) {
  Mint[2][E] ret;
  foreach (e; 0 .. E) {
    ret[e][C[u] >> e & 1] = 1;
  }
  foreach (v; graph[u]) if (p != v) {
    const res = dfs(v, u);
    foreach (e; 0 .. E) {
      Mint[2] crt = ret[e], nxt;
      // cut
      static foreach (x; 0 .. 2) {
        // cut
        nxt[x] += crt[x] * res[e][1];
        // connect
        static foreach (y; 0 .. 2) {
          nxt[x ^ y] += crt[x] * res[e][y];
        }
      }
      ret[e] = nxt;
    }
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      C = new int[N];
      foreach (u; 0 .. N) {
        C[u] = readInt;
      }
      
      graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      const res = dfs(0, -1);
      Mint ans;
      foreach (e; 0 .. E) {
        ans += Mint(1 << e) * res[e][1];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0