#431430 (D) No.30 たこやき工場

• 問題: No.30 たこやき工場
• ユーザー: te-sh
• 提出日時: 2020-02-18 17:23:44
• 言語: D (dmd 2.111.0)
• 結果: AC
• 実行時間: 3 ms / 5,000 ms
• コード長: 10,231 bytes
• コンパイル時間: 1,205 ms
• コンパイル使用メモリ: 149,284 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 05:16:45
• 合計ジャッジ時間: 1,559 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
other	AC * 17

コンパイルメッセージ

Main.d(341): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", int).put.putMain!(c, int).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-329(329):        instantiated from here: `putMain!(c, int)`
Main.d(33):        instantiated from here: `put!("{}", int)`

ソースコード

// URL: https://yukicoder.me/problems/no/30

import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;

version(unittest) {} else
void main()
{
  int N; io.getV(N);

  auto g = Graph(N);
  auto p = new Vector[](N);
  foreach (i, ref pi; p) {
    pi = Vector(N);
    pi[i] = 1;
  }

  int M; io.getV(M);
  foreach (_; 0..M) {
    int P, Q, R; io.getV(P, Q, R); --P, --R;
    g.addEdge(R, P);
    p[R][R] = 0;
    p[R][P] = Q;
  }

  foreach_reverse (u; g.topologicalSort.nodes) {
    if (!g[u].empty) {
      auto q = Vector(N);
      foreach (v; g[u]) q += p[v]*p[u][v];
      p[u] = q;
    }
  }

  foreach (i; 0..N-1) io.put(p[N-1][i]);
}

alias me = MatrixElement!int, Vector = me.Vector;
auto lowerBoundBy(alias conv = "a", alias comp = "a<b", R, T)(R a, T v)
{ return a.sortedTuple!(conv, comp).lowerBound(tuple(a.front, v)).map!"a[0]"; }

auto upperBoundBy(alias conv = "a", alias comp = "a<b", R, T)(R a, T v)
{ return a.sortedTuple!(conv, comp).upperBound(tuple(a.front, v)).map!"a[0]"; }

auto sortedTuple(alias conv = "a", alias comp = "a<b", R)(R a)
{
  import std.functional;
  alias convFun = unaryFun!conv, compFun = binaryFun!comp;
  return a.map!(e => tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1]));
}

pure T isqrt(T)(T n)
{
  static if (is(T == int)) auto max = 46341;
  else static if (is(T == long)) auto max = 3037000500L;
  return iota(T(0), max).lowerBoundBy!("a^^2", "a<=b")(n).back;
}

pure T icbrt(T)(T n)
{
  static if (is(T == int)) auto max = 1291;
  else static if (is(T == long)) auto max = 2097152L;
  return iota(T(0), max).lowerBoundBy!("a^^3", "a<=b")(n).back;
}

pure T powr(alias pred = "a*b", T, U)(T a, U n, T one)
{
  import std.functional;
  alias predFun = binaryFun!pred;
  if (n == 0) return one;
  auto r = one;
  for (; n > 0; n >>= 1) { if (n&1) r = predFun(r, a); a = predFun(a, a); }
  return r;
}
pure T powr(alias pred = "a*b", T, U)(T a, U n) { return powr!(pred, T, U)(a, n, T(1)); }

pure T extGcd(T)(T a, T b, out T x, out T y)
{
  auto g = a; x = 1; y = 0;
  if (b) { g = extGcd(b, a%b, y, x); y -= a/b*x; }
  return g;
}

