結果

問題 No.854 公平なりんご分配
ユーザー te-shte-sh
提出日時 2021-07-22 01:12:53
言語 Crystal
(1.11.2)
結果
AC  
実行時間 2,091 ms / 3,153 ms
コード長 7,099 bytes
コンパイル時間 17,671 ms
コンパイル使用メモリ 264,316 KB
実行使用メモリ 145,880 KB
最終ジャッジ日時 2023-09-24 13:45:27
合計ジャッジ時間 39,968 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,460 KB
testcase_01 AC 2 ms
4,468 KB
testcase_02 AC 2 ms
4,464 KB
testcase_03 AC 2 ms
4,552 KB
testcase_04 AC 2 ms
4,572 KB
testcase_05 AC 3 ms
4,636 KB
testcase_06 AC 2 ms
4,504 KB
testcase_07 AC 2 ms
4,536 KB
testcase_08 AC 2 ms
4,396 KB
testcase_09 AC 2 ms
4,520 KB
testcase_10 AC 2 ms
4,464 KB
testcase_11 AC 3 ms
4,480 KB
testcase_12 AC 3 ms
4,724 KB
testcase_13 AC 3 ms
4,712 KB
testcase_14 AC 2 ms
4,436 KB
testcase_15 AC 2 ms
4,516 KB
testcase_16 AC 3 ms
4,660 KB
testcase_17 AC 3 ms
4,816 KB
testcase_18 AC 2 ms
4,668 KB
testcase_19 AC 3 ms
4,536 KB
testcase_20 AC 3 ms
4,752 KB
testcase_21 AC 2 ms
4,668 KB
testcase_22 AC 6 ms
5,044 KB
testcase_23 AC 7 ms
6,164 KB
testcase_24 AC 10 ms
6,208 KB
testcase_25 AC 5 ms
5,328 KB
testcase_26 AC 11 ms
6,252 KB
testcase_27 AC 8 ms
6,120 KB
testcase_28 AC 6 ms
5,032 KB
testcase_29 AC 4 ms
4,828 KB
testcase_30 AC 6 ms
5,368 KB
testcase_31 AC 10 ms
6,324 KB
testcase_32 AC 114 ms
35,648 KB
testcase_33 AC 142 ms
23,376 KB
testcase_34 AC 291 ms
48,576 KB
testcase_35 AC 186 ms
37,112 KB
testcase_36 AC 85 ms
7,740 KB
testcase_37 AC 108 ms
34,184 KB
testcase_38 AC 79 ms
26,936 KB
testcase_39 AC 498 ms
49,896 KB
testcase_40 AC 159 ms
20,160 KB
testcase_41 AC 182 ms
32,272 KB
testcase_42 AC 257 ms
49,048 KB
testcase_43 AC 322 ms
35,908 KB
testcase_44 AC 343 ms
43,996 KB
testcase_45 AC 235 ms
12,756 KB
testcase_46 AC 475 ms
45,444 KB
testcase_47 AC 131 ms
26,752 KB
testcase_48 AC 217 ms
45,200 KB
testcase_49 AC 202 ms
47,668 KB
testcase_50 AC 99 ms
33,352 KB
testcase_51 AC 453 ms
48,592 KB
testcase_52 AC 205 ms
25,788 KB
testcase_53 AC 102 ms
23,476 KB
testcase_54 AC 205 ms
26,580 KB
testcase_55 AC 66 ms
21,172 KB
testcase_56 AC 64 ms
23,876 KB
testcase_57 AC 106 ms
20,140 KB
testcase_58 AC 179 ms
10,372 KB
testcase_59 AC 54 ms
18,552 KB
testcase_60 AC 139 ms
20,208 KB
testcase_61 AC 53 ms
7,776 KB
testcase_62 AC 163 ms
20,176 KB
testcase_63 AC 99 ms
20,096 KB
testcase_64 AC 40 ms
10,868 KB
testcase_65 AC 129 ms
37,880 KB
testcase_66 AC 92 ms
15,820 KB
testcase_67 AC 159 ms
27,008 KB
testcase_68 AC 143 ms
15,748 KB
testcase_69 AC 110 ms
45,080 KB
testcase_70 AC 60 ms
20,160 KB
testcase_71 AC 68 ms
20,328 KB
testcase_72 AC 112 ms
7,572 KB
testcase_73 AC 96 ms
34,452 KB
testcase_74 AC 227 ms
39,624 KB
testcase_75 AC 111 ms
20,408 KB
testcase_76 AC 147 ms
36,032 KB
testcase_77 AC 162 ms
48,164 KB
testcase_78 AC 213 ms
19,248 KB
testcase_79 AC 210 ms
30,956 KB
testcase_80 AC 225 ms
34,036 KB
testcase_81 AC 127 ms
32,884 KB
testcase_82 AC 470 ms
145,880 KB
testcase_83 AC 901 ms
145,796 KB
testcase_84 AC 884 ms
145,768 KB
testcase_85 AC 858 ms
145,880 KB
testcase_86 AC 395 ms
143,356 KB
testcase_87 AC 472 ms
145,708 KB
testcase_88 AC 480 ms
145,768 KB
testcase_89 AC 473 ms
145,788 KB
testcase_90 AC 472 ms
145,752 KB
testcase_91 AC 471 ms
145,844 KB
testcase_92 AC 2,086 ms
145,856 KB
testcase_93 AC 2,091 ms
145,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n = io.get
  a = io.get_a(n)

  pf = PrimeFactor.new(2000)
  np = pf.primes.size

  zcs = CumulativeSum.new(a.map { |ai| ai == 0 ? 1 : 0 })

  cs = Array(CumulativeSum(Int32)).new(np)
  pf.primes.each_with_index do |pi, j|
    b = Array.new(n, 0)
    (0...n).each do |i|
      while a[i] > 1 && a[i] % pi == 0
        b[i] += 1
        a[i] //= pi
      end
    end
    cs << CumulativeSum.new(b)
  end

  q = io.get
  q.times do
    p, l, r = io.get3; l -= 1; r -= 1

    if zcs[l..r] > 0
      io.put "Yes"
      next
    end

    ans = true
    pf.primes.each_with_index do |pi, j|
      c = 0
      while p % pi == 0
        c += 1
        p //= pi
      end
      if c > cs[j][l..r]
        ans = false
        break
      end
    end

    io.put p == 1 && ans ? "Yes" : "NO"
  end
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = IO::Memory.new("")
  end

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

  macro define_get
    {% for i in (2..9) %}
      def get({{ *(1..i).map { |j| "k#{j}".id } }})
        { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get({{ *(1..i).map { "k".id } }})
      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, {{ *(1..i).map { |j| "k#{j}".id } }})
        a = Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }
        { {{ *(1..i).map { |j| "a.map { |e| e[#{j-1}] }".id } }} }
      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, {{ *(1..i).map { "k".id } }})
      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

  macro define_put
    {% for i in (1..9) %}
      def put({{ *(1..i).map { |j| "v#{j}".id } }}, *, delimiter = " ")
        {% for j in (1..i) %}
          print_v(v{{j}}, delimiter)
          {% if j < i %}@outs << delimiter{% end %}
        {% end %}
        @outs.puts
      end
    {% end %}
  end
  define_put

  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
    loop do
      token = @buf.gets(' ', chomp: true)
      break token unless token.nil?
      @buf = IO::Memory.new(@ins.read_line)
    end
  end

  private def print_v(v, dlimiter)
    @outs << v
  end

  private def print_v(v : Enumerable, delimiter)
    v.each_with_index do |e, i|
      @outs << e
      @outs << delimiter if i < v.size - 1
    end
  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 Float64
  def near_zero?
    self.abs < EPSILON
  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

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

