提出 #14702134

---

ソースコード 拡げる

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
		return q(l,r,0,0,@l)
	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

	def q l,r,i,il,ir
		return if ir<l || r<il
		return @h[i] if l<=il && ir<=r
		return fn(
			q(l,r,2*i+1,il,il+(ir-il)/2),
			q(l,r,2*i+2,il+(ir-il+1)/2,ir)
		)
	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
}

提出情報

ジャッジ結果