Find the string in grid.cpp

//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;

// } Driver Code Ends

/*
Find the string in grid

Example 1:
Input:
1 3 3
abc
def
ghi abc

Output:
0 0

Example 2:
Input:
1 3 4
abab
abeb
ebeb abe

Output:
0 0 0 2 1 0
*/

class Solution
{
    /*
    \ | /
    -   -
    / | \
    Below are the 8 directions, Horizontally Left, Horizontally Right, Vertically Up, Vertically Down and 4 Diagonals.
    */
    const int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
    const int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

    bool search(vector<vector<char>> &grid, string &word, int i, int j, int n, int m)
    {
        if (grid[i][j] != word[0]) // If the first letter doesn't match, return false
        {
            return false;
        }
        for (int dir = 0; dir < 8; dir++)
        {
            int x = i + dx[dir], y = j + dy[dir];
            int index;
            for (index = 1; index < word.size(); index++)
            {
                if (x < 0 || y < 0 || x >= n || y >= m || grid[x][y] != word[index])
                {
                    break; // If the element doesn't exist at particular position Matrix[x][uy] or row/column number exceeded or a particular letter doesn't match, break the loop
                }
                x += dx[dir];
                y += dy[dir]; // else the letter is a match, so move in the same direction for next loop
            }
            if (index == word.size())
            {
                return true;
            }
        }
        return false;
    }

public:
    vector<vector<int>> searchWord(vector<vector<char>> grid, string word)
    {
        // Code here
        vector<vector<int>> ans;
        int n = grid.size();
        int m = grid[0].size();
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                if (search(grid, word, i, j, n, m))
                {
                    ans.push_back({i, j}); // If the string is found at particular co-ordinates, push the co-ordinates
                }
            }
        }
        return ans;
    }
};

//{ Driver Code Starts.
int main()
{
    int tc;
    cin >> tc;
    while (tc--)
    {
        int n, m;
        cin >> n >> m;
        vector<vector<char>> grid(n, vector<char>(m, 'x'));
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
                cin >> grid[i][j];
        }
        string word;
        cin >> word;
        Solution obj;
        vector<vector<int>> ans = obj.searchWord(grid, word);
        if (ans.size() == 0)
        {
            cout << "-1\n";
        }
        else
        {
            for (auto i : ans)
            {
                for (auto j : i)
                    cout << j << " ";
                cout << "\n";
            }
        }
    }
    return 0;
}
// } Driver Code Ends