結果

問題 No.184 たのしい排他的論理和(HARD)
ユーザー te-shte-sh
提出日時 2020-02-21 19:48:15
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 104 ms / 5,000 ms
コード長 4,631 bytes
コンパイル時間 633 ms
コンパイル使用メモリ 97,200 KB
実行使用メモリ 14,676 KB
最終ジャッジ日時 2023-09-04 05:59:19
合計ジャッジ時間 4,252 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 75 ms
11,560 KB
testcase_09 AC 17 ms
4,504 KB
testcase_10 AC 57 ms
10,032 KB
testcase_11 AC 42 ms
6,532 KB
testcase_12 AC 85 ms
12,728 KB
testcase_13 AC 93 ms
12,492 KB
testcase_14 AC 54 ms
9,096 KB
testcase_15 AC 101 ms
14,144 KB
testcase_16 AC 84 ms
13,040 KB
testcase_17 AC 91 ms
12,696 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 31 ms
5,272 KB
testcase_21 AC 104 ms
14,676 KB
testcase_22 AC 104 ms
13,072 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 2 ms
4,376 KB
testcase_25 AC 1 ms
4,376 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 63 ms
10,808 KB
testcase_29 AC 89 ms
13,384 KB
testcase_30 AC 76 ms
11,352 KB
testcase_31 AC 67 ms
10,052 KB
testcase_32 AC 84 ms
12,396 KB
testcase_33 AC 101 ms
14,412 KB
testcase_34 AC 99 ms
14,132 KB
testcase_35 AC 103 ms
12,624 KB
testcase_36 AC 102 ms
14,416 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(170): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", ulong).put.putMain!(c, ulong).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-140(140):        instantiated from here: `putMain!(c, ulong)`
Main.d(26):        instantiated from here: `put!("{}", ulong)`

ソースコード

diff # 

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

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);
  long[] A; io.getA(N, A);

  auto i = 0, j = 0;
  while (i <= 60 && j < N) {
    auto k = A[j..$].countUntil!(Ai => Ai.bitTest(i));
    if (k == -1) {
      ++i;
      continue;
    }
    k += j;
    swap(A[j], A[k]);
    foreach (l; 0..N)
      if (l != j && A[l].bitTest(i)) A[l] ^= A[j];
    ++i; ++j;
  }

  io.put(2L^^(A.count!"a>0"));
}

pragma(inline)
{
  import core.bitop : _bsf = bsf, _bsr = bsr, _popcnt = popcnt;
  pure nothrow @nogc @safe
  {
    bool bitTest(T)(T n, size_t i)
      if (isIntegral!T)
    { return (n & (T(1) << i)) != 0; }
    T bitSet(T)(T n, size_t i)
      if (isIntegral!T)
    { return n | (T(1) << i); }
    T bitReset(T)(T n, size_t i)
      if (isIntegral!T)
    { return n & ~(T(1) << i); }
    T bitComp(T)(T n, size_t i)
      if (isIntegral!T)
    { return n ^ (T(1) << i); }
    int bsf(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _bsf(cast(uint)(n)); }
    int bsf(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _bsf(cast(ulong)(n)); }
    int bsr(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _bsr(cast(uint)n); }
    int bsr(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _bsr(cast(ulong)n); }
    int popcnt(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _popcnt(cast(uint)n); }
    int popcnt(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _popcnt(cast(ulong)n); }
  }
}

pure nothrow @nogc @safe
{
  auto bitSubset(bool includeZero = false, T)(T n)
  {
    return BitSubsetRange!(includeZero, T)(n);
  }

  private struct BitSubsetRange(bool includeZero = false, T)
  {
    private T n, i;

    this(T n) { this.n = this.i = n; }
    pure nothrow @nogc @safe
    {
      static if (includeZero) {
        @property T front() const { return i&n; }
        void popFront() { i &= n; i--; }
        bool empty() const { return i < 0; }
      } else {
        @property T front() const { return i; }
        void popFront() { i = (i-1)&n; }
        bool empty() const { return i <= 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