結果

問題 No.180 美しいWhitespace (2)
コンテスト
ユーザー te-sh
提出日時 2020-01-31 10:57:13
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 4,199 bytes
コンパイル時間 1,719 ms
コンパイル使用メモリ 156,560 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 04:48:13
合計ジャッジ時間 3,033 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 31
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(120): 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-108(108):        instantiated from here: `putMain!(c, int)`
Main.d(19):        instantiated from here: `put!("{}", int)`

ソースコード

diff # 

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

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);
  struct L { long a, b; }
  L[] l; io.getS!("a", "b")(N, l);
  l.sort!"a.b<b.b";

  auto cht1 = ConvexHullTrick!long(), cht2 = ConvexHullTrick!long();
  foreach (li; l) cht1.add(-li.b, -li.a);
  foreach_reverse (li; l) cht2.add(li.b, li.a);

  auto f(int x) { return -cht1.query(x)-cht2.query(x); }

  io.put(iota(1, int.max).upperBoundBy!(x => f(x+1)-f(x), "a<=b")(0).front);
}

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

struct ConvexHullTrick(T, alias comp = "a>=b")
{
  import std.functional;
  alias compFun = binaryFun!comp;

  void add(T a, T b)
  {
    auto line = Line(a, b);
    while (lines.length >= 2 && check(lines[$-2], lines[$-1], line))
      lines = lines[0..$-1];
    lines ~= line;
  }

  pure T query(T x)
  {
    ptrdiff_t low = -1, high = lines.length-1;
    while (high-low > 1) {
      auto mid = (high+low)/2;
      (compFun(lines[mid].f(x), lines[mid+1].f(x)) ? low : high) = mid;
    }
    return lines[high].f(x);
  }

  private
  {
    struct Line
    {
      T a, b;
      auto opCmp(Line r)
      {
        if (a < r.a) return -1;
        else if (a > r.a) return 1;
        if (b < r.b) return -1;
        else if (b > r.b) return 1;
        return 0;
      }
      auto f(T x) { return a*x+b; }
    }
    Line[] lines;

    bool check(Line l1, Line l2, Line l3)
    {
      if (l1 < l3) swap(l1, l3);
      return (l3.b-l2.b)*(l2.a-l1.a) >= (l2.b-l1.b)*(l3.a-l2.a);
    }
  }
}

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~");"); }
  }

  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(t); else put(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 if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      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);
      }
    }
  }
}
const struct PutConf
{
  bool newline = true, flush, exit;
  string floatFormat = "%.10f", delimiter = " ";
}
0