#695104 (Ruby) No.1665 quotient replace

提出ソース

結果

問題	No.1665 quotient replace
ユーザー	magurofly
提出日時	2021-09-03 21:28:25
言語	Ruby (3.3.0)
結果	AC
実行時間	1,302 ms / 3,000 ms
コード長	4,576 bytes
コンパイル時間	1,297 ms
コンパイル使用メモリ	7,680 KB
実行使用メモリ	111,992 KB
最終ジャッジ日時	2024-05-09 01:48:07
合計ジャッジ時間	29,643 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	82 ms 12,288 KB
testcase_01	AC	82 ms 12,416 KB
testcase_02	AC	83 ms 12,544 KB
testcase_03	AC	396 ms 21,120 KB
testcase_04	AC	395 ms 20,864 KB
testcase_05	AC	398 ms 20,736 KB
testcase_06	AC	395 ms 21,376 KB
testcase_07	AC	406 ms 21,248 KB
testcase_08	AC	389 ms 21,248 KB
testcase_09	AC	420 ms 23,808 KB
testcase_10	AC	686 ms 53,632 KB
testcase_11	AC	1,040 ms 85,976 KB
testcase_12	AC	473 ms 29,568 KB
testcase_13	AC	1,289 ms 111,748 KB
testcase_14	AC	1,270 ms 111,792 KB
testcase_15	AC	1,277 ms 111,856 KB
testcase_16	AC	1,280 ms 111,768 KB
testcase_17	AC	1,302 ms 111,992 KB
testcase_18	AC	262 ms 17,152 KB
testcase_19	AC	197 ms 15,488 KB
testcase_20	AC	300 ms 17,536 KB
testcase_21	AC	314 ms 17,920 KB
testcase_22	AC	225 ms 15,872 KB
testcase_23	AC	357 ms 19,328 KB
testcase_24	AC	274 ms 17,024 KB
testcase_25	AC	218 ms 16,128 KB
testcase_26	AC	430 ms 21,120 KB
testcase_27	AC	421 ms 21,248 KB
testcase_28	AC	435 ms 23,936 KB
testcase_29	AC	461 ms 27,136 KB
testcase_30	AC	742 ms 72,832 KB
testcase_31	AC	925 ms 95,932 KB
testcase_32	AC	1,037 ms 81,300 KB
testcase_33	AC	646 ms 48,896 KB
testcase_34	AC	902 ms 75,520 KB
testcase_35	AC	896 ms 74,368 KB
testcase_36	AC	931 ms 75,136 KB
testcase_37	AC	880 ms 72,832 KB
testcase_38	AC	936 ms 76,800 KB
testcase_39	AC	792 ms 64,640 KB
testcase_40	AC	790 ms 64,640 KB
testcase_41	AC	770 ms 64,640 KB
testcase_42	AC	84 ms 12,288 KB
testcase_43	AC	84 ms 12,160 KB

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

コンパイルメッセージ

Syntax OK

ソースコード

raw source code

main = -> {
    N = int
    A = ints
    pt = PrimeTable.new(A.max)
    B = A.map { |a| pt.expsum(a) }
    xor = B.inject(0, :^)
    puts xor == 0 ? "black" : "white"
}

DEBUG = true
MOD = 10**9+7
YESNO = %w(No Yes)
INF = 10**9

class PrimeTable
	def initialize(n)
		@lpf = [nil] * (n + 1)
		@primes = [2]
		(2 .. n).step(2) do |d| @lpf[d] = 2 end
		(3 .. n).step(2) do |d|
			unless @lpf[d]
				@lpf[d] = d
				@primes << d
			end
			@primes.each do |p|
				break if p * d > n or p > @lpf[d]
				@lpf[p * d] = p
			end
		end
	end
	def prime?(n); @lpf[n] == n; end
	def each(&block); @primes.each(&block); end
	def factorize(n); fs = Hash.new(0); while n > 1; fs[f = @lpf[n]] += 1; n /= f; end; fs; end
	def expsum(n); fs = 0; while n > 1; f = @lpf[n]; fs += 1; n /= f; end; fs; end
end

