1496. Path Crossing

class Solution {
public:
    bool isPathCrossing(string path) {
        
        int x = 0, y = 0;

        map<pair<int,int>, bool> m;

        m[{x,y}] = true;

        for(int i=0; i<path.length(); i++)
        {
            if(path[i] == 'N')
                y++;
            else if(path[i] == 'E')
                x++;
            else if(path[i] == 'S')
                y--;
            else 
                x--;


            if(m.find({x,y}) != m.end())
            {
                return true;
            }

            m[{x,y}] = true;
        }

        return false;
    }
};