結果

問題 No.1004 サイコロの実装 (2)
ユーザー te-sh
提出日時 2020-03-27 02:09:51
言語 D
(dmd 2.091.0)
結果
AC  
実行時間 4 ms
コード長 2,643 Byte
コンパイル時間 615 ms
使用メモリ 8,944 KB
最終ジャッジ日時 2020-03-27 02:09:54

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
scramble_00 AC 2 ms
6,900 KB
scramble_01 AC 1 ms
6,896 KB
scramble_02 AC 1 ms
8,940 KB
scramble_03 AC 2 ms
8,944 KB
scramble_04 AC 2 ms
6,896 KB
scramble_05 AC 1 ms
6,896 KB
scramble_06 AC 2 ms
6,896 KB
scramble_07 AC 2 ms
8,940 KB
scramble_08 AC 2 ms
8,940 KB
scramble_09 AC 1 ms
8,944 KB
scramble_10 AC 2 ms
8,944 KB
scramble_11 AC 1 ms
8,944 KB
scramble_12 AC 1 ms
6,900 KB
scramble_13 AC 2 ms
8,900 KB
scramble_14 AC 4 ms
8,896 KB
scramble_15 AC 2 ms
8,940 KB
scramble_16 AC 1 ms
8,900 KB
scramble_17 AC 1 ms
8,900 KB
scramble_18 AC 1 ms
6,896 KB
scramble_19 AC 1 ms
6,896 KB
scramble_20 AC 2 ms
8,944 KB
scramble_21 AC 1 ms
8,940 KB
scramble_22 AC 1 ms
8,896 KB
scramble_23 AC 2 ms
6,900 KB
scramble_24 AC 2 ms
8,940 KB
scramble_25 AC 1 ms
6,900 KB
scramble_26 AC 2 ms
8,940 KB
scramble_27 AC 1 ms
8,944 KB
scramble_28 AC 2 ms
6,896 KB
scramble_29 AC 2 ms
8,896 KB
scramble_30 AC 1 ms
6,896 KB
scramble_31 AC 2 ms
8,944 KB
scramble_32 AC 1 ms
6,900 KB
scramble_33 AC 1 ms
6,900 KB
scramble_34 AC 1 ms
6,896 KB
scramble_35 AC 2 ms
6,896 KB
scramble_36 AC 1 ms
6,900 KB
scramble_37 AC 2 ms
6,900 KB
scramble_38 AC 2 ms
8,940 KB
scramble_39 AC 2 ms
8,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
// URL: https://yukicoder.me/problems/no/1004

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()
{
  uint a, b, x0, N; io.getV(a, b, x0, N);
  io.putB(x0%2 == 0, [0, N/2], [N/2, 0]);
}

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