1719E - Fibonacci Strings - CodeForces Solution

import os
import sys
from io import BytesIO, IOBase

_str = str
str = lambda x=b"": x if type(x) is bytes else _str(x).encode()
BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)

class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")

sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def main():
    t = int(input())
    fib = [1, 1]
    while fib[-1] <= int(1e9):
        fib.append(fib[-1] + fib[-2])
    fib.pop()
    def dfs(num, now, prev):
        if num == -1:
            return True
        for i in range(len(now)):
            if i != prev and now[i] >= fib[num]:
                now[i] -= fib[num]
                if dfs(num - 1, now, i):
                    return True
                now[i] += fib[num]
        return False
                
    while t:
        k = int(input())
        c = list(map(int, input().strip().split(' ')))
        vsum = sum(c)
        fib_sum = 0
        num = 0
        for i in range(len(fib)):
            fib_sum += fib[i]
            if fib_sum >= vsum:
                num = i
                break
        if k > len(fib) or fib_sum != vsum:
            print('NO')
        else:
            if dfs(num, c, -1):
                print('YES')
            else:
                print('NO')
        t -= 1
    return

main()