Submission #23510943

---

Source Code Expand

N = gets.to_i

S2 = [nil]*N
Q = gets.to_i.times.map{
	gets.split.map(&:to_i).tap{|t,x,y,v|
		S2[x] = v if t<1
	}
}
D3 = S2.each_cons(2).map{|s1,s2| s1&&s2&&s2-s1 }
Sd = D3.inject([0,0]){|s,d| s<<(d ? d+s[-2] : 0) }

G,F,U = [-1]*(N+1),
lambda{|a|
	G[a]<0 ? a : G[a] = F[G[a]]
},lambda{|a,b|
	a,b = F[a],F[b]
	next if a==b
	a,b = b,a if G[b]<G[a]
	G[a] += G[b]
	G[b] = a
}

Q.each{|t,x,y,v|
	if t<1
		U[x,y]
	elsif F[x]!=F[y]
		puts'Ambiguous'
	elsif x==y
		p v
	elsif x<y
		v += Sd[x+(y-x)/2*2]-Sd[x] if x+1<y
		p(x&1==y&1 ? v : S2[y-1]-v)
	elsif y<x
		d = y+1<x ? Sd[y+(x-y)/2*2]-Sd[y] : 0
		p(x&1==y&1 ? v-d : S2[x-1]-v-d)
	end
}

Submission Info

Judge Result