feat: enhance AI tool descriptions and execution results with clear guidance

Tool descriptions:
- compile_and_test: add warning against repeated calls after success
- retrieve_file_content: add constraint that file must be modified after retrieve

Execution results:
- Add next_steps field to all compile_and_test outcomes
- Guide AI on what to do next based on result (success/failure/timeout)
- Explicitly forbid retrieve-compile loops without modifications

Author: 0xMashiro

include/leetcode/problems/ambiguous-coordinates.h

@@ -0,0 +1,16 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_816 {
+
+using Func = std::function<vector<string>(string)>;
+
+class AmbiguousCoordinatesSolution : public SolutionBase<Func> {
+ public:
+  vector<string> ambiguousCoordinates(string s);
+
+  AmbiguousCoordinatesSolution();
+};
+
+}  // namespace problem_816
+}  // namespace leetcode

include/leetcode/problems/best-team-with-no-conflicts.h

@@ -0,0 +1,16 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_1626 {
+
+using Func = std::function<int(vector<int>&, vector<int>&)>;
+
+class BestTeamWithNoConflictsSolution : public SolutionBase<Func> {
+ public:
+  int bestTeamScore(vector<int>& scores, vector<int>& ages);
+
+  BestTeamWithNoConflictsSolution();
+};
+
+}  // namespace problem_1626
+}  // namespace leetcode

include/leetcode/problems/find-the-power-of-k-size-subarrays-i.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3254 {
+
+using Func = std::function<vector<int>(vector<int>&, int)>;
+
+class FindThePowerOfKSizeSubarraysISolution : public SolutionBase<Func> {
+ public:
+  //! 3254. Find the Power of K-Size Subarrays I
+  //! https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/
+  vector<int> resultsArray(vector<int>& nums, int k);
+
+  FindThePowerOfKSizeSubarraysISolution();
+};
+
+}  // namespace problem_3254
+}  // namespace leetcode

include/leetcode/problems/gcd-of-odd-and-even-sums.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3658 {
+
+using Func = std::function<int(int)>;
+
+class GcdOfOddAndEvenSumsSolution : public SolutionBase<Func> {
+ public:
+  //! 3658. GCD of Odd and Even Sums
+  //! https://leetcode.com/problems/gcd-of-odd-and-even-sums/
+  int gcdOfOddEvenSums(int n);
+
+  GcdOfOddAndEvenSumsSolution();
+};
+
+}  // namespace problem_3658
+}  // namespace leetcode

include/leetcode/problems/longest-balanced-subarray-i.h

@@ -0,0 +1,16 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3719 {
+
+using Func = std::function<int(vector<int>&)>;
+
+class LongestBalancedSubarrayISolution : public SolutionBase<Func> {
+ public:
+  int longestBalanced(vector<int>& nums);
+
+  LongestBalancedSubarrayISolution();
+};
+
+}  // namespace problem_3719
+}  // namespace leetcode

include/leetcode/problems/maximum-amount-of-money-robot-can-earn.h

@@ -0,0 +1,18 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3418 {
+
+using Func = std::function<int(vector<vector<int>>&)>;
+
+class MaximumAmountOfMoneyRobotCanEarnSolution : public SolutionBase<Func> {
+ public:
+  //! 3418. Maximum Amount of Money Robot Can Earn
+  //! https://leetcode.com/problems/maximum-amount-of-money-robot-can-earn/
+  int maximumAmount(vector<vector<int>>& coins);
+
+  MaximumAmountOfMoneyRobotCanEarnSolution();
+};
+
+}  // namespace problem_3418
+}  // namespace leetcode

include/leetcode/problems/palindrome-partitioning-ii.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_132 {
+
+using Func = std::function<int(string)>;
+
+class PalindromePartitioningIiSolution : public SolutionBase<Func> {
+ public:
+  //! 132. Palindrome Partitioning II
+  //! https://leetcode.com/problems/palindrome-partitioning-ii/
+  int minCut(string s);
+
+  PalindromePartitioningIiSolution();
+};
+
+}  // namespace problem_132
+}  // namespace leetcode

include/leetcode/problems/partition-array-into-disjoint-intervals.h

@@ -0,0 +1,18 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_915 {
+
+using Func = std::function<int(vector<int>&)>;
+
+class PartitionArrayIntoDisjointIntervalsSolution : public SolutionBase<Func> {
+ public:
+  //! 915. Partition Array into Disjoint Intervals
+  //! https://leetcode.com/problems/partition-array-into-disjoint-intervals/
+  int partitionDisjoint(vector<int>& nums);
+
+  PartitionArrayIntoDisjointIntervalsSolution();
+};
+
+}  // namespace problem_915
+}  // namespace leetcode

include/leetcode/problems/partition-string.h

