我不行了😭（TLE）

#include <iostream>
                if (grid[i][j] == 1 || grid[i][j] == 3) {
                    cin >> clues[i][j][0]; // 下方线索值
                }
                if (grid[i][j] == 2 || grid[i][j] == 3) {
                    cin >> clues[i][j][1]; // 右方线索值
                }
            }
        }
        
        // 执行回溯搜索
        backtrack();
        
        // 输出结果
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (grid[i][j] == 4) {
                    cout << ans[i][j] << (j == m - 1 ? "" : " ");
                }
            }
            cout << endl;
        }
        
        if (!has_solution) {
            cout << "-1" << endl;
        }
    }
    return 0;
}

仅参考！求赞😅