Divide them all

Question

A Math.SE user have a funny game explained as such:

1. Pick a random positive integer X.

2. Add +1, 0, -1 to make it divisible by 3^{Keep track of how much you've added and subtracted. That is your "score".}.

3. Divide by 3 to create a new X.

4. Repeat steps 2 and 3 until you reach one.

I'm expecting the shortest code to give the correct score and the decomposition (as a list of the following values [+1;0;-1]) given an integer input.

Input => Expected score => Expected decomposition #explanation
12 => -1 => 0-1 #(12/3 => (4 - 1) / 3 = 1
                             ^^^
25 => 0 => -1+10  (25 - 1) / 3 => (8 + 1) / 3 => (3 + 0) / 3 => 1
                      ^^^            ^^^            ^^^

9320 => -1 => +1+1-10-1+1-1-1 #(9320 + 1) / 3 => (3107 + 1) / 3 => (1036 - 1) / 3 => (345 + 0) /3 => (115 - 1) / 3 => (38 + 1) / 3 => (13 - 1) / 3 => (4 - 1) / 3
                                     ^^^               ^^^               ^^^              ^^^             ^^^             ^^^             ^^^            ^^^

Answer 1

JavaScript (ES6), 46 bytes

Returns an array where:

• the last term is the sum
• all preceding terms are the decomposition

f=(n,s=0)=>n-1?[k=1-++n%3,...f(n/3|0,s+k)]:[s]

Try it online!

Answer 2

Python 3, 53 bytes

Credit to Mr.Xcoder

f=lambda i,*s:i>1and f(-~i//3,*s,1--~i%3)or[s,sum(s)]

Try it online!

Python 2, 55 bytes

f=lambda i,s=[]:i>1and f(-~i/3,s+[1--~i%3])or[s,sum(s)]

Try it online!

Python 2, 58 bytes

i,s=input(),[]
while~-i:s+=1--~i%3,;i=-~i/3
print s,sum(s)

Try it online!

Returns list with decomposition and sum of it