@@ -0,0 +1,16 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3597 {
+
+using Func = std::function<vector<string>(string)>;
+
+class PartitionStringSolution : public SolutionBase<Func> {
+ public:
+  vector<string> partitionString(string s);
+
+  PartitionStringSolution();
+};
+
+}  // namespace problem_3597
+}  // namespace leetcode

script/leetcode/ai/tools.py

@@ -122,7 +122,13 @@ def _retrieve_file_content() -> Dict[str, Any]:
             "type": "function",
             "function": {
                 "name": "retrieve_file_content",
-                "description": "读取已生成的文件内容。测试失败或编译错误时，使用此工具查看当前文件内容进行分析",
+                "description": """读取已生成的文件内容。测试失败或编译错误时，使用此工具查看当前文件内容进行分析。
+
+⚠️ 重要约束：
+- **retrieve 后必须修改文件！** 禁止「retrieve → compile」不改文件的无效循环
+- 如果只是验证修复思路，直接在脑中分析，不要 retrieve
+- 只有在不确定当前代码状态、需要确认细节时才 retrieve  
+- retrieve 后必须调用 create_or_update_file（overwrite_existing=true）更新文件""",
                 "parameters": {
                     "type": "object",
                     "properties": {
@@ -222,7 +228,12 @@ def _compile_and_test() -> Dict[str, Any]:
 
 使用场景：
 - 生成题目代码后，立即验证正确性
-- 修复代码后，快速验证修复结果""",
+- 修复代码后，快速验证修复结果
+
+⚠️ 重要约束：
+- **如果上一次调用返回了 "编译成功，所有测试通过"，禁止再次调用！**
+- 测试通过后，等待系统处理（LeetCode 提交或生成报告），不要重复测试
+- 只有在修改了代码（create_or_update_file）或添加了测试用例（append_test_case）后才再次调用""",
                 "parameters": {
                     "type": "object",
                     "properties": {
@@ -605,7 +616,8 @@ def _compile_and_test(self, problem_id: int) -> Dict[str, Any]:
                     "error_type": error_analysis["type"],
                     "error_details": error_analysis["details"],
                     "suggestion": error_analysis["suggestion"],
-                    "output": output
+                    "output": output,
+                    "next_steps": "❌ 编译失败。修复流程：1) 仔细阅读错误信息和错误详情；2) 分析问题原因（语法？类型？头文件？）；3) 直接调用 create_or_update_file 修复代码（overwrite_existing=true）；4) 修复后再次调用 compile_and_test 验证。⚠️ 禁止仅 retrieve 不修改的循环！"
                 }
 
             # 编译成功，检查测试结果
@@ -619,7 +631,8 @@ def _compile_and_test(self, problem_id: int) -> Dict[str, Any]:
                 return {
                     "is_successful": True,
                     "status_message": f"编译成功，{test_count} 个测试通过",
-                    "output": output[-2000:] if len(output) > 2000 else output
+                    "output": output[-2000:] if len(output) > 2000 else output,
+                    "next_steps": "✅ 本地测试已通过。现在：1) 等待系统自动提交到 LeetCode 验证；2) 禁止再次调用 compile_and_test；3) 如果 LeetCode 返回失败，按 Wrong Answer 流程处理（添加测试用例 → 修复代码 → 重新测试）"
                 }
             elif "FAILED" in output:
                 # 测试失败，分析失败原因
@@ -630,7 +643,8 @@ def _compile_and_test(self, problem_id: int) -> Dict[str, Any]:
                     "error_type": error_analysis["type"],
                     "error_details": error_analysis["details"],
                     "suggestion": error_analysis["suggestion"],
-                    "output": output
+                    "output": output,
+                    "next_steps": "❌ 测试失败。修复流程：1) 分析错误信息和失败详情；2) 确定修复方案；3) 直接调用 create_or_update_file 修复代码（overwrite_existing=true）；4) 修复后再次调用 compile_and_test 验证。⚠️ 禁止 retrieve_file_content → compile 不改文件的循环！"
                 }
             else:
                 # 无法确定结果
@@ -645,7 +659,8 @@ def _compile_and_test(self, problem_id: int) -> Dict[str, Any]:
                 "is_successful": False,
                 "error_message": "编译或测试超时",
                 "error_type": "timeout",
-                "suggestion": "编译或测试时间过长，请检查代码是否有无限循环或其他问题"
+                "suggestion": "编译或测试时间过长，请检查代码是否有无限循环或其他问题",
+                "next_steps": "⏱️ 超时。检查：1) 是否有死循环；2) 算法时间复杂度是否过高；3) 测试用例是否过大。修复后重新调用 compile_and_test"
             }
         except Exception as e:
             return {"is_successful": False, "error_message": str(e)}