#432297 (D) No.168 ものさし

提出ソース

結果

問題	No.168 ものさし
ユーザー	te-sh
提出日時	2020-02-21 18:35:34
言語	D (dmd 2.106.1)
結果	AC
実行時間	103 ms / 2,000 ms
コード長	7,086 bytes
コンパイル時間	934 ms
コンパイル使用メモリ	127,948 KB
実行使用メモリ	14,300 KB
最終ジャッジ日時	2024-06-22 05:20:38
合計ジャッジ時間	2,390 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 6,812 KB
testcase_01	AC	1 ms 6,944 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	1 ms 6,944 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	1 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	3 ms 6,944 KB
testcase_11	AC	20 ms 6,944 KB
testcase_12	AC	72 ms 13,676 KB
testcase_13	AC	102 ms 14,104 KB
testcase_14	AC	102 ms 14,208 KB
testcase_15	AC	1 ms 6,944 KB
testcase_16	AC	1 ms 6,940 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	6 ms 6,944 KB
testcase_19	AC	98 ms 14,088 KB
testcase_20	AC	103 ms 14,224 KB
testcase_21	AC	102 ms 14,292 KB
testcase_22	AC	102 ms 14,300 KB

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

コンパイルメッセージ

Main.d(306): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", long).put.putMain!(c, long).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-276(276):        instantiated from here: `putMain!(c, long)`
Main.d(24):        instantiated from here: `put!("{}", long)`

ソースコード

raw source code

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

import std.algorithm, std.array, std.bitmanip, std.container, std.conv, std.format,
       std.functional, std.math, std.range, std.traits, std.typecons, std.stdio, std.string;

version(unittest) {} else
void main()
{
  int N; io.getV(N);
  Point[] p; io.getS!("x", "y")(N, p);

  struct D { int s, t; long d; }
  D[] d;
  foreach (i; 0..N)
    foreach (j; i+1..N)
      d ~= D(i, j, (p[i]-p[j]).hypot2);

  d.sort!"a.d<b.d";

  auto uf = new UnionFind(N);
  foreach (di; d) {
    uf.unite(di.s, di.t);
    if (uf.isSame(0, N-1)) {
      io.put(iota(10, cast(long)int.max, 10).upperBoundBy!(l => di.d <= l^^2)(false).front);
      return;
    }
  }
}

pure nothrow @nogc @safe
{
  auto lowerBoundBy(alias conv = "a", alias comp = "a<b", R, T)(const R a, const 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)(const R a, const 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)(const R a)
  {
    alias convFun = unaryFun!conv, compFun = binaryFun!comp;
    return a.map!(e => tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1]));
  }
}

alias Point = Point2!long;
struct Point2(T)
{
  T x, y;

  pure nothrow @nogc @safe
  {
    Point2!T opBinary(string op)(const Point2!T r) const
      if (op == "+" || op == "-")
    {
      return mixin("Point2(x"~op~"r.x, y"~op~"r.y)");
    }
    Point2!T opOpAssign(string op)(const Point2!T r)
      if (op == "+" || op == "-")
    {
      mixin("x"~op~"=r.x; y"~op~"=r.y;");
      return this;
    }
    Point2!T opBinary(string op, U)(U a) const
      if ((op == "*" || op == "/") && isIntegral!U)
    {
      return mixin("Point2(x"~op~"a, y"~op~"a)");
    }
    Point2!T opOpAssign(string op, U)(U a)
      if ((op == "*" || op == "/") && isIntegral!U)
    {
      mixin("x"~op~"=a; y"~op~"=a;");
      return this;
    }
    T opBinary(string op: "*")(const Point2!T r) const
    {
      return x*r.x+y*r.y;
    }
    T hypot2() const
    {
      return x^^2+y^^2;
    }
  }
}

pure nothrow @nogc @safe
{
  T distManhattan(T)(const Point2!T p1, const Point2!T p2)
  {
    return (p1.x-p2.x).abs + (p1.y-p2.y).abs;
  }

  T cross(T)(const Point2!T p1, const Point2!T p2)
  {
    return p1.x*p2.y - p1.y*p2.x;
  }
}

