結果

問題 No.759 悪くない忘年会にしような!
ユーザー te-shte-sh
提出日時 2020-02-08 16:21:49
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 125 ms / 2,000 ms
コード長 4,503 bytes
コンパイル時間 1,641 ms
コンパイル使用メモリ 160,756 KB
実行使用メモリ 7,116 KB
最終ジャッジ日時 2024-06-22 04:58:21
合計ジャッジ時間 6,577 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 1 ms
6,944 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 1 ms
6,948 KB
testcase_17 AC 1 ms
6,944 KB
testcase_18 AC 1 ms
6,940 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,940 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 2 ms
6,940 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,944 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 1 ms
6,944 KB
testcase_28 AC 1 ms
6,940 KB
testcase_29 AC 1 ms
6,940 KB
testcase_30 AC 1 ms
6,944 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 1 ms
6,944 KB
testcase_33 AC 10 ms
6,944 KB
testcase_34 AC 3 ms
6,944 KB
testcase_35 AC 5 ms
6,940 KB
testcase_36 AC 9 ms
6,944 KB
testcase_37 AC 3 ms
6,944 KB
testcase_38 AC 10 ms
6,940 KB
testcase_39 AC 3 ms
6,940 KB
testcase_40 AC 7 ms
6,944 KB
testcase_41 AC 9 ms
6,940 KB
testcase_42 AC 11 ms
6,944 KB
testcase_43 AC 12 ms
6,940 KB
testcase_44 AC 99 ms
6,940 KB
testcase_45 AC 98 ms
6,944 KB
testcase_46 AC 96 ms
6,940 KB
testcase_47 AC 96 ms
6,944 KB
testcase_48 AC 99 ms
6,940 KB
testcase_49 AC 11 ms
6,944 KB
testcase_50 AC 12 ms
6,944 KB
testcase_51 AC 11 ms
6,944 KB
testcase_52 AC 11 ms
6,940 KB
testcase_53 AC 97 ms
6,944 KB
testcase_54 AC 97 ms
7,116 KB
testcase_55 AC 98 ms
6,940 KB
testcase_56 AC 97 ms
6,940 KB
testcase_57 AC 98 ms
6,944 KB
testcase_58 AC 96 ms
6,940 KB
testcase_59 AC 99 ms
6,940 KB
testcase_60 AC 99 ms
6,940 KB
testcase_61 AC 96 ms
6,940 KB
testcase_62 AC 96 ms
6,940 KB
testcase_63 AC 119 ms
6,940 KB
testcase_64 AC 125 ms
6,940 KB
testcase_65 AC 88 ms
7,008 KB
testcase_66 AC 123 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(146): 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-134(134):        instantiated from here: `putMain!(c, int)`
Main.d(29):        instantiated from here: `put!("{}", int)`

ソースコード

diff #

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

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 S { int P, T, R, i; }
  S[] s; io.getS!("P", "T", "R")(N, s);
  foreach (i, ref si; s) {
    ++si.P; ++si.T; ++si.R;
    si.i = cast(int)i;
  }

  s.multiSort!("a.P>b.P", "a.T>b.T", "a.R>b.R");

  auto st = new SegmentTree!(max, int)(10^^4+2), b = new bool[](N);
  b[] = true;

  foreach (si; s) {
    if (st[si.T..$] >= si.R)
      b[si.i] = false;

    st[si.T] = max(st[si.T], si.R);
  }

  foreach (i; 0..N)
    if (b[i]) io.put(i+1);
}

class SegmentTree(alias pred = "a+b", T)
{
  import std.functional;
  alias predFun = binaryFun!pred;
  const size_t n;
  @property auto data() { return buf[an..an+n]; }

  this(size_t n, T dflt = T.init)
  {
    this.n = n;
    this.dflt = dflt;
    an = n == 1 ? 1 : (n-1).nextPow2;
    buf = new T[](an*2);

    if (T.init != dflt) {
      buf[an..an+n][] = dflt;
      propagateAll();
    }
  }

  this(T[] init, T dflt = T.init)
  {
    this.n = init.length;
    this.dflt = dflt;
    an = (n-1).nextPow2;
    buf = new T[](an*2);

    buf[an..an+n][] = init[];
    propagateAll();
  }

  void opIndexAssign(T val, size_t i)
  { buf[i+=an] = val; propagate(i); }

  void opIndexOpAssign(string op)(T val, size_t i)
  { mixin("buf[i+=an]"~op~"=val;"); propagate(i); }

  void opIndexUnary(string op)(size_t i) if (op=="++"||op=="--")
  { mixin(op~"buf[i+=an];"); propagate(i); }

  pure T opIndex(size_t i) { return buf[i+an]; }

  pure T opSlice(size_t l, size_t r)
  {
    l += an; r += an;
    T r1 = dflt, r2 = dflt;
    while (l != r) {
      if (l % 2) r1 = predFun(r1, buf[l++]);
      if (r % 2) r2 = predFun(buf[--r], r2);
      l /= 2; r /= 2;
    }
    return predFun(r1, r2);
  }

  pure size_t opDollar() { return n; }

  private
  {
    const size_t an;
    const T dflt;
    T[] buf;

    void propagateAll() { foreach_reverse (i; 1..an) buf[i] = predFun(buf[i*2], buf[i*2+1]); }
    void propagate(size_t i) { while (i /= 2) buf[i] = predFun(buf[i*2], buf[i*2+1]); }
  }
}
SegmentTree!(pred, T) segmentTree(alias pred = "a+b", T)(size_t n, T dflt = T.init)
{ return new SegmentTree!(pred, T)(n, dflt); }
SegmentTree!(pred, T) segmentTree(alias pred = "a+b", T)(T[] init, T dflt = T.init)
{ return new SegmentTree!(pred, T)(init, dflt); }

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