結果

問題 No.168 ものさし
ユーザー te-sh
提出日時 2020-02-20 02:54:44
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 103 ms / 2,000 ms
コード長 6,320 bytes
コンパイル時間 866 ms
コンパイル使用メモリ 124,316 KB
実行使用メモリ 14,748 KB
最終ジャッジ日時 2024-06-22 05:17:53
合計ジャッジ時間 2,507 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(190): 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-178(178):        instantiated from here: `putMain!(c, long)`
Main.d(22):        instantiated from here: `put!("{}", long)`

ソースコード

diff # 

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

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);
  Point[] p; io.getS!("x", "y")(N, p);

  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;
    }
  }
}

struct D { int s, t; long d; }

pure nothrow @nogc @safe
{
  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]));
  }
}

alias Point = Point2!long;
struct Point2(T)
{
  import std.traits;

  T x, y;

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

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

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

struct Point3(T)
{
  import std.traits;

  T x, y, z;

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

pure nothrow @nogc @safe Point3!T cross(T)(Point3!T p1, 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 UnionFind unionFind(int n) { return new UnionFind(n); }

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);
      }
    }
  }
}
0