struct Point3(T)
{
  T x, y, z;

  pure nothrow @nogc @safe
  {
    Point3!T opBinary(string op)(const Point3!T r) const
      if (op == "+" || op == "-")
    {
      return mixin("Point3!T(x"~op~"r.x, y"~op~"r.y, z"~op~"r.z)");
    }
    Point3!T opOpAssign(string op)(const Point3!T r)
      if (op == "+" || op == "-")
    {
      mixin("x"~op~"=r.x; y"~op~"=r.y; z"~op~"=r.z;");
      return this;
    }
    Point3!T opBinary(string op, U)(U a) const
      if ((op == "*" || op == "/") && isIntegral!U)
    {
      return mixin("Point3!T(x"~op~"a, y"~op~"a, z"~op~"a)");
    }
    Point3!T opOpAssign(string op, U)(U a)
      if ((op == "*" || op == "/") && isIntegral!U)
    {
      mixin("x"~op~"=a; y"~op~"=a; z"~op~"=a;");
      return this;
    }
    T opBinary(string o: "*")(const Point3!T r) const
    {
      return x*r.x+y*r.y+z*r.z;
    }
    T hypot2() const
    {
      return x^^2+y^^2+z^^2;
    }
  }
}

pure nothrow @nogc @safe
{
  Point3!T cross(T)(const Point3!T p1, const Point3!T p2)
  {
    return Point3!T(p1.y*p2.z - p1.z*p2.y, p1.z*p2.x - p1.x*p2.z, p1.x*p2.y - p1.y*p2.x);
  }
}

class UnionFind
{
  int n;

  pure nothrow @safe
  {
    this(int n)
    {
      this.n = this.s = n;
      p = new int[](n); p[] = s;
      cf = n;
      cn = new size_t[](n); cn[] = 1;
    }
  }

  pure nothrow @nogc @safe
  {
    bool unite(int u, int v)
      in { assert(0 <= u && u < n && 0 <= v && v < n); }
    do
    {
      auto pu = subst(u), pv = subst(v);
      if (pu != pv) {
        p[pv] = pu;
        --cf;
        cn[pu] += cn[pv];
        return true;
      } else {
        return false;
      }
    }

    bool isSame(int u, int v)
      in { assert(0 <= u && u < n && 0 <= v && v < n); }
    do
    {
      return subst(u) == subst(v);
    }
    size_t countForests()
    {
      return cf;
    }
    size_t countNodes(int u)
    {
      return cn[subst(u)];
    }
  }

  pure nothrow @safe
  {
    auto groups()
    {
      auto g = new int[][](n);
      foreach (i; 0..n) g[subst(i)] ~= i;
      return g.filter!(l => !l.empty);
    }
  }

  private
  {
    int[] p; int s;
    size_t cf; size_t[] cn;

    pure nothrow @nogc @safe
    {
      int subst(int i)
      {
        return p[i] == s ? i : (p[i] = subst(p[i]));
      }
    }
  }
}

pure nothrow @safe
{
  auto unionFind(int n)
  {
    return new UnionFind(n);
  }
}

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

  void getV(T...)(ref T v)
  {
    foreach (ref w; v) get(w);
  }
  void getA(T)(size_t n, ref T v)
    if (hasAssignableElements!T)
  {
    v = new T(n);
    foreach (ref w; v) get(w);
  }
  void 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]);
  }
  void 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...)
  {
    void 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 = " ";
  }

  void put(alias conf = "{}", T...)(T v)
  {
    mixin("const PutConf c = "~conf~"; putMain!c(v);");
  }
  void putB(alias conf = "{}", S, T)(bool c, S t, T f)
  {
    if (c) put!conf(t);
    else put!conf(f);
  }
  void 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;
    }
    void get(T)(ref T v)
    {
      if (sp.empty) nextLine();
      v = sp.front.to!T;
      sp.popFront();
    }

    void putMain(PutConf c, T...)(T v)
    {
      foreach (i, w; v) {
        putOne!c(w);
        if (i+1 < v.length) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    void 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);
    }
    void 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);
      }
    }
  }
}