class CumulativeSum(T)
  def initialize(a : Array(T))
    @n = a.size
    @s = Array.new(@n+1, T.additive_identity)
    @n.times.each do |i|
      @s[i+1] = @s[i] + a[i]
    end
  end

  getter n : Int32

  def [](start : Int, count : Int)
    @s[start + count] - @s[start]
  end

  def [](r : Range)
    sc = Indexable.range_to_index_and_count(r, @n)
    raise ArgumentError.new("Invalid range") if sc.nil?
    self[*sc]
  end


  @s : Array(T)
end

require "bit_array"

class PrimeFactor
  def initialize(@n : Int32)
    s = (@n+1)//2
    sieve = BitArray.new(s, true)

    if @n < 2
      @primes = [] of Int32
      return
    end

    (1..(n.isqrt-1)//2).each do |p|
      if sieve[p]
        (p*3+1...s).step(p*2+1) do |q|
          sieve[q] = false
        end
      end
    end

    @primes = [2]
    (1...s).each do |p|
      @primes << p*2+1 if sieve[p]
    end
  end

  def self.sqrt(n : Int)
    self.new(n.isqrt.to_i32)
  end

  getter primes : Array(Int32)

  record Factor(T), prime : T, exp : Int32

  def div(x : T) forall T
    factors = [] of Factor(T)
    t = x.isqrt
    @primes.each do |p|
      break if p > t
      c = 0
      while x%p == 0
        c += 1
        x //= p
      end
      factors << Factor.new(T.new(p), c) if c > 0
      break if x == 1
    end
    factors << Factor.new(x, 1) if x > 1
    factors
  end

  def divisors(x : T) forall T
    factors = div(x)
    r = divisors_proc(factors, 0, T.multiplicative_identity)
    r.sort!
  end


  def divisors_proc(factors : Array(Factor(T)), i : Int32, c : T) forall T
    return [c] if i == factors.size
    r = [] of T
    (0..factors[i].exp).each do |j|
      r.concat(divisors_proc(factors, i+1, c * factors[i].prime**j))
    end
    r
  end
end

solve(ProconIO.new)
0