ZeroJudge F418: Word Search Puzzle

Word Search Puzzle is a common word puzzle typically composed of a rectangular grid where each cell contains a letter. Players can form specified words by tracing contiguous letters from left to right, top to bottom, or diagonally from top-left to bottom-right.

Wenwen has found a word. She provided the starting and ending positions. Please spell out the word she found.

Sample Inputs/Outputs

Sample Input (Formatted Table)

Thought Process

You can directly use a for loop to concatenate the characters. Just make sure to first determine if the answer string should be constructed horizontally from left to right, vertically from top to bottom, or diagonally from top-left to bottom-right.

"Left to right" means that the row (R) is fixed, so you just need to iterate through the columns (C) from C1 to C2 using a for loop.

"Top to bottom" means that the column (C) is fixed, so you just need to iterate through the rows (R) from R1 to R2 using a for loop.

"Diagonal" means you iterate through the rows from R1 to R2 using a for loop, but at the same time, you also increment the column (C1) by 1 each time you add a character.

Sample Code－ZeroJudge F418: Word Search Puzzle

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N, M;
    cin >> N >> M;
    int R1, C1, R2, C2;
    cin >> R1 >> C1 >> R2 >> C2;
    vector<string>v;
    for (int i = 0; i<N; i++)
    {
        string str;
        cin >> str;
        v.push_back(str);
    }
    string ans = "";
    if (R1 == R2)
    {
        for (int i = C1-1; i<C2; i++)
        {
            ans += v[R1-1][i];
        }
    }
    else if (C1 == C2)
    {
        for (int i = R1-1; i<R2; i++)
        {
            ans += v[i][C1-1];
        }
    }
    else
    {
        for (int i = R1-1; i<R2; i++)
        {
            ans += v[i][C1-1];
            C1++;
        }
    }
    cout << ans << "\n";
}

//ZeroJudge F418
//Dr. SeanXD