結果

問題 No.2504 NOT Path Painting
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-10-13 22:11:53
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 322 ms / 2,000 ms
コード長 4,276 bytes
コンパイル時間 4,247 ms
コンパイル使用メモリ 154,596 KB
実行使用メモリ 21,196 KB
最終ジャッジ日時 2024-09-15 17:54:08
合計ジャッジ時間 9,886 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 185 ms
6,816 KB
testcase_02 AC 179 ms
6,940 KB
testcase_03 AC 179 ms
6,940 KB
testcase_04 AC 180 ms
6,944 KB
testcase_05 AC 179 ms
6,940 KB
testcase_06 AC 180 ms
6,940 KB
testcase_07 AC 178 ms
6,944 KB
testcase_08 AC 180 ms
6,940 KB
testcase_09 AC 179 ms
6,940 KB
testcase_10 AC 177 ms
6,944 KB
testcase_11 AC 178 ms
6,940 KB
testcase_12 AC 185 ms
6,940 KB
testcase_13 AC 240 ms
6,940 KB
testcase_14 AC 258 ms
6,940 KB
testcase_15 AC 299 ms
13,460 KB
testcase_16 AC 297 ms
13,436 KB
testcase_17 AC 297 ms
13,588 KB
testcase_18 AC 266 ms
13,564 KB
testcase_19 AC 322 ms
20,408 KB
testcase_20 AC 288 ms
21,196 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;


int N;
int[] A, B;

int[][] graph;
int[] sz;
Mint ans;

Mint calc(long b) {
  const a = 1L * N * (N + 1) / 2;
  assert(0 <= b);
  assert(b < a);
  return Mint(a) / Mint(a - b);
}

void dfs(int u, int p) {
  long ver = 1L * N * N;
  sz[u] = 1;
  foreach (v; graph[u]) if (p != v) {
    dfs(v, u);
    ver -= 1L * sz[v] * sz[v];
    sz[u] += sz[v];
  }
  ver -= 1L * (N - sz[u]) * (N - sz[u]);
  ver += 1;
  assert(ver % 2 == 0);
  ver /= 2;
  const edg = 1L * sz[u] * (N - sz[u]);
  debug {
    writeln(u, ": ", ver, " ", edg);
  }
  ans += calc(ver);
  if (~p) {
    ans -= calc(edg);
  }
}

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        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;
        }
        
        graph = new int[][N];
        foreach (i; 0 .. N - 1) {
          graph[A[i]] ~= B[i];
          graph[B[i]] ~= A[i];
        }
        sz = new int[N];
        ans = 0;
        dfs(0, -1);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
0