diff --git "a/source_data_all.json" "b/source_data_all.json" --- "a/source_data_all.json" +++ "b/source_data_all.json" @@ -17402,7 +17402,7 @@ "id": "10", "source_image": "Part2/Game/10.jpg", "edit_type": "Game", - "prompt_en": "Add a fifth card to this set to form the highest possible straight in Texas Hold’em.", + "prompt_en": "Add a card to this set to form the highest possible straight in Texas Hold’em.", "GPT_translation_prompt_cn": "添加牌，使这手牌成为一副尽可能大的葫芦牌型在德州扑克中。", "GPT_refined_prompt_en": "Add a fifth card to this set to form the highest possible straight in Texas Hold’em.", "GPT_refined_prompt_cn": "添加牌，使这手牌成为一副尽可能大的葫芦牌型在德州扑克中。", @@ -17722,11 +17722,11 @@ "id": "36", "source_image": "Part2/Game/36.jpg", "edit_type": "Game", - "prompt_en": "Black moves first. How can Black skewer the red rook?", + "prompt_en": "Black to move. How can Black capture the Red rook?", "GPT_translation_prompt_cn": "黑方先行。黑方如何利用串击战术攻击红车？", "GPT_refined_prompt_en": "Black moves first. How can Black use a skewer tactic to attack the red rook?", "GPT_refined_prompt_cn": "黑方先走。黑方如何运用串击战术来攻击红车？", - "prompt_cn": "黑方先走。黑方如何运用串击战术来攻击红车？", + "prompt_cn": "黑方先走。黑方如何吃掉红车？", "save_id": 1559, "IC": false, "IF": true, @@ -17738,11 +17738,11 @@ "id": "37", "source_image": "Part2/Game/37.jpg", "edit_type": "Game", - "prompt_en": "Black goes first. How should Red deliver checkmate?", + "prompt_en": "Black goes first. How should Black deliver checkmate?", "GPT_translation_prompt_cn": "黑方先走，红方应该如何将死？", "GPT_refined_prompt_en": "Black moves first. How should Red deliver checkmate?", "GPT_refined_prompt_cn": "在黑方先走的情况下，红方应该如何将死对方？", - "prompt_cn": "在黑方先走的情况下，红方应该如何将死对方？", + "prompt_cn": "在黑方先走的情况下，黑方应该如何将死对方？", "save_id": 1560, "IC": false, "IF": true, @@ -79963,8795 +79963,6 @@ "VC": true, "VQ": true }, - { - "id": "rpg_000", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 10, - "optimal_path": [ - [ - 0, - 0 - ], - [ - 1, - 0 - ], - [ - 2, - 0 - ], - [ - 2, - 1 - ], - [ - 2, - 2 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 4 - ], - [ - 3, - 5 - ], - [ - 2, - 5 - ], - [ - 1, - 5 - ] - ], - "terrain_map": [ - [ - 1, - 2, - 0, - 0, - 1, - 1 - ], - [ - 0, - 1, - 0, - 2, - 3, - 0 - ], - [ - 0, - 0, - 0, - 0, - 2, - 0 - ], - [ - 0, - 0, - 1, - 0, - 0, - 0 - ], - [ - 1, - 2, - 2, - 2, - 0, - 3 - ], - [ - 1, - 0, - 0, - 2, - 1, - 2 - ] - ], - "start_point": [ - 0, - 0 - ], - "end_point": [ - 1, - 5 - ], - "input_image": "dataset_weighted_path/rpg_000_input.jpg", - "result_image": "dataset_weighted_path/rpg_000_result.jpg", - "source_image": "Part4/Shortest_path/rpg_000_input.jpg", - "save_id": 2584, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 10." - }, - { - "id": "rpg_002", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 27, - "optimal_path": [ - [ - 0, - 6 - ], - [ - 0, - 5 - ], - [ - 1, - 5 - ], - [ - 2, - 5 - ], - [ - 2, - 4 - ], - [ - 2, - 3 - ], - [ - 2, - 2 - ], - [ - 3, - 2 - ], - [ - 4, - 2 - ], - [ - 5, - 2 - ], - [ - 6, - 2 - ] - ], - "terrain_map": [ - [ - 2, - 1, - 1, - 2, - 2, - 0, - 0, - 1 - ], - [ - 0, - 0, - 2, - 0, - 2, - 1, - 2, - 2 - ], - [ - 0, - 1, - 0, - 1, - 1, - 1, - 3, - 0 - ], - [ - 0, - 0, - 0, - 0, - 2, - 1, - 0, - 0 - ], - [ - 0, - 3, - 0, - 3, - 0, - 0, - 2, - 2 - ], - [ - 0, - 0, - 1, - 2, - 2, - 0, - 0, - 0 - ], - [ - 0, - 0, - 2, - 3, - 1, - 1, - 1, - 0 - ], - [ - 1, - 1, - 1, - 1, - 0, - 0, - 0, - 3 - ] - ], - "start_point": [ - 0, - 6 - ], - "end_point": [ - 6, - 2 - ], - "input_image": "dataset_weighted_path/rpg_002_input.jpg", - "result_image": "dataset_weighted_path/rpg_002_result.jpg", - "source_image": "Part4/Shortest_path/rpg_002_input.jpg", - "save_id": 2586, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 27." - }, - { - "id": "rpg_004", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 19, - "optimal_path": [ - [ - 3, - 1 - ], - [ - 4, - 1 - ], - [ - 5, - 1 - ], - [ - 6, - 1 - ], - [ - 7, - 1 - ], - [ - 7, - 2 - ], - [ - 7, - 3 - ], - [ - 7, - 4 - ], - [ - 7, - 5 - ], - [ - 7, - 6 - ], - [ - 7, - 7 - ], - [ - 6, - 7 - ] - ], - "terrain_map": [ - [ - 2, - 3, - 0, - 1, - 3, - 0, - 2, - 2, - 1, - 0 - ], - [ - 0, - 0, - 3, - 2, - 0, - 0, - 1, - 0, - 2, - 3 - ], - [ - 1, - 1, - 2, - 1, - 3, - 0, - 1, - 1, - 1, - 1 - ], - [ - 2, - 0, - 3, - 3, - 0, - 1, - 2, - 1, - 0, - 3 - ], - [ - 3, - 1, - 1, - 0, - 0, - 2, - 0, - 0, - 0, - 0 - ], - [ - 0, - 0, - 3, - 2, - 3, - 1, - 0, - 0, - 3, - 0 - ], - [ - 0, - 1, - 1, - 0, - 3, - 3, - 1, - 1, - 2, - 0 - ], - [ - 0, - 0, - 0, - 0, - 0, - 1, - 0, - 0, - 1, - 3 - ], - [ - 1, - 0, - 1, - 0, - 3, - 1, - 1, - 0, - 3, - 1 - ], - [ - 1, - 0, - 1, - 1, - 0, - 0, - 2, - 1, - 2, - 1 - ] - ], - "start_point": [ - 3, - 1 - ], - "end_point": [ - 6, - 7 - ], - "input_image": "dataset_weighted_path/rpg_004_input.jpg", - "result_image": "dataset_weighted_path/rpg_004_result.jpg", - "source_image": "Part4/Shortest_path/rpg_004_input.jpg", - "save_id": 2588, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 19." - }, - { - "id": "rpg_006", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 20, - "optimal_path": [ - [ - 7, - 3 - ], - [ - 6, - 3 - ], - [ - 5, - 3 - ], - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 2, - 3 - ], - [ - 1, - 3 - ], - [ - 0, - 3 - ], - [ - 0, - 2 - ], - [ - 0, - 1 - ], - [ - 0, - 0 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 0, - 0, - 0, - 2, - 2, - 0, - 0 - ], - [ - 0, - 1, - 1, - 1, - 0, - 2, - 1, - 1, - 1 - ], - [ - 2, - 0, - 3, - 0, - 1, - 1, - 2, - 1, - 1 - ], - [ - 2, - 0, - 1, - 0, - 1, - 2, - 1, - 3, - 0 - ], - [ - 0, - 0, - 1, - 1, - 2, - 1, - 0, - 3, - 2 - ], - [ - 0, - 0, - 3, - 1, - 1, - 0, - 1, - 1, - 1 - ], - [ - 2, - 0, - 3, - 1, - 1, - 1, - 0, - 1, - 1 - ], - [ - 0, - 0, - 2, - 0, - 0, - 0, - 0, - 2, - 1 - ], - [ - 3, - 3, - 2, - 0, - 2, - 1, - 1, - 0, - 3 - ] - ], - "start_point": [ - 7, - 3 - ], - "end_point": [ - 0, - 0 - ], - "input_image": "dataset_weighted_path/rpg_006_input.jpg", - "result_image": "dataset_weighted_path/rpg_006_result.jpg", - "source_image": "Part4/Shortest_path/rpg_006_input.jpg", - "save_id": 2590, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 20." - }, - { - "id": "rpg_008", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 5, - "optimal_path": [ - [ - 4, - 6 - ], - [ - 4, - 5 - ], - [ - 5, - 5 - ], - [ - 5, - 4 - ] - ], - "terrain_map": [ - [ - 1, - 3, - 1, - 3, - 2, - 2, - 0, - 1 - ], - [ - 3, - 0, - 3, - 0, - 2, - 0, - 1, - 0 - ], - [ - 0, - 2, - 1, - 0, - 3, - 0, - 2, - 3 - ], - [ - 3, - 0, - 2, - 1, - 1, - 2, - 2, - 0 - ], - [ - 1, - 2, - 1, - 0, - 2, - 0, - 0, - 0 - ], - [ - 1, - 1, - 0, - 1, - 1, - 0, - 1, - 2 - ], - [ - 1, - 0, - 0, - 0, - 0, - 2, - 3, - 1 - ], - [ - 0, - 1, - 2, - 0, - 0, - 2, - 2, - 0 - ] - ], - "start_point": [ - 4, - 6 - ], - "end_point": [ - 5, - 4 - ], - "input_image": "dataset_weighted_path/rpg_008_input.jpg", - "result_image": "dataset_weighted_path/rpg_008_result.jpg", - "source_image": "Part4/Shortest_path/rpg_008_input.jpg", - "save_id": 2592, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 5." - }, - { - "id": "rpg_010", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 15, - "optimal_path": [ - [ - 6, - 5 - ], - [ - 6, - 4 - ], - [ - 6, - 3 - ], - [ - 5, - 3 - ], - [ - 5, - 2 - ], - [ - 4, - 2 - ], - [ - 4, - 1 - ] - ], - "terrain_map": [ - [ - 3, - 0, - 3, - 2, - 0, - 0, - 0 - ], - [ - 3, - 3, - 1, - 0, - 1, - 0, - 0 - ], - [ - 0, - 0, - 0, - 3, - 2, - 1, - 3 - ], - [ - 0, - 3, - 1, - 1, - 2, - 2, - 0 - ], - [ - 1, - 0, - 1, - 3, - 1, - 0, - 3 - ], - [ - 0, - 1, - 0, - 0, - 3, - 0, - 0 - ], - [ - 1, - 1, - 0, - 2, - 0, - 0, - 1 - ] - ], - "start_point": [ - 6, - 5 - ], - "end_point": [ - 4, - 1 - ], - "input_image": "dataset_weighted_path/rpg_010_input.jpg", - "result_image": "dataset_weighted_path/rpg_010_result.jpg", - "source_image": "Part4/Shortest_path/rpg_010_input.jpg", - "save_id": 2594, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 15." - }, - { - "id": "rpg_012", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 10, - "optimal_path": [ - [ - 1, - 8 - ], - [ - 2, - 8 - ], - [ - 3, - 8 - ], - [ - 3, - 7 - ] - ], - "terrain_map": [ - [ - 2, - 3, - 0, - 3, - 0, - 2, - 3, - 0, - 0 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 0, - 3, - 0 - ], - [ - 0, - 1, - 2, - 0, - 2, - 1, - 1, - 3, - 2 - ], - [ - 2, - 3, - 0, - 2, - 0, - 1, - 1, - 0, - 0 - ], - [ - 0, - 1, - 1, - 1, - 3, - 3, - 0, - 0, - 0 - ], - [ - 3, - 0, - 1, - 1, - 1, - 0, - 2, - 3, - 0 - ], - [ - 1, - 1, - 2, - 1, - 3, - 2, - 1, - 0, - 1 - ], - [ - 0, - 3, - 2, - 0, - 0, - 1, - 1, - 0, - 2 - ], - [ - 1, - 2, - 1, - 2, - 2, - 0, - 0, - 1, - 1 - ] - ], - "start_point": [ - 1, - 8 - ], - "end_point": [ - 3, - 7 - ], - "input_image": "dataset_weighted_path/rpg_012_input.jpg", - "result_image": "dataset_weighted_path/rpg_012_result.jpg", - "source_image": "Part4/Shortest_path/rpg_012_input.jpg", - "save_id": 2596, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 10." - }, - { - "id": "rpg_014", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 9, - "optimal_path": [ - [ - 6, - 5 - ], - [ - 6, - 4 - ], - [ - 5, - 4 - ], - [ - 4, - 4 - ], - [ - 3, - 4 - ], - [ - 2, - 4 - ] - ], - "terrain_map": [ - [ - 3, - 0, - 3, - 3, - 0, - 0, - 0 - ], - [ - 0, - 0, - 2, - 0, - 3, - 0, - 0 - ], - [ - 1, - 0, - 2, - 1, - 1, - 2, - 0 - ], - [ - 1, - 0, - 1, - 3, - 0, - 0, - 0 - ], - [ - 0, - 2, - 3, - 1, - 0, - 1, - 1 - ], - [ - 3, - 2, - 0, - 1, - 1, - 1, - 0 - ], - [ - 1, - 1, - 3, - 0, - 0, - 0, - 3 - ] - ], - "start_point": [ - 6, - 5 - ], - "end_point": [ - 2, - 4 - ], - "input_image": "dataset_weighted_path/rpg_014_input.jpg", - "result_image": "dataset_weighted_path/rpg_014_result.jpg", - "source_image": "Part4/Shortest_path/rpg_014_input.jpg", - "save_id": 2598, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 9." - }, - { - "id": "rpg_016", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 4, - "optimal_path": [ - [ - 4, - 7 - ], - [ - 4, - 6 - ], - [ - 4, - 5 - ], - [ - 4, - 4 - ], - [ - 5, - 4 - ] - ], - "terrain_map": [ - [ - 2, - 1, - 2, - 0, - 0, - 0, - 0, - 0 - ], - [ - 0, - 1, - 3, - 1, - 1, - 1, - 3, - 0 - ], - [ - 3, - 3, - 0, - 3, - 0, - 0, - 0, - 1 - ], - [ - 1, - 0, - 0, - 0, - 1, - 3, - 1, - 0 - ], - [ - 1, - 1, - 3, - 0, - 0, - 0, - 0, - 1 - ], - [ - 1, - 0, - 1, - 0, - 0, - 1, - 0, - 2 - ], - [ - 1, - 1, - 3, - 1, - 1, - 1, - 1, - 3 - ], - [ - 0, - 3, - 1, - 0, - 3, - 2, - 3, - 3 - ] - ], - "start_point": [ - 4, - 7 - ], - "end_point": [ - 5, - 4 - ], - "input_image": "dataset_weighted_path/rpg_016_input.jpg", - "result_image": "dataset_weighted_path/rpg_016_result.jpg", - "source_image": "Part4/Shortest_path/rpg_016_input.jpg", - "save_id": 2600, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 4." - }, - { - "id": "rpg_018", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 14, - "optimal_path": [ - [ - 1, - 2 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 2, - 4 - ], - [ - 3, - 4 - ], - [ - 3, - 5 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 2, - 1, - 3, - 0, - 2 - ], - [ - 3, - 1, - 1, - 2, - 1, - 3, - 3 - ], - [ - 1, - 3, - 2, - 0, - 0, - 1, - 1 - ], - [ - 3, - 1, - 1, - 0, - 0, - 1, - 0 - ], - [ - 0, - 0, - 0, - 3, - 1, - 1, - 0 - ], - [ - 1, - 2, - 1, - 0, - 0, - 0, - 3 - ], - [ - 1, - 3, - 2, - 0, - 1, - 1, - 1 - ] - ], - "start_point": [ - 1, - 2 - ], - "end_point": [ - 3, - 5 - ], - "input_image": "dataset_weighted_path/rpg_018_input.jpg", - "result_image": "dataset_weighted_path/rpg_018_result.jpg", - "source_image": "Part4/Shortest_path/rpg_018_input.jpg", - "save_id": 2602, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 14." - }, - { - "id": "rpg_020", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 7, - "optimal_path": [ - [ - 1, - 5 - ], - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 2, - 2 - ], - [ - 2, - 1 - ] - ], - "terrain_map": [ - [ - 0, - 1, - 1, - 0, - 2, - 3 - ], - [ - 2, - 0, - 2, - 0, - 0, - 2 - ], - [ - 3, - 1, - 0, - 0, - 0, - 1 - ], - [ - 1, - 1, - 1, - 1, - 0, - 2 - ], - [ - 0, - 0, - 0, - 1, - 2, - 1 - ], - [ - 0, - 1, - 0, - 1, - 3, - 1 - ] - ], - "start_point": [ - 1, - 5 - ], - "end_point": [ - 2, - 1 - ], - "input_image": "dataset_weighted_path/rpg_020_input.jpg", - "result_image": "dataset_weighted_path/rpg_020_result.jpg", - "source_image": "Part4/Shortest_path/rpg_020_input.jpg", - "save_id": 2604, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 7." - }, - { - "id": "rpg_022", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 7, - "optimal_path": [ - [ - 6, - 4 - ], - [ - 6, - 3 - ], - [ - 6, - 2 - ], - [ - 5, - 2 - ], - [ - 4, - 2 - ], - [ - 3, - 2 - ], - [ - 2, - 2 - ], - [ - 1, - 2 - ] - ], - "terrain_map": [ - [ - 3, - 1, - 0, - 1, - 0, - 0, - 1, - 0, - 1 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 0, - 3, - 1 - ], - [ - 0, - 2, - 0, - 1, - 0, - 1, - 3, - 0, - 1 - ], - [ - 1, - 0, - 0, - 1, - 2, - 0, - 3, - 1, - 1 - ], - [ - 1, - 0, - 0, - 2, - 0, - 2, - 0, - 0, - 1 - ], - [ - 1, - 3, - 0, - 3, - 1, - 0, - 1, - 0, - 0 - ], - [ - 1, - 0, - 0, - 0, - 0, - 3, - 0, - 2, - 0 - ], - [ - 0, - 2, - 1, - 1, - 1, - 3, - 0, - 0, - 1 - ], - [ - 3, - 1, - 2, - 0, - 2, - 0, - 0, - 0, - 3 - ] - ], - "start_point": [ - 6, - 4 - ], - "end_point": [ - 1, - 2 - ], - "input_image": "dataset_weighted_path/rpg_022_input.jpg", - "result_image": "dataset_weighted_path/rpg_022_result.jpg", - "source_image": "Part4/Shortest_path/rpg_022_input.jpg", - "save_id": 2606, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 7." - }, - { - "id": "rpg_024", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 20, - "optimal_path": [ - [ - 2, - 8 - ], - [ - 2, - 7 - ], - [ - 2, - 6 - ], - [ - 2, - 5 - ], - [ - 2, - 4 - ], - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ], - [ - 2, - 2 - ], - [ - 3, - 2 - ] - ], - "terrain_map": [ - [ - 2, - 3, - 2, - 3, - 0, - 1, - 1, - 0, - 0 - ], - [ - 2, - 2, - 0, - 2, - 0, - 2, - 0, - 0, - 1 - ], - [ - 0, - 1, - 1, - 3, - 0, - 0, - 1, - 0, - 0 - ], - [ - 0, - 0, - 0, - 3, - 3, - 0, - 0, - 0, - 3 - ], - [ - 0, - 1, - 2, - 0, - 0, - 3, - 0, - 1, - 2 - ], - [ - 0, - 1, - 0, - 0, - 2, - 0, - 1, - 2, - 1 - ], - [ - 1, - 0, - 2, - 1, - 2, - 0, - 0, - 1, - 2 - ], - [ - 0, - 2, - 0, - 1, - 2, - 0, - 3, - 0, - 3 - ], - [ - 0, - 0, - 3, - 2, - 0, - 3, - 1, - 1, - 1 - ] - ], - "start_point": [ - 2, - 8 - ], - "end_point": [ - 3, - 2 - ], - "input_image": "dataset_weighted_path/rpg_024_input.jpg", - "result_image": "dataset_weighted_path/rpg_024_result.jpg", - "source_image": "Part4/Shortest_path/rpg_024_input.jpg", - "save_id": 2608, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 20." - }, - { - "id": "rpg_026", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 25, - "optimal_path": [ - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 4 - ], - [ - 3, - 5 - ], - [ - 4, - 5 - ], - [ - 5, - 5 - ], - [ - 5, - 6 - ], - [ - 5, - 7 - ], - [ - 5, - 8 - ], - [ - 5, - 9 - ], - [ - 4, - 9 - ] - ], - "terrain_map": [ - [ - 1, - 3, - 1, - 1, - 2, - 3, - 2, - 0, - 1, - 1 - ], - [ - 0, - 3, - 2, - 3, - 1, - 1, - 1, - 3, - 0, - 3 - ], - [ - 1, - 1, - 3, - 1, - 2, - 0, - 2, - 0, - 0, - 2 - ], - [ - 0, - 2, - 3, - 0, - 1, - 0, - 2, - 0, - 2, - 0 - ], - [ - 3, - 1, - 0, - 1, - 3, - 1, - 1, - 1, - 2, - 2 - ], - [ - 2, - 3, - 1, - 1, - 0, - 0, - 0, - 1, - 1, - 0 - ], - [ - 3, - 0, - 3, - 3, - 1, - 2, - 3, - 2, - 0, - 3 - ], - [ - 0, - 2, - 1, - 0, - 0, - 0, - 0, - 2, - 0, - 1 - ], - [ - 0, - 3, - 0, - 3, - 1, - 2, - 1, - 0, - 0, - 2 - ], - [ - 0, - 0, - 0, - 0, - 3, - 0, - 1, - 0, - 1, - 2 - ] - ], - "start_point": [ - 2, - 3 - ], - "end_point": [ - 4, - 9 - ], - "input_image": "dataset_weighted_path/rpg_026_input.jpg", - "result_image": "dataset_weighted_path/rpg_026_result.jpg", - "source_image": "Part4/Shortest_path/rpg_026_input.jpg", - "save_id": 2610, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 25." - }, - { - "id": "rpg_028", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 23, - "optimal_path": [ - [ - 2, - 0 - ], - [ - 3, - 0 - ], - [ - 3, - 1 - ], - [ - 3, - 2 - ], - [ - 3, - 3 - ], - [ - 3, - 4 - ], - [ - 4, - 4 - ], - [ - 5, - 4 - ], - [ - 6, - 4 - ], - [ - 6, - 3 - ], - [ - 6, - 2 - ], - [ - 6, - 1 - ], - [ - 6, - 0 - ] - ], - "terrain_map": [ - [ - 3, - 3, - 3, - 3, - 3, - 3, - 3 - ], - [ - 1, - 0, - 1, - 1, - 2, - 2, - 3 - ], - [ - 1, - 1, - 0, - 1, - 1, - 0, - 1 - ], - [ - 0, - 0, - 0, - 1, - 0, - 1, - 2 - ], - [ - 2, - 3, - 3, - 0, - 0, - 2, - 0 - ], - [ - 3, - 1, - 1, - 3, - 0, - 1, - 0 - ], - [ - 2, - 1, - 0, - 0, - 0, - 0, - 3 - ] - ], - "start_point": [ - 2, - 0 - ], - "end_point": [ - 6, - 0 - ], - "input_image": "dataset_weighted_path/rpg_028_input.jpg", - "result_image": "dataset_weighted_path/rpg_028_result.jpg", - "source_image": "Part4/Shortest_path/rpg_028_input.jpg", - "save_id": 2612, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 23." - }, - { - "id": "rpg_030", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 21, - "optimal_path": [ - [ - 6, - 1 - ], - [ - 6, - 2 - ], - [ - 5, - 2 - ], - [ - 5, - 3 - ], - [ - 5, - 4 - ], - [ - 5, - 5 - ], - [ - 5, - 6 - ], - [ - 6, - 6 - ], - [ - 7, - 6 - ], - [ - 8, - 6 - ], - [ - 8, - 7 - ], - [ - 8, - 8 - ] - ], - "terrain_map": [ - [ - 3, - 3, - 2, - 0, - 1, - 0, - 1, - 1, - 0 - ], - [ - 0, - 0, - 1, - 0, - 3, - 0, - 0, - 3, - 1 - ], - [ - 1, - 2, - 0, - 2, - 3, - 1, - 1, - 1, - 1 - ], - [ - 0, - 0, - 0, - 1, - 2, - 0, - 0, - 2, - 1 - ], - [ - 0, - 3, - 0, - 0, - 2, - 1, - 3, - 3, - 0 - ], - [ - 0, - 1, - 0, - 1, - 1, - 0, - 1, - 1, - 0 - ], - [ - 1, - 0, - 0, - 0, - 1, - 2, - 0, - 1, - 1 - ], - [ - 2, - 1, - 0, - 1, - 2, - 1, - 1, - 1, - 1 - ], - [ - 2, - 1, - 1, - 2, - 2, - 1, - 0, - 0, - 1 - ] - ], - "start_point": [ - 6, - 1 - ], - "end_point": [ - 8, - 8 - ], - "input_image": "dataset_weighted_path/rpg_030_input.jpg", - "result_image": "dataset_weighted_path/rpg_030_result.jpg", - "source_image": "Part4/Shortest_path/rpg_030_input.jpg", - "save_id": 2614, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 21." - }, - { - "id": "rpg_032", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 22, - "optimal_path": [ - [ - 0, - 3 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 2 - ], - [ - 4, - 2 - ], - [ - 4, - 1 - ] - ], - "terrain_map": [ - [ - 3, - 3, - 0, - 1, - 3, - 1, - 0, - 2, - 1 - ], - [ - 1, - 1, - 3, - 2, - 3, - 3, - 0, - 3, - 0 - ], - [ - 0, - 1, - 3, - 1, - 0, - 0, - 0, - 1, - 3 - ], - [ - 2, - 3, - 0, - 2, - 2, - 1, - 1, - 3, - 0 - ], - [ - 1, - 0, - 0, - 1, - 3, - 1, - 3, - 3, - 2 - ], - [ - 1, - 0, - 1, - 2, - 2, - 0, - 0, - 3, - 2 - ], - [ - 0, - 0, - 2, - 2, - 2, - 1, - 3, - 3, - 1 - ], - [ - 0, - 0, - 3, - 1, - 0, - 0, - 3, - 0, - 1 - ], - [ - 0, - 1, - 0, - 1, - 0, - 0, - 3, - 0, - 1 - ] - ], - "start_point": [ - 0, - 3 - ], - "end_point": [ - 4, - 1 - ], - "input_image": "dataset_weighted_path/rpg_032_input.jpg", - "result_image": "dataset_weighted_path/rpg_032_result.jpg", - "source_image": "Part4/Shortest_path/rpg_032_input.jpg", - "save_id": 2616, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 22." - }, - { - "id": "rpg_034", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 11, - "optimal_path": [ - [ - 4, - 6 - ], - [ - 4, - 7 - ], - [ - 3, - 7 - ], - [ - 3, - 8 - ], - [ - 3, - 9 - ], - [ - 2, - 9 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 1, - 3, - 0, - 0, - 1, - 1, - 1, - 0 - ], - [ - 0, - 1, - 0, - 1, - 0, - 0, - 3, - 0, - 3, - 2 - ], - [ - 1, - 0, - 1, - 3, - 0, - 0, - 0, - 3, - 2, - 1 - ], - [ - 0, - 3, - 3, - 1, - 1, - 3, - 2, - 1, - 0, - 1 - ], - [ - 0, - 1, - 1, - 0, - 0, - 1, - 0, - 0, - 1, - 0 - ], - [ - 2, - 0, - 3, - 0, - 0, - 1, - 2, - 1, - 0, - 0 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 1, - 1, - 0, - 1 - ], - [ - 1, - 1, - 0, - 1, - 0, - 1, - 0, - 0, - 0, - 3 - ], - [ - 3, - 2, - 1, - 0, - 1, - 3, - 1, - 0, - 2, - 2 - ], - [ - 0, - 0, - 2, - 3, - 3, - 1, - 3, - 0, - 1, - 1 - ] - ], - "start_point": [ - 4, - 6 - ], - "end_point": [ - 2, - 9 - ], - "input_image": "dataset_weighted_path/rpg_034_input.jpg", - "result_image": "dataset_weighted_path/rpg_034_result.jpg", - "source_image": "Part4/Shortest_path/rpg_034_input.jpg", - "save_id": 2618, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 11." - }, - { - "id": "rpg_036", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 24, - "optimal_path": [ - [ - 0, - 8 - ], - [ - 1, - 8 - ], - [ - 1, - 7 - ], - [ - 1, - 6 - ], - [ - 1, - 5 - ], - [ - 1, - 4 - ], - [ - 0, - 4 - ], - [ - 0, - 3 - ], - [ - 0, - 2 - ], - [ - 1, - 2 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 0, - 0, - 1, - 3, - 1, - 3, - 1, - 1 - ], - [ - 1, - 0, - 1, - 3, - 2, - 1, - 0, - 1, - 0, - 3 - ], - [ - 1, - 0, - 1, - 3, - 0, - 0, - 2, - 0, - 0, - 0 - ], - [ - 0, - 0, - 2, - 3, - 3, - 0, - 0, - 3, - 2, - 2 - ], - [ - 0, - 1, - 0, - 0, - 1, - 0, - 0, - 2, - 0, - 3 - ], - [ - 1, - 0, - 1, - 1, - 1, - 2, - 3, - 3, - 2, - 1 - ], - [ - 2, - 2, - 0, - 0, - 0, - 2, - 0, - 3, - 1, - 3 - ], - [ - 2, - 0, - 1, - 1, - 0, - 1, - 0, - 0, - 3, - 2 - ], - [ - 1, - 0, - 1, - 0, - 3, - 3, - 3, - 1, - 2, - 1 - ], - [ - 3, - 2, - 1, - 3, - 1, - 1, - 2, - 0, - 2, - 3 - ] - ], - "start_point": [ - 0, - 8 - ], - "end_point": [ - 1, - 2 - ], - "input_image": "dataset_weighted_path/rpg_036_input.jpg", - "result_image": "dataset_weighted_path/rpg_036_result.jpg", - "source_image": "Part4/Shortest_path/rpg_036_input.jpg", - "save_id": 2620, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 24." - }, - { - "id": "rpg_038", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 6, - "optimal_path": [ - [ - 1, - 5 - ], - [ - 2, - 5 - ], - [ - 3, - 5 - ], - [ - 4, - 5 - ], - [ - 5, - 5 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 1, - 1, - 1, - 0, - 1 - ], - [ - 3, - 0, - 2, - 0, - 0, - 1, - 1 - ], - [ - 3, - 1, - 0, - 0, - 1, - 0, - 1 - ], - [ - 0, - 3, - 0, - 0, - 0, - 0, - 1 - ], - [ - 1, - 0, - 0, - 3, - 0, - 1, - 0 - ], - [ - 3, - 1, - 0, - 0, - 3, - 0, - 3 - ], - [ - 3, - 1, - 0, - 1, - 0, - 2, - 1 - ] - ], - "start_point": [ - 1, - 5 - ], - "end_point": [ - 5, - 5 - ], - "input_image": "dataset_weighted_path/rpg_038_input.jpg", - "result_image": "dataset_weighted_path/rpg_038_result.jpg", - "source_image": "Part4/Shortest_path/rpg_038_input.jpg", - "save_id": 2622, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 6." - }, - { - "id": "rpg_040", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 19, - "optimal_path": [ - [ - 4, - 1 - ], - [ - 3, - 1 - ], - [ - 2, - 1 - ], - [ - 1, - 1 - ], - [ - 1, - 2 - ], - [ - 1, - 3 - ], - [ - 1, - 4 - ], - [ - 1, - 5 - ], - [ - 1, - 6 - ] - ], - "terrain_map": [ - [ - 1, - 2, - 1, - 2, - 0, - 0, - 1 - ], - [ - 0, - 0, - 0, - 2, - 0, - 0, - 0 - ], - [ - 0, - 1, - 0, - 2, - 0, - 2, - 3 - ], - [ - 1, - 1, - 3, - 1, - 0, - 0, - 3 - ], - [ - 1, - 2, - 3, - 2, - 1, - 0, - 1 - ], - [ - 0, - 0, - 3, - 2, - 0, - 2, - 3 - ], - [ - 2, - 3, - 3, - 0, - 0, - 0, - 2 - ] - ], - "start_point": [ - 4, - 1 - ], - "end_point": [ - 1, - 6 - ], - "input_image": "dataset_weighted_path/rpg_040_input.jpg", - "result_image": "dataset_weighted_path/rpg_040_result.jpg", - "source_image": "Part4/Shortest_path/rpg_040_input.jpg", - "save_id": 2624, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 19." - }, - { - "id": "rpg_041", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 15, - "optimal_path": [ - [ - 0, - 2 - ], - [ - 1, - 2 - ], - [ - 1, - 1 - ], - [ - 2, - 1 - ], - [ - 3, - 1 - ], - [ - 3, - 2 - ], - [ - 4, - 2 - ] - ], - "terrain_map": [ - [ - 1, - 2, - 0, - 1, - 1, - 1, - 1 - ], - [ - 1, - 0, - 0, - 3, - 0, - 1, - 0 - ], - [ - 1, - 0, - 3, - 2, - 3, - 0, - 1 - ], - [ - 3, - 0, - 2, - 3, - 1, - 1, - 1 - ], - [ - 0, - 2, - 1, - 1, - 0, - 2, - 1 - ], - [ - 0, - 1, - 0, - 1, - 0, - 1, - 0 - ], - [ - 0, - 0, - 0, - 3, - 1, - 2, - 0 - ] - ], - "start_point": [ - 0, - 2 - ], - "end_point": [ - 4, - 2 - ], - "input_image": "dataset_weighted_path/rpg_041_input.jpg", - "result_image": "dataset_weighted_path/rpg_041_result.jpg", - "source_image": "Part4/Shortest_path/rpg_041_input.jpg", - "save_id": 2625, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 15." - }, - { - "id": "rpg_042", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 5, - "optimal_path": [ - [ - 2, - 2 - ], - [ - 2, - 1 - ], - [ - 2, - 0 - ], - [ - 1, - 0 - ] - ], - "terrain_map": [ - [ - 1, - 3, - 1, - 1, - 3, - 1, - 0, - 0 - ], - [ - 0, - 3, - 1, - 2, - 0, - 3, - 2, - 1 - ], - [ - 1, - 0, - 1, - 0, - 0, - 0, - 0, - 0 - ], - [ - 1, - 0, - 0, - 0, - 0, - 3, - 3, - 1 - ], - [ - 1, - 0, - 3, - 3, - 1, - 1, - 0, - 3 - ], - [ - 2, - 0, - 0, - 1, - 1, - 0, - 0, - 0 - ], - [ - 2, - 0, - 1, - 0, - 0, - 0, - 1, - 1 - ], - [ - 0, - 0, - 0, - 1, - 2, - 3, - 1, - 1 - ] - ], - "start_point": [ - 2, - 2 - ], - "end_point": [ - 1, - 0 - ], - "input_image": "dataset_weighted_path/rpg_042_input.jpg", - "result_image": "dataset_weighted_path/rpg_042_result.jpg", - "source_image": "Part4/Shortest_path/rpg_042_input.jpg", - "save_id": 2626, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 5." - }, - { - "id": "rpg_043", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 15, - "optimal_path": [ - [ - 0, - 0 - ], - [ - 0, - 1 - ], - [ - 1, - 1 - ], - [ - 1, - 2 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 4, - 3 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 3, - 1, - 2, - 2, - 1 - ], - [ - 3, - 1, - 1, - 1, - 1, - 1, - 1 - ], - [ - 2, - 1, - 3, - 0, - 0, - 0, - 2 - ], - [ - 1, - 1, - 2, - 0, - 0, - 2, - 1 - ], - [ - 1, - 3, - 0, - 1, - 0, - 1, - 2 - ], - [ - 0, - 2, - 0, - 2, - 1, - 0, - 1 - ], - [ - 1, - 3, - 1, - 0, - 0, - 2, - 0 - ] - ], - "start_point": [ - 0, - 0 - ], - "end_point": [ - 4, - 3 - ], - "input_image": "dataset_weighted_path/rpg_043_input.jpg", - "result_image": "dataset_weighted_path/rpg_043_result.jpg", - "source_image": "Part4/Shortest_path/rpg_043_input.jpg", - "save_id": 2627, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 15." - }, - { - "id": "rpg_044", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 24, - "optimal_path": [ - [ - 4, - 0 - ], - [ - 3, - 0 - ], - [ - 3, - 1 - ], - [ - 2, - 1 - ], - [ - 1, - 1 - ], - [ - 0, - 1 - ], - [ - 0, - 2 - ] - ], - "terrain_map": [ - [ - 2, - 1, - 2, - 1, - 1, - 0, - 1, - 0, - 1 - ], - [ - 2, - 2, - 2, - 2, - 2, - 0, - 0, - 0, - 2 - ], - [ - 3, - 0, - 1, - 1, - 1, - 1, - 2, - 1, - 1 - ], - [ - 0, - 1, - 1, - 1, - 2, - 0, - 3, - 1, - 1 - ], - [ - 0, - 1, - 0, - 0, - 2, - 3, - 2, - 0, - 0 - ], - [ - 2, - 0, - 2, - 3, - 0, - 0, - 2, - 0, - 0 - ], - [ - 3, - 1, - 1, - 3, - 0, - 0, - 0, - 1, - 3 - ], - [ - 1, - 0, - 1, - 1, - 1, - 0, - 3, - 3, - 0 - ], - [ - 1, - 0, - 0, - 2, - 1, - 1, - 3, - 3, - 2 - ] - ], - "start_point": [ - 4, - 0 - ], - "end_point": [ - 0, - 2 - ], - "input_image": "dataset_weighted_path/rpg_044_input.jpg", - "result_image": "dataset_weighted_path/rpg_044_result.jpg", - "source_image": "Part4/Shortest_path/rpg_044_input.jpg", - "save_id": 2628, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 24." - }, - { - "id": "rpg_045", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 16, - "optimal_path": [ - [ - 5, - 6 - ], - [ - 4, - 6 - ], - [ - 3, - 6 - ], - [ - 3, - 5 - ], - [ - 3, - 4 - ], - [ - 3, - 3 - ], - [ - 3, - 2 - ], - [ - 2, - 2 - ], - [ - 1, - 2 - ], - [ - 0, - 2 - ], - [ - 0, - 3 - ] - ], - "terrain_map": [ - [ - 1, - 1, - 1, - 0, - 2, - 0, - 2, - 1 - ], - [ - 0, - 0, - 0, - 3, - 0, - 1, - 0, - 0 - ], - [ - 3, - 1, - 0, - 3, - 3, - 0, - 3, - 3 - ], - [ - 2, - 1, - 0, - 0, - 1, - 0, - 0, - 1 - ], - [ - 0, - 0, - 1, - 0, - 3, - 1, - 1, - 1 - ], - [ - 3, - 1, - 3, - 0, - 1, - 1, - 0, - 1 - ], - [ - 1, - 3, - 0, - 0, - 2, - 1, - 0, - 0 - ], - [ - 0, - 0, - 0, - 2, - 1, - 0, - 1, - 3 - ] - ], - "start_point": [ - 5, - 6 - ], - "end_point": [ - 0, - 3 - ], - "input_image": "dataset_weighted_path/rpg_045_input.jpg", - "result_image": "dataset_weighted_path/rpg_045_result.jpg", - "source_image": "Part4/Shortest_path/rpg_045_input.jpg", - "save_id": 2629, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 16." - }, - { - "id": "rpg_046", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 6, - "optimal_path": [ - [ - 2, - 1 - ], - [ - 2, - 2 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 4, - 3 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 3, - 0, - 2, - 3 - ], - [ - 1, - 3, - 0, - 1, - 0, - 1 - ], - [ - 0, - 2, - 0, - 0, - 0, - 1 - ], - [ - 0, - 3, - 2, - 1, - 1, - 3 - ], - [ - 1, - 0, - 2, - 0, - 0, - 2 - ], - [ - 1, - 0, - 2, - 0, - 2, - 1 - ] - ], - "start_point": [ - 2, - 1 - ], - "end_point": [ - 4, - 3 - ], - "input_image": "dataset_weighted_path/rpg_046_input.jpg", - "result_image": "dataset_weighted_path/rpg_046_result.jpg", - "source_image": "Part4/Shortest_path/rpg_046_input.jpg", - "save_id": 2630, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 6." - }, - { - "id": "rpg_047", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 25, - "optimal_path": [ - [ - 1, - 1 - ], - [ - 1, - 2 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 4, - 3 - ], - [ - 4, - 4 - ], - [ - 4, - 5 - ], - [ - 4, - 6 - ], - [ - 4, - 7 - ], - [ - 4, - 8 - ], - [ - 3, - 8 - ], - [ - 3, - 9 - ] - ], - "terrain_map": [ - [ - 0, - 3, - 2, - 0, - 2, - 1, - 2, - 3, - 0, - 2 - ], - [ - 0, - 0, - 0, - 2, - 3, - 1, - 1, - 1, - 0, - 1 - ], - [ - 0, - 2, - 3, - 1, - 1, - 2, - 1, - 0, - 1, - 1 - ], - [ - 3, - 3, - 1, - 0, - 3, - 0, - 0, - 3, - 1, - 1 - ], - [ - 0, - 2, - 0, - 0, - 0, - 0, - 0, - 0, - 0, - 3 - ], - [ - 0, - 0, - 0, - 1, - 0, - 0, - 1, - 0, - 3, - 1 - ], - [ - 1, - 1, - 0, - 1, - 0, - 0, - 1, - 1, - 2, - 2 - ], - [ - 0, - 0, - 0, - 0, - 2, - 3, - 3, - 3, - 3, - 0 - ], - [ - 0, - 2, - 1, - 1, - 1, - 2, - 0, - 0, - 0, - 1 - ], - [ - 3, - 0, - 3, - 3, - 0, - 0, - 0, - 0, - 1, - 0 - ] - ], - "start_point": [ - 1, - 1 - ], - "end_point": [ - 3, - 9 - ], - "input_image": "dataset_weighted_path/rpg_047_input.jpg", - "result_image": "dataset_weighted_path/rpg_047_result.jpg", - "source_image": "Part4/Shortest_path/rpg_047_input.jpg", - "save_id": 2631, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 25." - }, - { - "id": "rpg_048", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 20, - "optimal_path": [ - [ - 9, - 5 - ], - [ - 8, - 5 - ], - [ - 8, - 4 - ], - [ - 8, - 3 - ], - [ - 7, - 3 - ], - [ - 6, - 3 - ], - [ - 6, - 2 - ], - [ - 6, - 1 - ], - [ - 5, - 1 - ], - [ - 5, - 0 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 0, - 1, - 0, - 0, - 0, - 0, - 0, - 1 - ], - [ - 1, - 1, - 3, - 0, - 0, - 2, - 1, - 3, - 2, - 0 - ], - [ - 2, - 1, - 1, - 1, - 0, - 3, - 0, - 0, - 1, - 2 - ], - [ - 1, - 0, - 1, - 1, - 0, - 0, - 2, - 1, - 1, - 2 - ], - [ - 0, - 0, - 1, - 2, - 0, - 3, - 0, - 1, - 1, - 0 - ], - [ - 2, - 1, - 3, - 1, - 0, - 0, - 2, - 1, - 0, - 1 - ], - [ - 2, - 1, - 0, - 0, - 2, - 3, - 0, - 0, - 1, - 0 - ], - [ - 2, - 2, - 0, - 0, - 1, - 1, - 3, - 3, - 0, - 3 - ], - [ - 0, - 3, - 0, - 0, - 0, - 0, - 0, - 0, - 2, - 1 - ], - [ - 1, - 0, - 0, - 1, - 0, - 0, - 1, - 0, - 2, - 0 - ] - ], - "start_point": [ - 9, - 5 - ], - "end_point": [ - 5, - 0 - ], - "input_image": "dataset_weighted_path/rpg_048_input.jpg", - "result_image": "dataset_weighted_path/rpg_048_result.jpg", - "source_image": "Part4/Shortest_path/rpg_048_input.jpg", - "save_id": 2632, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 20." - }, - { - "id": "rpg_049", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 12, - "optimal_path": [ - [ - 5, - 5 - ], - [ - 4, - 5 - ], - [ - 3, - 5 - ], - [ - 2, - 5 - ], - [ - 1, - 5 - ], - [ - 1, - 6 - ], - [ - 0, - 6 - ] - ], - "terrain_map": [ - [ - 0, - 3, - 0, - 3, - 0, - 3, - 1, - 3, - 0 - ], - [ - 1, - 0, - 3, - 2, - 0, - 0, - 1, - 3, - 1 - ], - [ - 3, - 3, - 0, - 0, - 0, - 0, - 0, - 1, - 1 - ], - [ - 0, - 0, - 0, - 1, - 0, - 0, - 3, - 0, - 0 - ], - [ - 0, - 3, - 2, - 3, - 0, - 1, - 1, - 1, - 1 - ], - [ - 0, - 1, - 0, - 1, - 1, - 1, - 0, - 3, - 0 - ], - [ - 0, - 1, - 2, - 2, - 2, - 0, - 1, - 1, - 0 - ], - [ - 1, - 0, - 0, - 1, - 1, - 1, - 0, - 0, - 1 - ], - [ - 1, - 1, - 0, - 3, - 2, - 2, - 3, - 0, - 1 - ] - ], - "start_point": [ - 5, - 5 - ], - "end_point": [ - 0, - 6 - ], - "input_image": "dataset_weighted_path/rpg_049_input.jpg", - "result_image": "dataset_weighted_path/rpg_049_result.jpg", - "source_image": "Part4/Shortest_path/rpg_049_input.jpg", - "save_id": 2633, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 12." - }, - { - "id": "rpg_050", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 13, - "optimal_path": [ - [ - 5, - 2 - ], - [ - 5, - 3 - ], - [ - 5, - 4 - ], - [ - 5, - 5 - ], - [ - 5, - 6 - ] - ], - "terrain_map": [ - [ - 0, - 1, - 1, - 0, - 1, - 2, - 0, - 3 - ], - [ - 3, - 0, - 1, - 1, - 0, - 0, - 1, - 0 - ], - [ - 0, - 1, - 3, - 2, - 0, - 1, - 1, - 0 - ], - [ - 0, - 1, - 2, - 2, - 0, - 0, - 3, - 2 - ], - [ - 0, - 3, - 1, - 3, - 1, - 0, - 1, - 0 - ], - [ - 1, - 1, - 2, - 2, - 1, - 0, - 0, - 0 - ], - [ - 0, - 0, - 0, - 0, - 3, - 1, - 1, - 2 - ], - [ - 2, - 2, - 0, - 3, - 0, - 1, - 0, - 2 - ] - ], - "start_point": [ - 5, - 2 - ], - "end_point": [ - 5, - 6 - ], - "input_image": "dataset_weighted_path/rpg_050_input.jpg", - "result_image": "dataset_weighted_path/rpg_050_result.jpg", - "source_image": "Part4/Shortest_path/rpg_050_input.jpg", - "save_id": 2634, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 13." - }, - { - "id": "rpg_051", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 29, - "optimal_path": [ - [ - 8, - 7 - ], - [ - 7, - 7 - ], - [ - 7, - 6 - ], - [ - 6, - 6 - ], - [ - 6, - 5 - ], - [ - 5, - 5 - ], - [ - 5, - 4 - ], - [ - 4, - 4 - ], - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 2, - 3 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ] - ], - "terrain_map": [ - [ - 1, - 3, - 3, - 3, - 0, - 0, - 1, - 0, - 1 - ], - [ - 2, - 1, - 0, - 1, - 1, - 1, - 0, - 0, - 1 - ], - [ - 2, - 3, - 2, - 0, - 0, - 0, - 1, - 0, - 0 - ], - [ - 1, - 1, - 0, - 0, - 1, - 1, - 0, - 1, - 3 - ], - [ - 0, - 2, - 3, - 0, - 1, - 3, - 1, - 2, - 2 - ], - [ - 3, - 0, - 2, - 1, - 0, - 1, - 1, - 3, - 1 - ], - [ - 1, - 0, - 0, - 2, - 1, - 0, - 1, - 3, - 1 - ], - [ - 0, - 2, - 0, - 0, - 3, - 1, - 2, - 1, - 2 - ], - [ - 0, - 2, - 1, - 1, - 0, - 0, - 3, - 2, - 1 - ] - ], - "start_point": [ - 8, - 7 - ], - "end_point": [ - 1, - 2 - ], - "input_image": "dataset_weighted_path/rpg_051_input.jpg", - "result_image": "dataset_weighted_path/rpg_051_result.jpg", - "source_image": "Part4/Shortest_path/rpg_051_input.jpg", - "save_id": 2635, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 29." - }, - { - "id": "rpg_052", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 9, - "optimal_path": [ - [ - 2, - 4 - ], - [ - 1, - 4 - ], - [ - 0, - 4 - ], - [ - 0, - 3 - ] - ], - "terrain_map": [ - [ - 0, - 2, - 0, - 1, - 1, - 1, - 0, - 0, - 3 - ], - [ - 0, - 0, - 1, - 1, - 1, - 0, - 1, - 2, - 2 - ], - [ - 3, - 1, - 1, - 3, - 0, - 1, - 2, - 0, - 1 - ], - [ - 0, - 1, - 0, - 1, - 1, - 0, - 0, - 1, - 3 - ], - [ - 3, - 0, - 0, - 0, - 0, - 0, - 1, - 0, - 0 - ], - [ - 2, - 3, - 0, - 2, - 0, - 1, - 1, - 1, - 0 - ], - [ - 1, - 3, - 0, - 3, - 1, - 0, - 0, - 2, - 1 - ], - [ - 2, - 1, - 0, - 0, - 0, - 0, - 0, - 2, - 0 - ], - [ - 2, - 2, - 0, - 3, - 0, - 2, - 1, - 0, - 0 - ] - ], - "start_point": [ - 2, - 4 - ], - "end_point": [ - 0, - 3 - ], - "input_image": "dataset_weighted_path/rpg_052_input.jpg", - "result_image": "dataset_weighted_path/rpg_052_result.jpg", - "source_image": "Part4/Shortest_path/rpg_052_input.jpg", - "save_id": 2636, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 9." - }, - { - "id": "rpg_053", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 17, - "optimal_path": [ - [ - 6, - 3 - ], - [ - 5, - 3 - ], - [ - 4, - 3 - ], - [ - 4, - 2 - ], - [ - 3, - 2 - ], - [ - 3, - 1 - ], - [ - 3, - 0 - ], - [ - 2, - 0 - ], - [ - 1, - 0 - ], - [ - 1, - 1 - ] - ], - "terrain_map": [ - [ - 0, - 0, - 1, - 3, - 0, - 1, - 0 - ], - [ - 0, - 0, - 3, - 2, - 1, - 0, - 3 - ], - [ - 1, - 2, - 0, - 1, - 1, - 0, - 2 - ], - [ - 0, - 0, - 1, - 3, - 0, - 1, - 1 - ], - [ - 2, - 2, - 1, - 0, - 2, - 1, - 2 - ], - [ - 0, - 0, - 3, - 1, - 1, - 1, - 1 - ], - [ - 1, - 0, - 0, - 1, - 0, - 2, - 0 - ] - ], - "start_point": [ - 6, - 3 - ], - "end_point": [ - 1, - 1 - ], - "input_image": "dataset_weighted_path/rpg_053_input.jpg", - "result_image": "dataset_weighted_path/rpg_053_result.jpg", - "source_image": "Part4/Shortest_path/rpg_053_input.jpg", - "save_id": 2637, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 17." - }, - { - "id": "rpg_054", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 3, - "optimal_path": [ - [ - 4, - 5 - ], - [ - 3, - 5 - ], - [ - 2, - 5 - ], - [ - 1, - 5 - ] - ], - "terrain_map": [ - [ - 2, - 0, - 3, - 3, - 0, - 1, - 1, - 1 - ], - [ - 1, - 0, - 1, - 3, - 1, - 0, - 1, - 1 - ], - [ - 1, - 0, - 0, - 2, - 0, - 0, - 1, - 1 - ], - [ - 0, - 3, - 0, - 3, - 2, - 0, - 1, - 0 - ], - [ - 0, - 0, - 1, - 1, - 1, - 2, - 0, - 1 - ], - [ - 1, - 1, - 1, - 1, - 1, - 0, - 2, - 3 - ], - [ - 3, - 1, - 2, - 3, - 1, - 1, - 0, - 0 - ], - [ - 3, - 1, - 0, - 2, - 2, - 2, - 2, - 3 - ] - ], - "start_point": [ - 4, - 5 - ], - "end_point": [ - 1, - 5 - ], - "input_image": "dataset_weighted_path/rpg_054_input.jpg", - "result_image": "dataset_weighted_path/rpg_054_result.jpg", - "source_image": "Part4/Shortest_path/rpg_054_input.jpg", - "save_id": 2638, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 3." - }, - { - "id": "rpg_055", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 16, - "optimal_path": [ - [ - 8, - 8 - ], - [ - 8, - 7 - ], - [ - 8, - 6 - ], - [ - 7, - 6 - ], - [ - 7, - 5 - ], - [ - 6, - 5 - ], - [ - 5, - 5 - ], - [ - 5, - 4 - ], - [ - 4, - 4 - ], - [ - 4, - 3 - ], - [ - 4, - 2 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 3, - 1, - 1, - 1, - 3, - 0, - 3 - ], - [ - 1, - 1, - 1, - 2, - 2, - 0, - 1, - 1, - 1 - ], - [ - 2, - 0, - 0, - 0, - 3, - 0, - 1, - 0, - 1 - ], - [ - 2, - 0, - 0, - 0, - 1, - 1, - 1, - 0, - 1 - ], - [ - 3, - 1, - 0, - 0, - 1, - 2, - 0, - 0, - 0 - ], - [ - 0, - 2, - 2, - 1, - 0, - 0, - 2, - 2, - 1 - ], - [ - 0, - 0, - 1, - 0, - 3, - 0, - 3, - 0, - 1 - ], - [ - 3, - 1, - 0, - 0, - 0, - 1, - 0, - 3, - 0 - ], - [ - 1, - 0, - 0, - 1, - 0, - 1, - 0, - 1, - 0 - ] - ], - "start_point": [ - 8, - 8 - ], - "end_point": [ - 4, - 2 - ], - "input_image": "dataset_weighted_path/rpg_055_input.jpg", - "result_image": "dataset_weighted_path/rpg_055_result.jpg", - "source_image": "Part4/Shortest_path/rpg_055_input.jpg", - "save_id": 2639, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 16." - }, - { - "id": "rpg_056", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 10, - "optimal_path": [ - [ - 2, - 2 - ], - [ - 2, - 3 - ], - [ - 1, - 3 - ], - [ - 1, - 4 - ] - ], - "terrain_map": [ - [ - 3, - 2, - 1, - 2, - 3, - 2 - ], - [ - 3, - 0, - 1, - 2, - 0, - 2 - ], - [ - 2, - 1, - 2, - 0, - 3, - 0 - ], - [ - 0, - 1, - 1, - 0, - 0, - 2 - ], - [ - 3, - 0, - 1, - 3, - 1, - 1 - ], - [ - 1, - 0, - 0, - 0, - 2, - 0 - ] - ], - "start_point": [ - 2, - 2 - ], - "end_point": [ - 1, - 4 - ], - "input_image": "dataset_weighted_path/rpg_056_input.jpg", - "result_image": "dataset_weighted_path/rpg_056_result.jpg", - "source_image": "Part4/Shortest_path/rpg_056_input.jpg", - "save_id": 2640, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 10." - }, - { - "id": "rpg_057", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 33, - "optimal_path": [ - [ - 3, - 4 - ], - [ - 4, - 4 - ], - [ - 5, - 4 - ], - [ - 5, - 3 - ], - [ - 5, - 2 - ], - [ - 5, - 1 - ], - [ - 4, - 1 - ], - [ - 3, - 1 - ], - [ - 2, - 1 - ], - [ - 1, - 1 - ], - [ - 0, - 1 - ], - [ - 0, - 0 - ] - ], - "terrain_map": [ - [ - 1, - 1, - 3, - 3, - 0, - 3, - 2, - 0 - ], - [ - 2, - 1, - 0, - 3, - 2, - 1, - 1, - 0 - ], - [ - 2, - 0, - 3, - 0, - 1, - 0, - 3, - 0 - ], - [ - 0, - 0, - 1, - 3, - 0, - 2, - 2, - 1 - ], - [ - 0, - 0, - 3, - 1, - 2, - 0, - 0, - 1 - ], - [ - 0, - 0, - 1, - 2, - 0, - 0, - 0, - 2 - ], - [ - 1, - 1, - 1, - 2, - 0, - 3, - 0, - 1 - ], - [ - 1, - 1, - 1, - 0, - 3, - 0, - 1, - 0 - ] - ], - "start_point": [ - 3, - 4 - ], - "end_point": [ - 0, - 0 - ], - "input_image": "dataset_weighted_path/rpg_057_input.jpg", - "result_image": "dataset_weighted_path/rpg_057_result.jpg", - "source_image": "Part4/Shortest_path/rpg_057_input.jpg", - "save_id": 2641, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 33." - }, - { - "id": "rpg_058", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 24, - "optimal_path": [ - [ - 2, - 8 - ], - [ - 1, - 8 - ], - [ - 1, - 7 - ], - [ - 1, - 6 - ], - [ - 1, - 5 - ], - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 4, - 3 - ], - [ - 5, - 3 - ], - [ - 6, - 3 - ] - ], - "terrain_map": [ - [ - 0, - 3, - 0, - 2, - 0, - 1, - 0, - 0, - 3, - 3 - ], - [ - 0, - 0, - 0, - 1, - 0, - 0, - 0, - 0, - 2, - 3 - ], - [ - 1, - 0, - 1, - 0, - 1, - 1, - 2, - 2, - 1, - 0 - ], - [ - 1, - 2, - 1, - 1, - 0, - 0, - 2, - 0, - 2, - 0 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 2, - 2, - 1, - 2 - ], - [ - 0, - 1, - 0, - 0, - 0, - 1, - 3, - 2, - 1, - 2 - ], - [ - 0, - 0, - 1, - 1, - 3, - 0, - 1, - 0, - 0, - 0 - ], - [ - 0, - 3, - 2, - 0, - 1, - 1, - 1, - 0, - 2, - 2 - ], - [ - 1, - 1, - 1, - 0, - 0, - 0, - 0, - 1, - 0, - 1 - ], - [ - 3, - 1, - 2, - 3, - 1, - 1, - 0, - 0, - 0, - 0 - ] - ], - "start_point": [ - 2, - 8 - ], - "end_point": [ - 6, - 3 - ], - "input_image": "dataset_weighted_path/rpg_058_input.jpg", - "result_image": "dataset_weighted_path/rpg_058_result.jpg", - "source_image": "Part4/Shortest_path/rpg_058_input.jpg", - "save_id": 2642, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 24." - }, - { - "id": "rpg_059", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 8, - "optimal_path": [ - [ - 2, - 1 - ], - [ - 2, - 2 - ], - [ - 3, - 2 - ], - [ - 4, - 2 - ], - [ - 5, - 2 - ], - [ - 5, - 3 - ], - [ - 6, - 3 - ] - ], - "terrain_map": [ - [ - 3, - 3, - 0, - 0, - 3, - 2, - 0 - ], - [ - 2, - 3, - 1, - 3, - 0, - 0, - 1 - ], - [ - 1, - 0, - 0, - 3, - 1, - 3, - 2 - ], - [ - 2, - 0, - 0, - 3, - 0, - 1, - 2 - ], - [ - 1, - 3, - 0, - 2, - 1, - 1, - 0 - ], - [ - 0, - 0, - 1, - 0, - 1, - 1, - 1 - ], - [ - 1, - 1, - 0, - 0, - 1, - 0, - 0 - ] - ], - "start_point": [ - 2, - 1 - ], - "end_point": [ - 6, - 3 - ], - "input_image": "dataset_weighted_path/rpg_059_input.jpg", - "result_image": "dataset_weighted_path/rpg_059_result.jpg", - "source_image": "Part4/Shortest_path/rpg_059_input.jpg", - "save_id": 2643, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 8." - }, - { - "id": "rpg_060", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 8, - "optimal_path": [ - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 4 - ], - [ - 2, - 4 - ], - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 0, - 3 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 1, - 1, - 2, - 0 - ], - [ - 2, - 0, - 3, - 0, - 0, - 0 - ], - [ - 0, - 0, - 1, - 3, - 0, - 0 - ], - [ - 3, - 1, - 2, - 0, - 0, - 3 - ], - [ - 2, - 1, - 1, - 0, - 1, - 1 - ], - [ - 3, - 1, - 0, - 2, - 0, - 0 - ] - ], - "start_point": [ - 4, - 3 - ], - "end_point": [ - 0, - 3 - ], - "input_image": "dataset_weighted_path/rpg_060_input.jpg", - "result_image": "dataset_weighted_path/rpg_060_result.jpg", - "source_image": "Part4/Shortest_path/rpg_060_input.jpg", - "save_id": 2644, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 8." - }, - { - "id": "rpg_062", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元���蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 23, - "optimal_path": [ - [ - 6, - 2 - ], - [ - 5, - 2 - ], - [ - 5, - 3 - ], - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 2, - 3 - ], - [ - 2, - 4 - ], - [ - 1, - 4 - ], - [ - 1, - 5 - ], - [ - 1, - 6 - ], - [ - 1, - 7 - ], - [ - 1, - 8 - ] - ], - "terrain_map": [ - [ - 1, - 2, - 3, - 1, - 0, - 0, - 1, - 1, - 3 - ], - [ - 1, - 1, - 1, - 3, - 0, - 0, - 0, - 0, - 1 - ], - [ - 0, - 0, - 1, - 1, - 1, - 1, - 2, - 0, - 0 - ], - [ - 0, - 0, - 0, - 1, - 1, - 3, - 2, - 0, - 1 - ], - [ - 1, - 1, - 2, - 1, - 1, - 2, - 2, - 2, - 3 - ], - [ - 1, - 1, - 0, - 1, - 1, - 3, - 2, - 0, - 0 - ], - [ - 3, - 3, - 0, - 2, - 0, - 1, - 0, - 2, - 0 - ], - [ - 2, - 0, - 2, - 1, - 1, - 0, - 3, - 0, - 0 - ], - [ - 1, - 1, - 0, - 0, - 1, - 0, - 1, - 1, - 0 - ] - ], - "start_point": [ - 6, - 2 - ], - "end_point": [ - 1, - 8 - ], - "input_image": "dataset_weighted_path/rpg_062_input.jpg", - "result_image": "dataset_weighted_path/rpg_062_result.jpg", - "source_image": "Part4/Shortest_path/rpg_062_input.jpg", - "save_id": 2646, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 23." - }, - { - "id": "rpg_064", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 19, - "optimal_path": [ - [ - 3, - 0 - ], - [ - 4, - 0 - ], - [ - 4, - 1 - ], - [ - 4, - 2 - ], - [ - 5, - 2 - ], - [ - 6, - 2 - ], - [ - 6, - 3 - ], - [ - 6, - 4 - ], - [ - 7, - 4 - ], - [ - 7, - 5 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 0, - 0, - 0, - 3, - 1, - 0, - 3, - 1 - ], - [ - 0, - 2, - 0, - 0, - 0, - 0, - 3, - 1, - 0, - 3 - ], - [ - 0, - 0, - 2, - 0, - 1, - 3, - 2, - 0, - 0, - 1 - ], - [ - 0, - 1, - 0, - 1, - 0, - 3, - 3, - 1, - 0, - 1 - ], - [ - 0, - 0, - 0, - 0, - 2, - 0, - 2, - 2, - 0, - 0 - ], - [ - 2, - 0, - 1, - 3, - 0, - 0, - 1, - 3, - 1, - 2 - ], - [ - 3, - 3, - 1, - 1, - 1, - 2, - 1, - 2, - 1, - 1 - ], - [ - 2, - 0, - 2, - 2, - 1, - 0, - 0, - 0, - 1, - 2 - ], - [ - 1, - 2, - 0, - 1, - 0, - 3, - 1, - 0, - 0, - 2 - ], - [ - 1, - 1, - 2, - 2, - 1, - 1, - 0, - 1, - 0, - 2 - ] - ], - "start_point": [ - 3, - 0 - ], - "end_point": [ - 7, - 5 - ], - "input_image": "dataset_weighted_path/rpg_064_input.jpg", - "result_image": "dataset_weighted_path/rpg_064_result.jpg", - "source_image": "Part4/Shortest_path/rpg_064_input.jpg", - "save_id": 2648, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 19." - }, - { - "id": "rpg_066", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 7, - "optimal_path": [ - [ - 0, - 3 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ], - [ - 1, - 1 - ] - ], - "terrain_map": [ - [ - 1, - 1, - 3, - 0, - 1, - 3 - ], - [ - 3, - 1, - 1, - 0, - 3, - 1 - ], - [ - 0, - 1, - 1, - 0, - 1, - 1 - ], - [ - 0, - 0, - 1, - 3, - 0, - 3 - ], - [ - 3, - 0, - 0, - 0, - 3, - 0 - ], - [ - 1, - 1, - 0, - 0, - 0, - 3 - ] - ], - "start_point": [ - 0, - 3 - ], - "end_point": [ - 1, - 1 - ], - "input_image": "dataset_weighted_path/rpg_066_input.jpg", - "result_image": "dataset_weighted_path/rpg_066_result.jpg", - "source_image": "Part4/Shortest_path/rpg_066_input.jpg", - "save_id": 2650, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 7." - }, - { - "id": "rpg_068", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 8, - "optimal_path": [ - [ - 5, - 3 - ], - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 2 - ], - [ - 2, - 2 - ] - ], - "terrain_map": [ - [ - 2, - 1, - 0, - 0, - 0, - 2 - ], - [ - 2, - 1, - 1, - 1, - 0, - 0 - ], - [ - 1, - 2, - 1, - 1, - 3, - 1 - ], - [ - 3, - 0, - 0, - 0, - 2, - 3 - ], - [ - 1, - 1, - 1, - 1, - 1, - 2 - ], - [ - 2, - 0, - 1, - 0, - 3, - 0 - ] - ], - "start_point": [ - 5, - 3 - ], - "end_point": [ - 2, - 2 - ], - "input_image": "dataset_weighted_path/rpg_068_input.jpg", - "result_image": "dataset_weighted_path/rpg_068_result.jpg", - "source_image": "Part4/Shortest_path/rpg_068_input.jpg", - "save_id": 2652, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 8." - }, - { - "id": "rpg_070", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 22, - "optimal_path": [ - [ - 1, - 7 - ], - [ - 1, - 6 - ], - [ - 1, - 5 - ], - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ], - [ - 2, - 2 - ], - [ - 3, - 2 - ], - [ - 3, - 1 - ], - [ - 4, - 1 - ] - ], - "terrain_map": [ - [ - 3, - 3, - 0, - 1, - 2, - 0, - 1, - 3 - ], - [ - 1, - 3, - 0, - 0, - 0, - 1, - 0, - 0 - ], - [ - 1, - 2, - 1, - 1, - 2, - 0, - 1, - 1 - ], - [ - 2, - 0, - 1, - 1, - 1, - 1, - 1, - 0 - ], - [ - 1, - 2, - 3, - 0, - 0, - 0, - 0, - 2 - ], - [ - 3, - 0, - 2, - 0, - 3, - 2, - 3, - 0 - ], - [ - 0, - 0, - 0, - 1, - 2, - 1, - 1, - 0 - ], - [ - 0, - 0, - 3, - 3, - 2, - 1, - 2, - 3 - ] - ], - "start_point": [ - 1, - 7 - ], - "end_point": [ - 4, - 1 - ], - "input_image": "dataset_weighted_path/rpg_070_input.jpg", - "result_image": "dataset_weighted_path/rpg_070_result.jpg", - "source_image": "Part4/Shortest_path/rpg_070_input.jpg", - "save_id": 2654, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 22." - }, - { - "id": "rpg_072", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 9, - "optimal_path": [ - [ - 0, - 1 - ], - [ - 0, - 2 - ], - [ - 1, - 2 - ], - [ - 2, - 2 - ], - [ - 2, - 3 - ], - [ - 3, - 3 - ], - [ - 3, - 4 - ], - [ - 4, - 4 - ] - ], - "terrain_map": [ - [ - 3, - 1, - 1, - 0, - 3, - 0, - 0 - ], - [ - 1, - 2, - 0, - 1, - 3, - 3, - 1 - ], - [ - 0, - 1, - 0, - 0, - 1, - 2, - 1 - ], - [ - 0, - 0, - 0, - 0, - 0, - 0, - 0 - ], - [ - 1, - 0, - 3, - 0, - 0, - 0, - 3 - ], - [ - 2, - 2, - 1, - 0, - 1, - 3, - 0 - ], - [ - 0, - 3, - 0, - 2, - 0, - 0, - 3 - ] - ], - "start_point": [ - 0, - 1 - ], - "end_point": [ - 4, - 4 - ], - "input_image": "dataset_weighted_path/rpg_072_input.jpg", - "result_image": "dataset_weighted_path/rpg_072_result.jpg", - "source_image": "Part4/Shortest_path/rpg_072_input.jpg", - "save_id": 2656, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 9." - }, - { - "id": "rpg_074", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 31, - "optimal_path": [ - [ - 5, - 8 - ], - [ - 6, - 8 - ], - [ - 6, - 7 - ], - [ - 7, - 7 - ], - [ - 8, - 7 - ], - [ - 8, - 6 - ], - [ - 8, - 5 - ], - [ - 8, - 4 - ], - [ - 8, - 3 - ], - [ - 7, - 3 - ], - [ - 6, - 3 - ], - [ - 5, - 3 - ], - [ - 4, - 3 - ], - [ - 3, - 3 - ], - [ - 2, - 3 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 0, - 1, - 0, - 2, - 0, - 1, - 0, - 0 - ], - [ - 0, - 0, - 1, - 1, - 3, - 3, - 3, - 3, - 3, - 0 - ], - [ - 0, - 1, - 3, - 2, - 2, - 2, - 0, - 0, - 3, - 3 - ], - [ - 1, - 3, - 3, - 1, - 0, - 0, - 3, - 1, - 1, - 1 - ], - [ - 3, - 1, - 0, - 0, - 1, - 3, - 0, - 1, - 0, - 3 - ], - [ - 0, - 0, - 2, - 0, - 1, - 0, - 2, - 3, - 1, - 0 - ], - [ - 2, - 0, - 1, - 0, - 1, - 2, - 2, - 0, - 0, - 3 - ], - [ - 1, - 0, - 0, - 0, - 1, - 1, - 3, - 0, - 0, - 0 - ], - [ - 1, - 3, - 1, - 0, - 0, - 0, - 1, - 0, - 1, - 0 - ], - [ - 0, - 0, - 0, - 3, - 1, - 1, - 0, - 0, - 1, - 0 - ] - ], - "start_point": [ - 5, - 8 - ], - "end_point": [ - 1, - 2 - ], - "input_image": "dataset_weighted_path/rpg_074_input.jpg", - "result_image": "dataset_weighted_path/rpg_074_result.jpg", - "source_image": "Part4/Shortest_path/rpg_074_input.jpg", - "save_id": 2658, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 31." - }, - { - "id": "rpg_076", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 25, - "optimal_path": [ - [ - 0, - 0 - ], - [ - 0, - 1 - ], - [ - 0, - 2 - ], - [ - 0, - 3 - ], - [ - 0, - 4 - ], - [ - 0, - 5 - ], - [ - 0, - 6 - ], - [ - 1, - 6 - ], - [ - 2, - 6 - ], - [ - 3, - 6 - ], - [ - 4, - 6 - ] - ], - "terrain_map": [ - [ - 0, - 1, - 1, - 1, - 1, - 0, - 0 - ], - [ - 0, - 1, - 3, - 2, - 1, - 1, - 0 - ], - [ - 0, - 3, - 2, - 1, - 0, - 2, - 0 - ], - [ - 1, - 2, - 3, - 1, - 1, - 2, - 2 - ], - [ - 1, - 2, - 0, - 1, - 2, - 0, - 0 - ], - [ - 0, - 0, - 2, - 3, - 1, - 1, - 2 - ], - [ - 2, - 0, - 2, - 0, - 1, - 2, - 2 - ] - ], - "start_point": [ - 0, - 0 - ], - "end_point": [ - 4, - 6 - ], - "input_image": "dataset_weighted_path/rpg_076_input.jpg", - "result_image": "dataset_weighted_path/rpg_076_result.jpg", - "source_image": "Part4/Shortest_path/rpg_076_input.jpg", - "save_id": 2660, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 25." - }, - { - "id": "rpg_078", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 5, - "optimal_path": [ - [ - 6, - 5 - ], - [ - 6, - 4 - ], - [ - 6, - 3 - ], - [ - 6, - 2 - ] - ], - "terrain_map": [ - [ - 0, - 1, - 0, - 3, - 2, - 3, - 1 - ], - [ - 2, - 1, - 0, - 0, - 0, - 0, - 0 - ], - [ - 0, - 3, - 2, - 1, - 2, - 1, - 0 - ], - [ - 0, - 0, - 2, - 2, - 3, - 0, - 3 - ], - [ - 1, - 0, - 3, - 1, - 0, - 0, - 0 - ], - [ - 1, - 2, - 0, - 1, - 0, - 1, - 0 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 1 - ] - ], - "start_point": [ - 6, - 5 - ], - "end_point": [ - 6, - 2 - ], - "input_image": "dataset_weighted_path/rpg_078_input.jpg", - "result_image": "dataset_weighted_path/rpg_078_result.jpg", - "source_image": "Part4/Shortest_path/rpg_078_input.jpg", - "save_id": 2662, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 5." - }, - { - "id": "rpg_080", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 7, - "optimal_path": [ - [ - 5, - 0 - ], - [ - 5, - 1 - ], - [ - 5, - 2 - ], - [ - 6, - 2 - ], - [ - 6, - 3 - ], - [ - 6, - 4 - ] - ], - "terrain_map": [ - [ - 0, - 0, - 1, - 3, - 0, - 1, - 1 - ], - [ - 3, - 0, - 0, - 1, - 0, - 0, - 0 - ], - [ - 1, - 0, - 1, - 0, - 1, - 0, - 3 - ], - [ - 0, - 0, - 0, - 3, - 1, - 0, - 3 - ], - [ - 2, - 1, - 3, - 3, - 3, - 0, - 2 - ], - [ - 0, - 0, - 0, - 3, - 0, - 2, - 1 - ], - [ - 3, - 1, - 1, - 0, - 0, - 1, - 0 - ] - ], - "start_point": [ - 5, - 0 - ], - "end_point": [ - 6, - 4 - ], - "input_image": "dataset_weighted_path/rpg_080_input.jpg", - "result_image": "dataset_weighted_path/rpg_080_result.jpg", - "source_image": "Part4/Shortest_path/rpg_080_input.jpg", - "save_id": 2664, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 7." - }, - { - "id": "rpg_082", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 16, - "optimal_path": [ - [ - 4, - 0 - ], - [ - 4, - 1 - ], - [ - 5, - 1 - ], - [ - 6, - 1 - ], - [ - 6, - 2 - ], - [ - 7, - 2 - ], - [ - 8, - 2 - ], - [ - 8, - 1 - ], - [ - 8, - 0 - ] - ], - "terrain_map": [ - [ - 0, - 2, - 2, - 3, - 2, - 2, - 1, - 0, - 1, - 1 - ], - [ - 0, - 0, - 0, - 1, - 0, - 3, - 1, - 0, - 2, - 0 - ], - [ - 0, - 0, - 0, - 1, - 3, - 0, - 0, - 0, - 0, - 0 - ], - [ - 0, - 0, - 2, - 0, - 0, - 0, - 3, - 0, - 1, - 0 - ], - [ - 0, - 0, - 3, - 2, - 1, - 3, - 1, - 0, - 3, - 0 - ], - [ - 1, - 0, - 1, - 0, - 3, - 0, - 2, - 3, - 1, - 0 - ], - [ - 1, - 0, - 1, - 0, - 0, - 3, - 0, - 2, - 1, - 3 - ], - [ - 3, - 3, - 0, - 1, - 1, - 1, - 0, - 1, - 0, - 0 - ], - [ - 1, - 1, - 1, - 3, - 0, - 1, - 1, - 3, - 0, - 0 - ], - [ - 3, - 0, - 1, - 3, - 0, - 0, - 1, - 0, - 3, - 0 - ] - ], - "start_point": [ - 4, - 0 - ], - "end_point": [ - 8, - 0 - ], - "input_image": "dataset_weighted_path/rpg_082_input.jpg", - "result_image": "dataset_weighted_path/rpg_082_result.jpg", - "source_image": "Part4/Shortest_path/rpg_082_input.jpg", - "save_id": 2666, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 16." - }, - { - "id": "rpg_084", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 17, - "optimal_path": [ - [ - 0, - 6 - ], - [ - 0, - 5 - ], - [ - 0, - 4 - ], - [ - 1, - 4 - ], - [ - 2, - 4 - ], - [ - 3, - 4 - ], - [ - 4, - 4 - ], - [ - 5, - 4 - ] - ], - "terrain_map": [ - [ - 0, - 0, - 3, - 0, - 1, - 1, - 1 - ], - [ - 0, - 2, - 2, - 2, - 0, - 2, - 2 - ], - [ - 3, - 1, - 1, - 0, - 1, - 1, - 0 - ], - [ - 0, - 0, - 1, - 0, - 1, - 2, - 0 - ], - [ - 0, - 1, - 0, - 1, - 1, - 2, - 0 - ], - [ - 1, - 0, - 0, - 0, - 0, - 1, - 1 - ], - [ - 0, - 3, - 0, - 0, - 1, - 1, - 0 - ] - ], - "start_point": [ - 0, - 6 - ], - "end_point": [ - 5, - 4 - ], - "input_image": "dataset_weighted_path/rpg_084_input.jpg", - "result_image": "dataset_weighted_path/rpg_084_result.jpg", - "source_image": "Part4/Shortest_path/rpg_084_input.jpg", - "save_id": 2668, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 17." - }, - { - "id": "rpg_086", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 10, - "min_cost": 16, - "optimal_path": [ - [ - 0, - 8 - ], - [ - 1, - 8 - ], - [ - 2, - 8 - ], - [ - 3, - 8 - ], - [ - 4, - 8 - ], - [ - 5, - 8 - ], - [ - 6, - 8 - ], - [ - 7, - 8 - ], - [ - 7, - 7 - ], - [ - 8, - 7 - ], - [ - 8, - 6 - ] - ], - "terrain_map": [ - [ - 0, - 0, - 0, - 2, - 3, - 1, - 0, - 0, - 1, - 1 - ], - [ - 3, - 2, - 1, - 2, - 0, - 1, - 1, - 3, - 0, - 3 - ], - [ - 1, - 2, - 0, - 1, - 1, - 1, - 3, - 0, - 1, - 2 - ], - [ - 0, - 0, - 0, - 1, - 1, - 1, - 3, - 1, - 0, - 1 - ], - [ - 2, - 1, - 1, - 0, - 2, - 2, - 3, - 0, - 0, - 1 - ], - [ - 0, - 0, - 0, - 0, - 1, - 2, - 1, - 2, - 1, - 0 - ], - [ - 1, - 0, - 0, - 3, - 0, - 0, - 1, - 1, - 1, - 1 - ], - [ - 1, - 2, - 0, - 2, - 3, - 0, - 1, - 0, - 0, - 0 - ], - [ - 3, - 0, - 0, - 0, - 0, - 3, - 0, - 0, - 2, - 1 - ], - [ - 1, - 1, - 0, - 1, - 1, - 1, - 1, - 2, - 0, - 0 - ] - ], - "start_point": [ - 0, - 8 - ], - "end_point": [ - 8, - 6 - ], - "input_image": "dataset_weighted_path/rpg_086_input.jpg", - "result_image": "dataset_weighted_path/rpg_086_result.jpg", - "source_image": "Part4/Shortest_path/rpg_086_input.jpg", - "save_id": 2670, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 16." - }, - { - "id": "rpg_088", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 3, - "optimal_path": [ - [ - 4, - 2 - ], - [ - 5, - 2 - ], - [ - 6, - 2 - ], - [ - 6, - 3 - ] - ], - "terrain_map": [ - [ - 0, - 1, - 1, - 0, - 3, - 1, - 3, - 0, - 3 - ], - [ - 0, - 0, - 0, - 3, - 0, - 2, - 0, - 1, - 3 - ], - [ - 0, - 0, - 2, - 1, - 2, - 3, - 0, - 2, - 0 - ], - [ - 1, - 0, - 1, - 1, - 0, - 0, - 1, - 0, - 1 - ], - [ - 0, - 3, - 0, - 1, - 1, - 0, - 0, - 0, - 2 - ], - [ - 3, - 2, - 0, - 2, - 3, - 2, - 3, - 0, - 0 - ], - [ - 0, - 0, - 0, - 0, - 0, - 0, - 2, - 2, - 0 - ], - [ - 0, - 0, - 3, - 0, - 3, - 0, - 1, - 2, - 0 - ], - [ - 1, - 2, - 0, - 1, - 0, - 0, - 2, - 1, - 1 - ] - ], - "start_point": [ - 4, - 2 - ], - "end_point": [ - 6, - 3 - ], - "input_image": "dataset_weighted_path/rpg_088_input.jpg", - "result_image": "dataset_weighted_path/rpg_088_result.jpg", - "source_image": "Part4/Shortest_path/rpg_088_input.jpg", - "save_id": 2672, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 3." - }, - { - "id": "rpg_090", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 6, - "min_cost": 15, - "optimal_path": [ - [ - 4, - 5 - ], - [ - 4, - 4 - ], - [ - 4, - 3 - ], - [ - 4, - 2 - ], - [ - 4, - 1 - ], - [ - 4, - 0 - ], - [ - 3, - 0 - ], - [ - 2, - 0 - ] - ], - "terrain_map": [ - [ - 1, - 0, - 2, - 2, - 1, - 0 - ], - [ - 2, - 0, - 3, - 3, - 1, - 0 - ], - [ - 0, - 1, - 3, - 0, - 1, - 3 - ], - [ - 1, - 3, - 1, - 1, - 1, - 1 - ], - [ - 1, - 0, - 0, - 1, - 1, - 0 - ], - [ - 1, - 0, - 2, - 0, - 1, - 2 - ] - ], - "start_point": [ - 4, - 5 - ], - "end_point": [ - 2, - 0 - ], - "input_image": "dataset_weighted_path/rpg_090_input.jpg", - "result_image": "dataset_weighted_path/rpg_090_result.jpg", - "source_image": "Part4/Shortest_path/rpg_090_input.jpg", - "save_id": 2674, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 15." - }, - { - "id": "rpg_092", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 3, - "optimal_path": [ - [ - 6, - 2 - ], - [ - 6, - 1 - ], - [ - 6, - 0 - ], - [ - 5, - 0 - ] - ], - "terrain_map": [ - [ - 2, - 2, - 2, - 1, - 3, - 2, - 0 - ], - [ - 3, - 1, - 1, - 0, - 1, - 0, - 3 - ], - [ - 0, - 0, - 0, - 2, - 1, - 1, - 0 - ], - [ - 3, - 3, - 0, - 1, - 1, - 2, - 3 - ], - [ - 0, - 3, - 1, - 0, - 0, - 3, - 0 - ], - [ - 0, - 2, - 0, - 2, - 1, - 1, - 0 - ], - [ - 0, - 0, - 0, - 1, - 0, - 1, - 1 - ] - ], - "start_point": [ - 6, - 2 - ], - "end_point": [ - 5, - 0 - ], - "input_image": "dataset_weighted_path/rpg_092_input.jpg", - "result_image": "dataset_weighted_path/rpg_092_result.jpg", - "source_image": "Part4/Shortest_path/rpg_092_input.jpg", - "save_id": 2676, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 3." - }, - { - "id": "rpg_094", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 8, - "min_cost": 19, - "optimal_path": [ - [ - 0, - 2 - ], - [ - 1, - 2 - ], - [ - 1, - 3 - ], - [ - 1, - 4 - ], - [ - 1, - 5 - ], - [ - 2, - 5 - ], - [ - 3, - 5 - ] - ], - "terrain_map": [ - [ - 1, - 3, - 0, - 3, - 0, - 1, - 3, - 0 - ], - [ - 0, - 3, - 1, - 0, - 2, - 0, - 1, - 1 - ], - [ - 3, - 3, - 0, - 3, - 0, - 1, - 0, - 2 - ], - [ - 0, - 0, - 3, - 2, - 1, - 1, - 3, - 1 - ], - [ - 0, - 1, - 1, - 2, - 2, - 0, - 0, - 0 - ], - [ - 1, - 1, - 0, - 2, - 3, - 3, - 3, - 0 - ], - [ - 2, - 0, - 2, - 1, - 1, - 2, - 0, - 1 - ], - [ - 0, - 1, - 1, - 1, - 1, - 2, - 1, - 1 - ] - ], - "start_point": [ - 0, - 2 - ], - "end_point": [ - 3, - 5 - ], - "input_image": "dataset_weighted_path/rpg_094_input.jpg", - "result_image": "dataset_weighted_path/rpg_094_result.jpg", - "source_image": "Part4/Shortest_path/rpg_094_input.jpg", - "save_id": 2678, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 19." - }, - { - "id": "rpg_096", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 7, - "min_cost": 5, - "optimal_path": [ - [ - 5, - 2 - ], - [ - 4, - 2 - ], - [ - 3, - 2 - ], - [ - 2, - 2 - ] - ], - "terrain_map": [ - [ - 0, - 0, - 3, - 0, - 2, - 2, - 1 - ], - [ - 0, - 0, - 0, - 0, - 0, - 1, - 3 - ], - [ - 0, - 0, - 0, - 0, - 1, - 0, - 3 - ], - [ - 0, - 1, - 0, - 1, - 0, - 2, - 1 - ], - [ - 3, - 0, - 1, - 3, - 1, - 0, - 0 - ], - [ - 0, - 1, - 1, - 2, - 3, - 0, - 1 - ], - [ - 1, - 0, - 0, - 2, - 3, - 3, - 0 - ] - ], - "start_point": [ - 5, - 2 - ], - "end_point": [ - 2, - 2 - ], - "input_image": "dataset_weighted_path/rpg_096_input.jpg", - "result_image": "dataset_weighted_path/rpg_096_result.jpg", - "source_image": "Part4/Shortest_path/rpg_096_input.jpg", - "save_id": 2680, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 5." - }, - { - "id": "rpg_098", - "task": "weighted_shortest_path", - "prompt_en": "Draw a lowest-cost path from S to E using red arrows. Movement is restricted to horizontal or vertical directions only, and the path may pass only through gray, green, and blue cells. The cost is 1 for gray cells, 3 for green cells, and 8 for blue cells.", - "prompt_cn": "使用红色箭头绘制一条从起点 S 到终点 E 的最低成本路径。路径只能进行水平或垂直移动，且仅可经过灰色、绿色和蓝色方格，其中灰色方格的成本为 1 元，绿色方格为 3 元，蓝色方格的成本为 8 元。", - "grid_size": 9, - "min_cost": 32, - "optimal_path": [ - [ - 1, - 4 - ], - [ - 1, - 3 - ], - [ - 1, - 2 - ], - [ - 2, - 2 - ], - [ - 3, - 2 - ], - [ - 4, - 2 - ], - [ - 5, - 2 - ], - [ - 6, - 2 - ], - [ - 7, - 2 - ], - [ - 8, - 2 - ], - [ - 8, - 3 - ], - [ - 8, - 4 - ], - [ - 8, - 5 - ], - [ - 7, - 5 - ], - [ - 7, - 6 - ] - ], - "terrain_map": [ - [ - 1, - 2, - 0, - 0, - 3, - 1, - 1, - 0, - 0 - ], - [ - 1, - 0, - 0, - 2, - 1, - 2, - 1, - 1, - 0 - ], - [ - 0, - 0, - 0, - 3, - 0, - 2, - 1, - 1, - 2 - ], - [ - 0, - 3, - 0, - 3, - 2, - 3, - 0, - 1, - 1 - ], - [ - 0, - 1, - 0, - 3, - 0, - 3, - 1, - 0, - 2 - ], - [ - 0, - 3, - 0, - 2, - 0, - 2, - 3, - 3, - 1 - ], - [ - 3, - 0, - 0, - 3, - 1, - 3, - 0, - 1, - 0 - ], - [ - 3, - 3, - 2, - 3, - 3, - 0, - 0, - 3, - 0 - ], - [ - 1, - 3, - 1, - 0, - 1, - 0, - 3, - 1, - 1 - ] - ], - "start_point": [ - 1, - 4 - ], - "end_point": [ - 7, - 6 - ], - "input_image": "dataset_weighted_path/rpg_098_input.jpg", - "result_image": "dataset_weighted_path/rpg_098_result.jpg", - "source_image": "Part4/Shortest_path/rpg_098_input.jpg", - "save_id": 2682, - "IC": false, - "IF": true, - "WA": true, - "VC": true, - "VQ": true, - "need_hint": true, - "hints": "If the cost of the starting point is included, the cost of the optimal path is 32." - }, { "id": "rpg_000", "task": "weighted_shortest_path",