Submission #53993734

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N,L,R,RZ = gets.split.map(&:to_i).then{|n,l,r| [n,l,r+1,1<<n] }
E = lambda{|s,&f|
  Enumerator.new{|y|
    0.upto(N){|i|
      w = 1<<i
      break if s!=s/w*w
      l = s-w
      r = s+w
      y<<s-w if w<=s
      y<<s+w if s+w<=RZ
    }
  }.each(&f)
}
IJK = lambda{|s,t|
  l,r = [s,t].minmax
  i = (r-l).bit_length-1
  w = 1<<i
  j = l/w
  raise unless l==w*j && r==l+w
  next i,j,t<=>s
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N,L,R,RZ = gets.split.map(&:to_i).then{|n,l,r| [n,l,r+1,1<<n] }
E = lambda{|s,&f|
	Enumerator.new{|y|
		0.upto(N){|i|
			w = 1<<i
			break if s!=s/w*w
			l = s-w
			r = s+w
			y<<s-w if w<=s
			y<<s+w if s+w<=RZ
		}
	}.each(&f)
}
IJK = lambda{|s,t|
	l,r = [s,t].minmax
	i = (r-l).bit_length-1
	w = 1<<i
	j = l/w
	raise unless l==w*j && r==l+w
	next i,j,t<=>s
}
Mv = false ? lambda{
	ss = (1<<N).times.inject([0]){|ss,a| ss<<ss[-1]+Random.rand(0..99) }
	warn "! #{(ss[R]-ss[L])%100}"
	next lambda{|s,t|
		i,j,k = IJK[s,t]
		warn "? #{i} #{j}"
		a = (ss[[s,t].max]-ss[[s,t].min])%100
		warn a*k
		next a*k
	}
}.call : lambda{|s,t|
	i,j,k = IJK[s,t]
	puts "? #{i} #{j}"
	$stdout.flush
	a = gets.to_i
	exit if a<0
	warn a*k
	next a*k
}

D = [RZ]*(RZ+1)
D[L] = 0
*Q = L
while RZ<=D[R] && s = Q.shift
	d = D[s]+1
	E[s].each{|t|
		if d<D[t]
			D[t] = d
			Q<<t
		end
	}
end

a = 0
t = R
D[R].times{
	s = E[t].find{|s| D[s]+1==D[t] }
	a = (a+Mv[s,t])%100
	t = s
}

puts "! #{a}"
warn D[R]

Submission Info

Judge Result