#680805 (Crystal) No.854 公平なりんご分配

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	te-sh
提出日時	2021-07-22 01:07:18
言語	Crystal (1.11.2)
結果	TLE
実行時間	-
コード長	6,968 bytes
コンパイル時間	19,819 ms
コンパイル使用メモリ	263,552 KB
実行使用メモリ	49,496 KB
最終ジャッジ日時	2023-09-24 13:44:22
合計ジャッジ時間	32,433 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 4,456 KB
testcase_01	AC	3 ms 4,536 KB
testcase_02	AC	3 ms 4,448 KB
testcase_03	AC	3 ms 4,424 KB
testcase_04	AC	3 ms 4,468 KB
testcase_05	AC	3 ms 4,380 KB
testcase_06	AC	3 ms 4,512 KB
testcase_07	AC	3 ms 4,492 KB
testcase_08	AC	3 ms 4,456 KB
testcase_09	AC	2 ms 4,404 KB
testcase_10	AC	3 ms 4,428 KB
testcase_11	AC	3 ms 4,488 KB
testcase_12	AC	4 ms 4,616 KB
testcase_13	AC	3 ms 4,628 KB
testcase_14	AC	3 ms 4,580 KB
testcase_15	AC	3 ms 4,628 KB
testcase_16	AC	3 ms 4,664 KB
testcase_17	AC	4 ms 4,724 KB
testcase_18	AC	3 ms 4,628 KB
testcase_19	AC	3 ms 4,776 KB
testcase_20	AC	3 ms 4,616 KB
testcase_21	AC	3 ms 4,564 KB
testcase_22	AC	6 ms 5,072 KB
testcase_23	AC	8 ms 6,132 KB
testcase_24	AC	11 ms 6,244 KB
testcase_25	AC	6 ms 5,340 KB
testcase_26	AC	12 ms 6,100 KB
testcase_27	AC	9 ms 6,100 KB
testcase_28	AC	6 ms 5,020 KB
testcase_29	AC	5 ms 4,912 KB
testcase_30	AC	6 ms 5,452 KB
testcase_31	AC	11 ms 6,248 KB
testcase_32	AC	134 ms 35,428 KB
testcase_33	AC	212 ms 22,076 KB
testcase_34	AC	351 ms 49,032 KB
testcase_35	AC	233 ms 37,184 KB
testcase_36	AC	84 ms 7,796 KB
testcase_37	AC	133 ms 34,264 KB
testcase_38	AC	96 ms 26,784 KB
testcase_39	AC	618 ms 49,496 KB
testcase_40	AC	247 ms 20,176 KB
testcase_41	AC	251 ms 30,788 KB
testcase_42	AC	293 ms 47,908 KB
testcase_43	AC	447 ms 35,628 KB
testcase_44	AC	430 ms 43,296 KB
testcase_45	AC	307 ms 12,732 KB
testcase_46	AC	605 ms 45,440 KB
testcase_47	AC	192 ms 26,864 KB
testcase_48	AC	255 ms 45,424 KB
testcase_49	AC	233 ms 47,172 KB
testcase_50	AC	112 ms 34,928 KB
testcase_51	AC	577 ms 48,048 KB
testcase_52	TLE	-
testcase_53	--	-
testcase_54	--	-
testcase_55	--	-
testcase_56	--	-
testcase_57	--	-
testcase_58	--	-
testcase_59	--	-
testcase_60	--	-
testcase_61	--	-
testcase_62	--	-
testcase_63	--	-
testcase_64	--	-
testcase_65	--	-
testcase_66	--	-
testcase_67	--	-
testcase_68	--	-
testcase_69	--	-
testcase_70	--	-
testcase_71	--	-
testcase_72	--	-
testcase_73	--	-
testcase_74	--	-
testcase_75	--	-
testcase_76	--	-
testcase_77	--	-
testcase_78	--	-
testcase_79	--	-
testcase_80	--	-
testcase_81	--	-
testcase_82	--	-
testcase_83	--	-
testcase_84	--	-
testcase_85	--	-
testcase_86	--	-
testcase_87	--	-
testcase_88	--	-
testcase_89	--	-
testcase_90	--	-
testcase_91	--	-
testcase_92	--	-
testcase_93	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

  pf = PrimeFactor.new(2000)
  np = pf.primes.size
  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] % 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

    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)

yukicoder

結果

テストケース

ソースコード