#551832 (D) No.1227 I hate ThREE

提出ソース

結果

問題	No.1227 I hate ThREE
ユーザー	👑 hos.lyric
提出日時	2020-09-11 23:04:57
言語	D (dmd 2.106.1)
結果	AC
実行時間	302 ms / 2,000 ms
コード長	4,753 bytes
コンパイル時間	1,648 ms
コンパイル使用メモリ	157,012 KB
実行使用メモリ	71,496 KB
最終ジャッジ日時	2024-06-22 09:00:52
合計ジャッジ時間	3,510 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	10 ms 6,940 KB
testcase_04	AC	5 ms 6,940 KB
testcase_05	AC	6 ms 6,940 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	9 ms 6,940 KB
testcase_09	AC	8 ms 6,940 KB
testcase_10	AC	5 ms 6,944 KB
testcase_11	AC	60 ms 6,940 KB
testcase_12	AC	66 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	4 ms 6,940 KB
testcase_15	AC	4 ms 6,940 KB
testcase_16	AC	7 ms 6,940 KB
testcase_17	AC	5 ms 6,940 KB
testcase_18	AC	10 ms 6,944 KB
testcase_19	AC	7 ms 6,940 KB
testcase_20	AC	8 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	7 ms 6,940 KB
testcase_23	AC	292 ms 71,496 KB
testcase_24	AC	161 ms 24,896 KB
testcase_25	AC	302 ms 70,456 KB
testcase_26	AC	13 ms 6,940 KB
testcase_27	AC	12 ms 6,944 KB
testcase_28	AC	14 ms 6,940 KB
testcase_29	AC	12 ms 6,944 KB
testcase_30	AC	13 ms 6,940 KB
testcase_31	AC	11 ms 6,940 KB
testcase_32	AC	12 ms 6,940 KB
testcase_33	AC	11 ms 6,940 KB
testcase_34	AC	11 ms 6,940 KB
testcase_35	AC	9 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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; }
real readReal() { return readToken.to!real; }

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(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;


int N;
int[] A, B;

int[][] G;
int[] sz;

void dfs(int u, int p) {
  sz[u] = 1;
  foreach (i; G[u]) {
    const v = A[i] ^ B[i] ^ u;
    if (v != p) {
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
}

Mint[] all;
long M;
Mint[long][] cache;

Mint calc(int u, int p, long k) {
  chmin(k, M - 1 - k);
  if (0 <= k - sz[u] && k + sz[u] < M) {
    return all[u];
  }
  Mint ret;
  cache[u].update(k, {
    ret = 1;
    foreach (i; G[u]) {
      const v = A[i] ^ B[i] ^ u;
      if (v != p) {
        Mint sum;
        if (0 <= k - 1) {
          sum += calc(v, u, k - 1);
        }
        if (k + 1 < M) {
          sum += calc(v, u, k + 1);
        }
        ret *= sum;
      }
    }
    return ret;
  }, (ref Mint r) {
    return ret = r;
  });
  return ret;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      const C = readLong();
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      G = new int[][N];
      foreach (i; 0 .. N - 1) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      sz = new int[N];
      dfs(0, -1);
      
      all = new Mint[N];
      foreach (u; 0 .. N) {
        all[u] = Mint(2)^^(sz[u] - 1);
      }
      debug {
        writeln("all = ", all);
      }
      
      Mint ans;
      foreach (r; 0 .. 3) {
        M = (C + (3 - 1 - r)) / 3;
        debug {
          writeln("M = ", M);
        }
        cache = new Mint[long][N];
        if (M >= N + N) {
          foreach (k; 0 .. N) {
            ans += calc(0, -1, k);
            ans += calc(0, -1, k);
          }
          ans += calc(0, -1, N) * (M - N - N);
        } else {
          foreach (k; 0 .. M) {
            ans += calc(0, -1, k);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード