Atcoder ATC001A depth priority search implemented in C++ using recursive results in TLE

#include<bits/stdc++.h>
using namespace std;

vector<vector<int>>dxdy={1,0}, {-1,0}, {0,1}, {0,-1}};

void dfs(vector<string>c, inth, intw, vector>int>v, vector<bool>>>>seen){
    see [v[0]][v[1]]=true;

    for(inti=0;i<4;i++){
        int nxtX=v[0]+dxdy[i][0], nxtY=v[1]+dxdy[i][1];

        if(nxtX<0||nxtY<0||nxtX>=h||nxtY>=w) continue;
        if(seen[nxtX][nxtY]) continue;
        if(c[nxtX][nxtY]=='#') continue;
        dfs(c,h,w,{nxtX,nxtY},seen);
    }
}

int main() {
    inth,w;
    cin>>h>>w;
    vector<string>c(h);
    vector<int>start(2), goal(2);

    for(inti=0;i<h;i++){
        cin>>c[i];
        for(int j=0;j<w;j++){
            if(c[i][j]=='s') start={i,j};
            else if(c[i][j]=='g') goal={i,j};
        }
    }
    vector<vector>bool>>seen(h,vector<int>(w, false));

    dfs(c,h,w,start,seen);

    if(seen[goal[0]][goal[1]])cout<<"Yes"<<
    else cout <<"No" <<endl;
}