Submission #14702414

---

Source Code Expand

class ST
	def initialize a
		@l = (1<<(a.size-1).bit_length)-1
		@h = [nil]*@l + a
		(@l-1).downto(0){|i|
			j = 2*i+1
			@h[i] = fn(@h[j],@h[j+1])
		}
	end

	def [] l,r=l
		l,r = l+@l,r+@l
		x = fn(@h[l],@h[r])
		while 0
			l,r = l/2,r/2-1
			break if r<l
			x = fn(x,fn(@h[l],@h[r]))
		end
		return x
	end

	def []= i,x
		i += @l
		@h[i] = x
		while 0<i
			i = (i-1)/2
			j = 2*i+1
			@h[i] = fn(@h[j],@h[j+1])
		end
	end

private
	def fn a,b
		return a ? (b ? a|b : a) : b
	end
end

gets
bs = ST.new [0]+gets.chomp.bytes.map{|c| 1<<(c-?a.ord) }
gets.to_i.times{
	c,d,e = gets.split
	case c
	when ?1
		bs[d.to_i] = 1<<e.ord-?a.ord

	when ?2
		p 26.times.inject([0,bs[d.to_i,e.to_i]]){|(n,b),| next n+(b&1),b>>1 }[0]
	end
}

Submission Info

Compile Error

./Main.rb:18: warning: literal in condition

Judge Result