結果

問題 No.814 ジジ抜き
ユーザー te-shte-sh
提出日時 2021-07-10 14:02:21
言語 Crystal
(1.11.2)
結果
WA  
実行時間 -
コード長 5,182 bytes
コンパイル時間 14,967 ms
コンパイル使用メモリ 300,956 KB
実行使用メモリ 17,408 KB
最終ジャッジ日時 2024-07-02 02:11:25
合計ジャッジ時間 17,235 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 WA -
testcase_05 AC 120 ms
17,408 KB
testcase_06 AC 126 ms
17,024 KB
testcase_07 AC 65 ms
10,112 KB
testcase_08 AC 121 ms
16,640 KB
testcase_09 AC 90 ms
13,184 KB
testcase_10 AC 122 ms
16,600 KB
testcase_11 AC 120 ms
16,640 KB
testcase_12 AC 62 ms
9,984 KB
testcase_13 AC 62 ms
9,984 KB
testcase_14 AC 94 ms
13,696 KB
testcase_15 AC 48 ms
8,448 KB
testcase_16 AC 50 ms
8,576 KB
testcase_17 AC 99 ms
14,124 KB
testcase_18 AC 86 ms
12,544 KB
testcase_19 AC 123 ms
16,896 KB
testcase_20 AC 64 ms
10,624 KB
testcase_21 AC 71 ms
10,940 KB
testcase_22 AC 101 ms
14,444 KB
testcase_23 AC 53 ms
8,832 KB
testcase_24 AC 93 ms
13,176 KB
testcase_25 AC 73 ms
11,264 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In Main.cr:272:16

 272 | {{a}}.zip({{*b}}) {{block}}
                    ^
Warning: Deprecated use of splat operator. Use `#splat` instead

A total of 1 warnings were found.

ソースコード

diff # 

def solve(io)
  n = io.get
  k, l, d = io.get_c(n, Int64, Int64, Int32)

  r = 0_i64
  zip(k, l, d) do |ki, li, di|
    x1 = ki.even? ? 0 : li & ((1_i64 << di) - 1)
    x2 = cumulative_xor(li >> di, (li >> di) + (ki - 1)) << di
    r ^= (x1 | x2)
  end

  io.put r
end

def cumulative_xor(n1 : Int64, n2 : Int64)
  r = cumulative_xor(n2)
  n1 == 0 ? r : r ^ cumulative_xor(n1-1)
end

def cumulative_xor(n : Int64)
  case n % 4
  when 0; n
  when 1; 1_i64
  when 2; n + 1
  when 3; 0_i64
  else; raise "must not happen"
  end
end

struct Int
  def cdiv(b : Int)
    (self + b - 1) // b
  end

  def bit?(i : Int)
    bit(i) == 1
  end

  def set_bit(i : Int)
    self | (self.class.new(1) << i)
  end

  def reset_bit(i : Int)
    self & ~(self.class.new(1) << i)
  end

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}
    def bit_length : Int32
      x = self < 0 ? ~self : self

      if x.is_a?(Int::Primitive)
        Int32.new(sizeof(self) * 8 - x.leading_zeros_count)
      else
        to_s(2).size
      end
    end
  {% end %}
end

struct Int32
  SQRT_MAX = 46_340_i32

  def isqrt
    m = SQRT_MAX
    r = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Int64
  SQRT_MAX = 3_037_000_499_i64

  def isqrt
    r = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Number
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}
    def zero?
      self == 0
    end

    def positive?
      self > 0
    end

    def negative?
      self < 0
    end
  {% end %}

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}
    def self.additive_identity
      zero
    end

    def self.multiplicative_identity
      new(1)
    end
  {% end %}
end

class Array
  macro new_md(*args, &block)
    {% if !block %}
      {% for arg, i in args[0...-2] %}
        Array.new({{arg}}) {
      {% end %}
      Array.new({{args[-2]}}, {{args[-1]}})
      {% for arg in args[0...-2] %}
        }
      {% end %}
    {% else %}
      {% for arg, i in args %}
        Array.new({{arg}}) { |_i{{i}}|
      {% end %}
      {% for block_arg, i in block.args %}
        {{block_arg}} = _i{{i}}
      {% end %}
      {{block.body}}
      {% for arg in args %}
        }
      {% end %}
    {% end %}
  end
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = [] of String
    @index = 0
  end

  def get(k : T.class = Int32) forall T
    get_v(k)
  end

  macro define_get
    {% for i in (2..9) %}
      def get(
           {% for j in (1..i) %}
             k{{j}}{% if j < i %},{% end %}
           {% end %}
         )
        {
          {% for j in (1..i) %}
            get(k{{j}}){% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get(
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn

  def get_a(n : Int, k : T.class = Int32) forall T
    Array.new(n) { get_v(k) }
  end

  def get_c(n : Int, k : T.class = Int32) forall T
    get_a(n, k)
  end

  macro define_get_c
    {% for i in (2..9) %}
      def get_c(
           n : Int,
           {% for j in (1..i) %}
             k{{j}}{% if j < i %},{% end %}
           {% end %}
         )
        a = Array.new(n) do
          get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        end
        {
          {% for j in (1..i) %}
            a.map { |e| e[{{j-1}}] }{% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get_c

  macro define_getn_c
    {% for i in (2..9) %}
      def get{{i}}_c(n : Int, k : T.class = Int32) forall T
        get_c(
          n,
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn_c

  def get_m(r : Int, c : Int, k : T.class = Int32) forall T
    Array.new(r) { get_a(c, k) }
  end

  def put(*vs)
    vs.each.with_index do |v, i|
      put_v(v)
      @outs.print i < vs.size - 1 ? " " : "\n"
    end
  end

  def put_e(*vs)
    put(*vs)
    exit
  end


  private def get_v(k : Int32.class); get_token.to_i32; end
  private def get_v(k : Int64.class); get_token.to_i64; end
  private def get_v(k : Float64.class); get_token.to_f64; end
  private def get_v(k : String.class); get_token; end

  private def get_token
    if @buf.size == @index
      str = @ins.read_line
      @buf = str.split
      @index = 0
    end
    v = @buf[@index]
    @index += 1
    v
  end

  private def put_v(vs : Enumerable)
    vs.each_with_index do |v, i|
      @outs.print v
      @outs.print " " if i < vs.size - 1
    end
  end

  private def put_v(v)
    @outs.print v
  end
end

macro min_u(a, b)
  {{a}} = Math.min({{a}}, {{b}})
end

macro max_u(a, b)
  {{a}} = Math.max({{a}}, {{b}})
end

macro zip(a, *b, &block)
  {{a}}.zip({{*b}}) {{block}}
end

solve(ProconIO.new)
0