利用缓冲区实现“向量分解” - Power of Thor - Episode 1 [CodingGame技巧总结]

最新推荐文章于 2024-06-04 10:06:06 发布

CoderHustlion

最新推荐文章于 2024-06-04 10:06:06 发布

阅读量1.6k

点赞数 2

CC 4.0 BY-SA版权

分类专栏：算法 CodingGame C++ 文章标签： CodingGame C++ 算法

本文链接：https://blog.csdn.net/techfield/article/details/54912085

C++ 同时被 3 个专栏收录

9 篇文章

订阅专栏

算法

3 篇文章

订阅专栏

CodingGame

1 篇文章

订阅专栏

本文介绍了一个基于C++的编程挑战，旨在帮助角色Thor找到光明之源。通过两种不同的算法实现——原始解法与向量分解法，文章详细展示了如何通过条件判断和坐标调整来引导角色到达目标位置。

问题描述

Your program must allow Thor to reach the light of power.

题目地址：
https://www.codingame.com/ide/puzzle/power-of-thor-episode-1
八个方向

原始解法

通过嵌套的if条件语句来枚举各类情况：

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 * ---
 * Hint: You can use the debug stream to print initialTX and initialTY, if Thor seems not follow your orders.
 **/
int main()
{
    int lightX; // the X position of the light of power
    int lightY; // the Y position of the light of power
    int initialTX; // Thor's starting X position
    int initialTY; // Thor's starting Y position
    cin >> lightX >> lightY >> initialTX >> initialTY; cin.ignore();

    int currentX = initialTX;
    int currentY = initialTY;

    // game loop
    while (1) {
        int remainingTurns; // The remaining amount of turns Thor can move. Do not remove this line.
        cin >> remainingTurns; cin.ignore();

        // Write an action using cout. DON'T FORGET THE "<< endl"
        // To debug: cerr << "Debug messages..." << endl;


        // if both offset, then move in diaganol line
        if (currentX - lightX > 0) {
            if (currentY - lightY > 0){
                cout << "NW" << endl;
                currentX--;
                currentY--;
            } else if (currentY - lightY <0){
                cout << "SW" << endl;

                currentX--;
                currentY++;
                cerr << currentX << endl;
            }else {
                cerr << "now Y same" <<endl;
                cout << "W" <<endl;
                currentX--;
            }
        } else if (currentX - lightX < 0) {
            if (currentY - lightY > 0){
                cout << "NE" << endl;
                currentX++;
                currentY--;
            } else if (currentY - lightY <0){
                cout << "SE" << endl;
                currentX++;
                currentY++;
            }else {
                cout << "E" <<endl;
                currentX++;
            }
        } else {
            cerr << "now X same" <<endl;
            if (currentY - lightY > 0){
                cout << "N" << endl;
                currentY--;
            } else if (currentY - lightY < 0){
                cout << "S" << endl;
                currentY++;
            }else {
                // in position
                cerr << "now Y same" <<endl;
            }
        }






        // A single line providing the move to be made: N NE E SE S SW W or NW
        // cout << "SE" << endl;
    }
}

“向量分解”解法

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 * ---
 * Hint: You can use the debug stream to print initialTX and initialTY, if Thor seems not follow your orders.
 **/
int main()
{
    int lightX; // the X position of the light of power
    int lightY; // the Y position of the light of power
    int initialTX; // Thor's starting X position
    int initialTY; // Thor's starting Y position
    cin >> lightX >> lightY >> initialTX >> initialTY; cin.ignore();

    int dx = lightX - initialTX;
    int dy = lightY - initialTY;

    // game loop
    while (1) {
        int remainingTurns;
        cin >> remainingTurns; cin.ignore();

        // Write an action using cout. DON'T FORGET THE "<< endl"
        // To debug: cerr << "Debug messages..." << endl;
        if (dy > 0) {
            cout << "S";
            dy--;
        }           
        if (dy < 0) {
            cout << "N";
            dy++;
        }  

        if (dx > 0) {
            cout << "E";
            dx--;
        }           
        if (dx < 0) {
            cout << "W";
            dx++;
        }          

        cout << endl; // A single line providing the move to be made: N NE E SE S SW W or NW
    }
}