Submission #54933176

---

Source Code Expand

class T
	def true?
		@true
	end
	def to_s
		@true ? 'True' : 'False'
	end
	def rank
		@rank
	end

	def p= p
		@p = p
	end
	def flip
		@true = ! @true
		@p.onchange if @p
	end
end

class Tm<T
	def initialize
		@rank = 1
		@true = false
	end

	def inspect
		"<Tm>"
	end
end

class Op<T
	def initialize op,l,r
		@op,@l,@r = op,l,r
		@rank = [l.rank,r.rank].max+1
		@true = l.true?.send(op,r.true?)
		l.p = r.p = self
	end

	def inspect
		"<Op #{@op} #{@rank})>"
	end

	def onchange
		flip if @true != @l.true?.send(@op,@r.true?)
	end
end

Z,Q = gets.split.map(&:to_i)
F = gets.chomp

warn [:scan,Z]*'	'

S,O = [],[ops=[]]
F.each_byte{|op|
	case op
	when 0x5b # [
		S<<0
	when 0x30..0x39 # 0..9
		S[-1] *= 10
		S[-1] += op-0x30
	when 0x5d # ]
		S[-1] *= -1
	when 0x28 # (
		O<<ops = []
	when 0x29 # )
		S.concat O.pop.reverse
		ops = O[-1]
	else # ! & ^ |
		if op==0x21 && ops[-1]==0x21 # !!
			ops.pop
		else
			S<<ops.pop while ops[0] && ops[-1]<op
			ops<<op
		end
	end
}
S.concat ops.reverse

warn [:token,S.size]*'	'

S.pop(S.size).each{|op|
	if op<0
		S<<[:t,-op]
	else
		if op==0x21 # !
			S<<[:t,0]
			op = :^
		else
			op = op.chr.intern
		end
		l,r = S.pop 2
		if l[0]==op
			if r[0]==op
				l,r = r,l if l.size<r.size
				r.shift
				l.concat r
			else
				l<<r
			end
			S<<l
		elsif r[0]==op
			r<<l
			S<<r
		else
			S<<[op,l,r]
		end
	end
}

A2T = Hash.new{|h,a| h[a] = [] }
if :スタックが小さいなら
	E = [[]]
	while (op,*args = S.pop)
		if op==:t
			t = Tm.new
			A2T[*args]<<t
			E[-1]<<t
		elsif args[0]
			E<<[]
			S<<[op]
			S.concat args
		else
			args = E.pop
			args = args.each_slice(2).map{|a,b| b ? Op.new(op,a,b) : a } while args[1]
			E[-1]<<args[0]
		end
	end
	X, = E.flatten!
else
	M = lambda{|(op,*args)|
		if op==:t
			t = Tm.new
			A2T[*args]<<t
			t
		else
			args.map!(&M)
			args = args.each_slice(2).map{|a,b| b ? Op.new(op,a,b) : a } while args[1]
			args[0]
		end
	}
	X, = S.map!(&M)
end
A = A2T.keys.sort<<10**10

warn [:rank,X.rank]*'	'
warn [:query,Q]*'	'

Ans = [nil]*Q
Q.times.map{|q| [q,gets.to_i] }.sort_by{_2}.each{|q,x|
	A2T[A.shift].each(&:flip) while A[0]<=x
	Ans[q] = X.to_s
}

puts Ans

Submission Info

Judge Result