結果

問題 No.752 mod数列
ユーザー te-shte-sh
提出日時 2021-07-11 17:32:02
言語 Crystal
(1.11.2)
結果
AC  
実行時間 291 ms / 2,000 ms
コード長 5,509 bytes
コンパイル時間 22,200 ms
コンパイル使用メモリ 263,440 KB
実行使用メモリ 6,088 KB
最終ジャッジ日時 2023-09-14 20:16:07
合計ジャッジ時間 27,537 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,488 KB
testcase_01 AC 3 ms
4,420 KB
testcase_02 AC 3 ms
4,408 KB
testcase_03 AC 3 ms
4,380 KB
testcase_04 AC 3 ms
4,408 KB
testcase_05 AC 3 ms
4,500 KB
testcase_06 AC 3 ms
4,440 KB
testcase_07 AC 3 ms
4,500 KB
testcase_08 AC 3 ms
4,492 KB
testcase_09 AC 3 ms
4,544 KB
testcase_10 AC 7 ms
5,136 KB
testcase_11 AC 6 ms
4,888 KB
testcase_12 AC 7 ms
4,904 KB
testcase_13 AC 6 ms
4,808 KB
testcase_14 AC 7 ms
5,160 KB
testcase_15 AC 277 ms
5,144 KB
testcase_16 AC 268 ms
5,644 KB
testcase_17 AC 279 ms
5,820 KB
testcase_18 AC 275 ms
5,056 KB
testcase_19 AC 276 ms
5,132 KB
testcase_20 AC 282 ms
5,108 KB
testcase_21 AC 286 ms
5,212 KB
testcase_22 AC 291 ms
5,092 KB
testcase_23 AC 288 ms
5,076 KB
testcase_24 AC 282 ms
5,152 KB
testcase_25 AC 85 ms
6,088 KB
testcase_26 AC 221 ms
6,060 KB
testcase_27 AC 158 ms
5,712 KB
testcase_28 AC 209 ms
5,908 KB
testcase_29 AC 275 ms
5,456 KB
testcase_30 AC 284 ms
5,600 KB
testcase_31 AC 3 ms
4,380 KB
testcase_32 AC 3 ms
4,456 KB
testcase_33 AC 4 ms
4,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  p, q = io.get(Int64, Int32)

  max_m = Math.min(p, 10_i64 ** 4)
  max_k = p // (max_m + 1)

  b = Array.new(max_k + 1, 0_i64)
  (1..max_k).each do |k|
    b[k] = b[k-1] + p % k
  end

  c = Array.new(max_m + 2, 0_i64)
  c[-1] = b[-1]
  (1..max_m).reverse_each do |m|
    u = p // (m + 1) + 1
    v = p // m
    c[m] = c[m+1] + p * (v-u+1) - m * (v * (v+1) - u * (u-1)) // 2
  end

  calc = ->(x : Int64) do
    if x <= max_k
      b[x]
    else
      m = p // x
      u = p // (m + 1) + 1
      c[m+1] + p * (x-u+1) - m * (x * (x+1) - u * (u-1)) // 2
    end
  end

  q.times do
    l, r = io.get2(Int64)
    io.put calc.call(r) - calc.call(l-1)
  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

  def put_f(*vs)
    put(*vs)
    @outs.flush
  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 : UInt32.class); get_token.to_u32; end
  private def get_v(k : UInt64.class); get_token.to_u64; 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