JavaScript (Node.js), 84 bytes
c=>a=>a.map(i=>(k=m[i]=1+(m[i]||l++&0)),m={},l=0)&&([,7.77,k-2?3:2,1,.1][l]+c/100)|0
I am certain that this is golfable, but there has to be at least one JS answer to an Arnauld challenge.
dana
- 2.7k
- 1
- 15
- 11