A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.
The graph is given as follows: graph[a] is a list of all nodes b such that ab is an edge of the graph.
Mouse starts at node 1 and goes first, Cat starts at node 2 and goes second, and there is a Hole at node 0.
During each player's turn, they must travel along one edge of the graph that meets where they are.  For example, if the Mouse is at node 1, it must travel to any node in graph[1].
Additionally, it is not allowed for the Cat to travel to the Hole (node 0.)
Then, the game can end in 3 ways:

If ever the Cat occupies the same node as the Mouse, the Cat wins.
If ever the Mouse reaches the Hole, the Mouse wins.
If ever a position is repeated (ie. the players are in the same position as a previous turn, and it is the same player's turn to move), the game is a draw.

Given a graph, and assuming both players play optimally, return 1 if the game is won by Mouse, 2 if the game is won by Cat, and 0 if the game is a draw.
 



Example 1:
Input: [[2,5],[3],[0,4,5],[1,4,5],[2,3],[0,2,3]]
Output: 0
Explanation:
4---3---1
|   |
2---5
 \ /
  0

 
Note:

3 <= graph.length <= 50
It is guaranteed that graph[1] is non-empty.
It is guaranteed that graph[2] contains a non-zero element.

```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 catMouseGame(self, graph: List[List[int]]) -> int:\n        n = len(graph)\n        CAT_TURN = CAT_WIN = 2\n        MOUSE_TURN = MOUSE_WIN = 1\n        DRAW = 0\n        outcome = defaultdict(int)\n        degree = {}\n        for cat in range(n):\n            cat_neighbour_has_zero = 1 if 0 in graph[cat] else 0\n            for mouse in range(n):\n                degree[mouse, cat, 1] = len(graph[mouse])\n                degree[mouse, cat, 2] = len(graph[cat]) - cat_neighbour_has_zero\n                \n        queue = deque()\n        for cat in range(n):\n            for turn in [MOUSE_TURN, CAT_TURN]:\n                outcome[0, cat, turn] = MOUSE_WIN\n                queue.append((0, cat, turn, MOUSE_WIN))\n                if cat > 0:\n                    outcome[cat, cat, turn] = CAT_WIN\n                    queue.append((cat, cat, turn, CAT_WIN))\n                    \n        def previous(mouse, cat, turn):\n            if turn == MOUSE_TURN:\n                for prev_cat in graph[cat]:\n                    if prev_cat:\n                        yield mouse, prev_cat, 3 - turn\n            else:\n                for prev_mouse in graph[mouse]:\n                    yield prev_mouse, cat, 3 - turn\n                    \n        while queue:\n            mouse, cat, turn, final_outcome = queue.popleft()\n            for prev_mouse, prev_cat, prev_turn in previous(mouse, cat, turn):\n                if outcome[prev_mouse, prev_cat, prev_turn] == DRAW:\n                    if prev_turn == final_outcome:\n                        outcome[prev_mouse, prev_cat, prev_turn] = final_outcome\n                        queue.append((prev_mouse, prev_cat, prev_turn, final_outcome))\n                    else:\n                        degree[prev_mouse, prev_cat, prev_turn] -= 1\n                        if degree[prev_mouse, prev_cat, prev_turn] == 0:\n                            outcome[prev_mouse, prev_cat, prev_turn] = 3 - prev_turn\n                            queue.append((prev_mouse, prev_cat, prev_turn, 3 - prev_turn))\n        return outcome[1, 2, 1]\n        \n        \n        \n        \n#         # For n nodes, the possible longest path in the graph is n. If the cat can win, \n#         # its distance to the mouse should decrease, after decease n times if still doesn't \n#         # catch the mouse, and mouse haven't reach node 0 yet, means this is a draw\n        \n#         # it takes at most n for mouse to get to 0. At 2*n time, it means mouse take a \n#         # detour of at least n steps. It means that there should be at least a loop(size n) \n#         # or multiple loops of (size < n).\n        \n#         n = len(graph)\n#         @lru_cache(None)\n#         def move(cat, mouse, t):\n#             # should be 2n but 0.8n also passes all tests\n#             if t > int(0.8 * n):\n#                 return 0\n#             elif mouse == 0:\n#                 return 1\n#             elif cat == mouse:\n#                 return 2\n#             if t % 2 == 0:\n#                 best_result = 2\n#                 for pos in graph[mouse]:\n#                     result = move(cat, pos, t + 1)\n#                     if result == 1:\n#                         return 1\n#                     if result == 0:\n#                         best_result = 0\n#             else:\n#                 best_result = 1\n#                 for pos in graph[cat]:\n#                     if pos == 0:\n#                         continue\n#                     result = move(pos, mouse, t + 1)\n#                     if result == 2:\n#                         return 2\n#                     if result == 0:\n#                         best_result = 0\n#             return best_result\n#         return move(2, 1, 0)\n        \n        \n        \n        \n#         n = len(graph)\n#         cache = [[[-1] * (2 * n) for _ in range(n)] for _ in range(n)]\n#         def move(cat, mouse, t):\n#             if t == 2 * n:\n#                 return 0\n#             elif mouse == 0:\n#                 return 1\n#             elif cat == mouse:\n#                 return 2\n#             if cache[cat][mouse][t] == -1:\n#                 mouse_move = (t % 2) == 0\n#                 if mouse_move:\n#                     best_result = 2\n#                     for pos in graph[mouse]:\n#                         result = move(cat, pos, t + 1)\n#                         if result == 1:\n#                             cache[cat][mouse][t] = 1\n#                             return 1\n#                         if result == 0:\n#                             best_result = 0\n#                 else:\n#                     best_result = 1\n#                     for pos in graph[cat]:\n#                         if pos == 0:\n#                             continue\n#                         result = move(pos, mouse, t + 1)\n#                         if result == 2:\n#                             cache[cat][mouse][t] = 2\n#                             return 2\n#                         if result == 0:\n#                             best_result = 0\n#                 cache[cat][mouse][t] = best_result\n#             return cache[cat][mouse][t]\n#         return move(2, 1, 0)\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'catMouseGame'
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: 30214