提出 #60779596

---

ソースコード 拡げる

N,*A = $<.read.split.map(&:to_i)

ans = sum = num = 0
SS = lambda{|as,bs|
	as.sum*bs.size + as.size*bs.sum + as.size*bs.size
}
FF = lambda{|as,bs|
	a0,a1 = as.partition{|a| a&1<1 }
	b0,b1 = bs.partition{|b| b&1<1 }
	ff = 0
	ff += FF[a0.map{|a| a>>1 },b1.map{|b| b>>1 }] if a0[0] && b1[0]
	ff += FF[a1.map{|a| a>>1 },b0.map{|b| b>>1 }] if a1[0] && b0[0]
	ff += SS[a0,b0]
	ff += SS[a1,b1]
	next ff
}
S = lambda{|as|
	s = n = 0
	next as.sum{|a|
		s += a
		n += 1
		next s+(a+1)*n
	}
}
F = lambda{|as|
	a0,a1 = as.partition{|a| a&1<1 }
	f = 0
	f += FF[a0.map{|a| a>>1 },a1.map{|a| a>>1 }] if a0[0] && a1[0]
	f += S[a0]
	f += S[a1]
	next f
}
A.sort_by!{|a| a&-a }.reverse!
A.group_by{|a| (a&-a).bit_length-1 }.each{|b,as|
	s = as.sum
	ans += F[as.map{|a| a>>b+1 }]
	ans += (sum>>b)*as.size
	ans += num*(s>>b)
	sum += s
	num += as.size
}

p ans

提出情報

ジャッジ結果