Alice and Bob continue their games with piles of stones. There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue.
Alice and Bob take turns, with Alice starting first. On each player's turn, that player can take 1, 2 or 3 stones from the first remaining stones in the row.
The score of each player is the sum of values of the stones taken. The score of each player is 0 initially.
The objective of the game is to end with the highest score, and the winner is the player with the highest score and there could be a tie. The game continues until all the stones have been taken.
Assume Alice and Bob play optimally.
Return "Alice" if Alice will win, "Bob" if Bob will win or "Tie" if they end the game with the same score.
 
Example 1:
Input: values = [1,2,3,7]
Output: "Bob"
Explanation: Alice will always lose. Her best move will be to take three piles and the score become 6. Now the score of Bob is 7 and Bob wins.

Example 2:
Input: values = [1,2,3,-9]
Output: "Alice"
Explanation: Alice must choose all the three piles at the first move to win and leave Bob with negative score.
If Alice chooses one pile her score will be 1 and the next move Bob's score becomes 5. The next move Alice will take the pile with value = -9 and lose.
If Alice chooses two piles her score will be 3 and the next move Bob's score becomes 3. The next move Alice will take the pile with value = -9 and also lose.
Remember that both play optimally so here Alice will choose the scenario that makes her win.

Example 3:
Input: values = [1,2,3,6]
Output: "Tie"
Explanation: Alice cannot win this game. She can end the game in a draw if she decided to choose all the first three piles, otherwise she will lose.

Example 4:
Input: values = [1,2,3,-1,-2,-3,7]
Output: "Alice"

Example 5:
Input: values = [-1,-2,-3]
Output: "Tie"

 
Constraints:

1 <= values.length <= 50000
-1000 <= values[i] <= 1000

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    def stoneGameIII(self, stoneValue):\n        # memorized dp\n        n = len(stoneValue)\n        memo = dict()\n        def dp(s):\n            # start index of stonevlaue\n            if s >= n:\n                return 0\n            if s in memo:\n                return memo[s]\n            \n            ans = -2**31\n            \n            for i in range(1, 4):\n                # first 1 to 3\n                if s+i>n:\n                    break;\n                ans = max(ans, sum(stoneValue[s:s+i]) - dp(s+i))\n            memo[s] = ans\n            return ans\n        score  = dp(0)\n        return 'Alice' if score > 0 else 'Bob' if score < 0 else 'Tie'\n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n        \n\nclass Solution1:\n    def stoneGameIII(self, stoneValue: List[int]) -> str:\n        # take 1, 2, or 3 stones from the first remaining stones of the row\n        # memorized dp, with mimmax process\n        \n        # state = dp[s], start from index s\n        \n        # take one, stoneValue[s] - dp[s+1]\n        # take two, stoneValue[s,s+1] - dp[s+2]\n        # take three, stoneValue[s, s+1, s+2] - dp[s+3]\n        # max value of these three branches\n        \n        # dp[s] > 0\n        \n        memo = {}\n        n = len(stoneValue)\n        \n        def dp(s):\n            if s>=n: return 0\n            if s in memo:\n                return memo[s]\n            \n            ans = -2**31  # 这个有错误！，ans=0了，是不对的！\n            for i in range(1, 4):\n                if s + i > n: # was bad, s+i>=n was not correct! 这个也有错误！写成了s+i>n，也是错误的！\n                    break\n                ans = max(ans, sum(stoneValue[s:s+i]) - dp(s+i))\n            memo[s] = ans\n            return ans\n        \n        score = dp(0)# - sum(stoneValue)/2 跟这个sum(stoneValue)/2没有关系！错误3！\n        #print(score, sum(stoneValue)/2)\n        return 'Alice' if score > 0 else 'Bob' if score < 0 else 'Tie'\n        \n    def stoneGameIII2(self, stoneValue: List[int]) -> str:       \n        # 采用和类似于stoneGameII的方法，可以吗？-> works!! great 太好了，get一个minmax的求解的模板！！！\n        # 残局\n        # solve(s) score diff\n        # M=1,2,3\n        # x=[1,2,3]\n        # solve(s) = max(sum(sv[s:s+x-1]) - solve(s+x))\n        \n        n = len(stoneValue)\n        \n        cache = dict() # s:score\n        \n        def solve(s):\n            if s>=n: return 0\n            if s in cache: return cache[s]\n            \n            best = -2**31\n            presum = 0\n            \n            for x in range(1, 4):\n                if s+x-1 >= n:\n                    break\n                presum += stoneValue[s+x-1]\n                best = max(best, presum - solve(s+x))\n            cache[s] = best\n            return best\n        score = solve(0)\n        return 'Alice' if score > 0 else 'Bob' if score < 0 else 'Tie'"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'stoneGameIII'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7074