template MatrixElement(T, alias zero = 0, alias one = 1)
{
  struct Vector
  {
    size_t n;
    @property T[] array() { return a; }
    alias array this;

    this(size_t n) in { assert(n > 0); } do
    {
      this.n = n;
      a = new T[](n);
      static if (T.init != zero) a[] = zero;
    }
    this(U)(U[] b) in { assert(b.length > 0); } do
    {
      n = b.length;
      static if (is(T == U)) a = b;
      else { a = new T[](n); foreach (i; 0..n) a[i] = b[i]; }
    }

    pure Vector dup() { auto b = Vector(n); b[] = a[]; return b; }

    pure Vector opBinary(string op)(Vector b) if (op=="+"||op=="-") in { assert(n == b.n); } do
    { auto x = Vector(n); foreach (i; 0..n) x[i] = mixin("a[i]"~op~"b[i]"); return x; }
    ref Vector opOpAssign(string op)(Vector b) if (op=="+"||op=="-") in { assert(n == b.n); } do
    { foreach (i; 0..n) mixin("a[i]"~op~"=b[i];"); return this; }
    pure Vector opBinary(string op: "*")(T b)
    { auto x = Vector(n); foreach (i; 0..n) x[i] = a[i]*b; return x; }
    ref Vector opOpAssign(string op: "*")(T b)
    { foreach (i; 0..n) a[i] *= b; return this; }

    pure T opBinary(string op: "*")(Vector b) in { assert(n == b.n); } do
    { auto x = zero; foreach (i; 0..n) x += a[i]*b[i]; return x; }

    private T[] a;
  }

  pure T hypot2(Vector a) { return a*a; }
  pure Vector cross(Vector a, Vector b) in { assert(a.n == 3 && b.n == 3); } do
  { return Vector([a[1]*b[2]-a[2]*b[1], a[2]*b[0]-a[0]*b[2], a[0]*b[1]-a[1]*b[0]]); }

  struct Matrix
  {
    size_t r, c;
    @property T[][] array() { return a; }
    alias array this;

    static Matrix unit(size_t n) in { assert(n > 0); } do
    { auto r = Matrix(n, n); foreach (i; 0..n) r[i][i] = one; return r; }

    this(size_t r, size_t c) in { assert(r > 0 && c > 0); } do
    {
      this.r = r; this.c = c;
      a = new T[][](r, c);
      static if (T.init != zero) foreach (i; 0..r) a[i][] = zero;
    }
    this(U)(U[][] b)
    in { assert(b.length > 0 && b[0].length > 0 && b.all!(l => l.length == b[0].length)); } do
    {
      r = b.length; c = b[0].length;
      static if (is(T == U)) a = b;
      else { a = new T[][](r, c); foreach (i; 0..r) foreach (j; 0..c) a[i][j] = b[i][j]; }
    }

    pure Matrix dup() { auto b = Matrix(r, c); foreach (i; 0..r) b[i][] = a[i][]; return b; }

    pure bool opEquals(Matrix b)
    {
      return r == b.r && c == b.c && zip(a, b.a).all!"a[0]==a[1]";
    }

    pure Matrix opBinary(string op)(Matrix b) if (op=="+"||op=="-") in { assert(r == b.r && c == b.c); } do
    {
      auto x = Matrix(r, c);
      foreach (i; 0..r) foreach (j; 0..c) x[i][j] = mixin("a[i][j]"~op~"b[i][j]");
      return x;
    }
    ref Matrix opOpAssign(string op)(Matrix b) if (op=="+"||op=="-") in { assert(r == b.r && c == b.c); } do
    {
      foreach (i; 0..r) foreach (j; 0..c) mixin("a[i][j]"~op~"=b[i][j];");
      return this;
    }

    pure Matrix opBinary(string op: "*")(T b)
    {
      auto x = Matrix(r, c);
      foreach (i; 0..r) foreach (j; 0..c) x[i][j] = a[i][j]*b;
      return x;
    }
    ref Matrix opOpAssign(string op: "*")(T b)
    {
      foreach (i; 0..r) foreach (j; 0..c) a[i][j] *= b;
      return this;
    }

    pure Matrix opBinary(string op: "*")(Matrix b) in { assert(c == b.r); } do
    {
      auto x = Matrix(r, b.c);
      foreach (i; 0..r) foreach (j; 0..b.c) foreach (k; 0..c) x[i][j] += a[i][k]*b[k][j];
      return x;
    }
    ref Matrix opOpAssign(string op: "*")(Matrix b) in { assert(c == b.r); } do
    {
      auto x = this*b;
      r = x.r; c = x.c; a = x.a;
      return this;
    }

    pure Vector opBinary(string op: "*")(Vector b) in { assert(c == b.n); } do
    {
      auto x = Vector(r);
      foreach (i; 0..r) foreach (j; 0..c) x[i] += a[i][j]*b[j];
      return x;
    }

    pure Matrix opBinary(string op: "^^", U)(U n) in { assert(r == c); } do
    {
      return powr(this, n, Matrix.unit(r));
    }

    private T[][] a;
  }

  pure T det(Matrix a) in { assert(a.r == a.c); } do
  {
    auto n = a.r, b = a.dup, d = one;

    foreach (i; 0..n) {
      auto p = i;
      foreach (j; i+1..n)
        if (b[p][i].abs < b[j][i].abs) p = j;
      swap(b[p], b[i]);
      foreach (j; i+1..n)
        foreach (k; i+1..n)
          b[j][k] -= b[i][k]*b[j][i]/b[i][i];
      d *= b[i][i];
      if (p != i) d = -d;
    }

    return d;
  }
}