def int; gets.to_s.to_i end
def ints; gets.to_s.split.map { |s| s.to_i } end
def int1s; gets.to_s.split.map { |s| s.to_i - 1 } end
def float; gets.to_s.to_f end
def floats; gets.to_s.split.map { |s| s.to_f } end
def array_of(&convert); gets.to_s.split.map(&convert) end
def string; gets.to_s.chomp end
def rep(n, &b); Array.new(n, &b) end
def yes; puts YESNO[1] end
def no; puts YESNO[0] end
def yesno t; puts YESNO[t] end
def zip(xs, *yss); Enumerator.new { |y| xs.zip(*yss) { |a| y.yield(*a) } } end
def max(*xs, &block); block_given? ? xs.max_by(&block) : xs.max end
def min(*xs, &block); block_given? ? xs.min_by(&block) : xs.min end
def minmax(*xs, &block); block_given? ? xs.minmax_by(&block) : xs.minmax end
def gcd(*xs); xs.inject(0, :gcd) end
def matrix(h, w, fill=nil, &block); return Array.new(h) { Array.new(w, &block) } if block_given?; Array.new(h) { [fill] * w } end
def debug(x = nil); STDERR.puts (block_given? ? yield(x) : x).inspect if DEBUG; x end
def debug_grid(grid, width = 1); grid.each { |row| STDERR.puts row.map { |x| x.inspect.ljust(width) }.join("") } if DEBUG; grid end
def if_debug; yield if DEBUG end

module Boolean
  def coerce(other); [other, to_i] end
  def +@; to_i end
  def to_int; to_i end
  def *(other); to_i * other end
end

class TrueClass
  include Boolean
  def to_i; 1 end
end

class FalseClass
  include Boolean
  def to_i; 0 end
end

class Integer
  def div_ceil(y); (self + y - 1) / y end
  def mod_inv(mod = MOD); pow(mod-2, mod) end
  def mod_div(y, mod = MOD); self * mod_inv(y, mod) % mod end
  def factorial(mod = MOD); (2..self).inject(1) { |f, x| f * x % mod } end
  def popcount; x = self; c = 0; while x > 0; c += 1 if x & 1 == 1; x >>= 1 end; c end #TODO: faster
  def bitbrute(&block); (1<<self).times(&block) end
  def nCr(r); x = 1; (1..r).each { |i| x *= self + 1 - i; x /= i }; x; end
  def each_divisor; return Enumerator.new { |y| each_divisor { |k| y << k } } unless block_given?; k = 1; while k * k < self; if self % k == 0; yield k; yield self / k end; k += 1; end; yield k if k * k == self end
  def divisors; each_divisor.to_a end
end

class Range
  def end_open; exclude_end? ? self.end : self.end + 1 end
  def end_close; exclude_end? ? self.end - 1 : self.end end
  def upper_bound; ac, wa = self.begin, self.end_open; while wa - ac > 1; if yield((wj = (ac + wa) / 2)); ac = wj else wa = wj end; end; yield(ac) ? ac : nil end
  def lower_bound; ac, wa = self.end_open, self.begin; while ac - wa > 1; if yield((wj = (ac + wa) / 2)); ac = wj else wa = wj end; end; yield(ac) ? ac : nil end
  def shakutori(r2, &pred); Enumerator.new { |y| j, r = r2.begin, r2.end_open; each { |i| j += 1 while j + 1 < r and pred[i, j+1]; y.yield(i, j) } }; end
  def widest(&block); Enumerator.new { |y| j, n = self.begin, self.end_open; each { |i| j += 1 while j < n and block[i, j]; y.yield(i, j) if block[i, j] } } end
end

class Array
  def power(&block); (0 ... 1 << size).each(&block) end
  def sorted_merge(other); a = []; i = j = 0; n, m = size, other.size; if j < m and other[j] < self[i]; a << other[j]; j += 1 else; a << self[i]; i += 1 end while i < n; a.push(*other[j..-1]) if j < m; a end
  def upper_bound; ac, wa = 0, size; while wa - ac > 1; if yield(self[(wj = (ac + wa) / 2)]); ac = wj else; wa = wj end; end; ac end
  def lower_bound; ac, wa = size, 0; while wa - ac > 1; if yield(self[(wj = (ac + wa) / 2)]); ac = wj else; wa = wj end; end; ac end
  def cum(*xs, &op); a = []; a << xs[0] if xs.size > 0; a << x = self[0]; (1...size).each { |i| a << x = op[x, self[i]] }; a end
  def cumdiff(range); self[range.end_open] - self[range.begin]; end
end

module Enumerable
  def sorted_uniq; x = nil; filter { |y| c = x === y; x = y; !c } end
  def cumsum; ys = [0]; each { |x| ys << x + ys[-1] }; ys end
end

main[]

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード