Submission #14702882

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class ST
  def initialize a
    @l = (1<<(a.size-1).bit_length)-1
    @h = [nil]*@l + a
    @h << a[-1] if a.size&1==1
    (@l-1).downto(0){|i|
      j = 2*i+1
      next unless @h[j]
      @h[i] = @h[j]|(@h[j+1]||0)
    }
  end
  def [] l,r=l
    x,l,r = 0,l+@l,r+@l
    x,l,r = x|@h[l]|@h[r],l/2,r/2-1 while l<=r
    return x
  end
  def []= i,x
    i += @l
    @h[i] = x
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

	def [] l,r=l
		x,l,r = 0,l+@l,r+@l
		x,l,r = x|@h[l]|@h[r],l/2,r/2-1 while l<=r
		return x
	end

	def []= i,x
		i += @l
		@h[i] = x
		while 0<i
			i = (i-1)/2
			j = 2*i+1
			@h[i] = @h[j]|(@h[j+1]||0)
		end
	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

Judge Result