struct Graph
{
  alias Node = int;
  Node n;
  Node[][] g;
  alias g this;
  this(Node n) { this.n = n; g = new Node[][](n); }
  void addEdge(Node u, Node v) { g[u] ~= v; }
  void addEdgeB(Node u, Node v) { g[u] ~= v; g[v] ~= u; }
}

struct GraphW(W = int, W i = 10^^9)
{
  alias Node = int, Wt = W, inf = i;
  struct Edge { Node src, dst; Wt wt; alias cap = wt; }
  Node n;
  Edge[][] g;
  alias g this;
  this(Node n) { this.n = n; g = new Edge[][](n); }
  void addEdge(Node u, Node v, Wt w) { g[u] ~= Edge(u, v, w); }
  void addEdgeB(Node u, Node v, Wt w) { g[u] ~= Edge(u, v, w); g[v] ~= Edge(v, u, w); }
}

struct GraphM(W = int, W i = 10^^9)
{
  alias Node = int, Wt = W, inf = i;
  Node n;
  Wt[][] g;
  alias g this;
  this(int n) { this.n = n; g = new Wt[][](n, n); }
  static GraphM!(W, i) init(Node n)
  {
    auto g = GraphM!(W, i)(n);
    foreach (i; 0..n) { g[i][] = inf; g[i][i] = 0; }
    return g;
  }
}

struct TopologicalSort(Graph)
{
  alias Node = Graph.Node;
  Graph g;
  alias g this;
  Node[] nodes;

  this(Graph g)
  {
    this.g = g;
    auto h = new int[](n);

    foreach (u; 0..n)
      foreach (v; g[u])
        ++h[v];

    auto st = SList!Node();
    foreach (i; 0..n)
      if (h[i] == 0) st.insertFront(i);

    while (!st.empty()) {
      auto u = st.front; st.removeFront();
      nodes ~= u;
      foreach (v; g[u]) {
        --h[v];
        if (h[v] == 0) st.insertFront(v);
      }
    }
  }

  pure bool hasCycle() { return nodes.length != n; }
}
TopologicalSort!(Graph) topologicalSort(Graph)(Graph g) { return TopologicalSort!Graph(g); }

auto io = IO!()();
import std.stdio;
struct IO(alias IN = stdin, alias OUT = stdout)
{
  import std.conv, std.format, std.meta, std.traits, core.stdc.stdlib;

  auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
  auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T)
  { v = new T(n); foreach (ref w; v) get(w); }
  auto getC(T...)(size_t n, ref T v)
  if (allSatisfy!(hasAssignableElements, T))
  {
    foreach (ref w; v) w = new typeof(w)(n);
    foreach (i; 0..n) foreach (ref w; v) get(w[i]);
  }
  auto getM(T)(size_t r, size_t c, ref T v)
  if (hasAssignableElements!T && hasAssignableElements!(ElementType!T))
  { v = new T(r); foreach (ref w; v) getA(c, w); }
  template getS(E...)
  {
    auto getS(T)(size_t n, ref T v)
    { v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");"); }
  }

  const struct PutConf
  {
    bool newline = true, flush, exit;
    string floatFormat = "%.10f", delimiter = " ";
  }

  auto put(alias conf = "{}", T...)(T v)
  { mixin("const PutConf c = "~conf~"; putMain!c(v);"); }
  auto putB(alias conf = "{}", S, T)(bool c, S t, T f)
  { if (c) put!conf(t); else put!conf(f); }
  auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }

  private
  {
    dchar[] buf;
    auto sp = (new dchar[](0)).splitter;
    void nextLine() { IN.readln(buf); sp = buf.splitter; }
    auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }

    auto putMain(PutConf c, T...)(T v)
    {
      foreach (i, w; v) {
        putOne!c(w);
        if (i < v.length-1) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    auto putOne(PutConf c, T)(T v)
    {
      static if (isInputRange!T && !isSomeString!T) putRange!c(v);
      else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      else static if (hasMember!(T, "fprint")) v.fprint(OUT);
      else OUT.write(v);
    }
    auto putRange(PutConf c, T)(T v)
    {
      auto w = v;
      while (!w.empty) {
        putOne!c(w.front); w.popFront();
        if (!w.empty) OUT.write(c.delimiter);
      }
    }
  }
}