탐색할 때 사용하는 배열에 대해 질문이 있습니다

응용해서 다른 문제를 풀어봤는데 배열을 바꾸면 정답이 계속 바뀝니다...!

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

vector<vector<int>> map(201, vector<int>(201, 1));
vector<vector<int>> visited(201, vector<int>(201, 0));
vector<pair<int, int>> cctvx[4], cctvy[5];
int res = INT_MAX, n;
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };

void DFS(int x, int y,int timer,int cctvi) {
	int xx, yy;

	if (x == n && y == n) {
		res = min(timer, res);
	}

	else {
		while (cctvx[cctvi][0].first <= x && x <= cctvx[cctvi][0].second&&cctvy[cctvi][0].first <= y && y <= cctvy[cctvi][0].second) {
			timer++;
			cctvi++;
			if (cctvi == 4)
				cctvi = 0;
		}
		for (int i = 0; i < 4; i++) {
			xx = x + dx[i];
			yy = y + dy[i];

			if (xx<1 || xx>n || yy<1 || yy>n) continue;
			if (map[xx][yy] == 0 && visited[xx][yy] == 0){
				visited[xx][yy] = 1;
				timer++;
				cctvi++;
				if (cctvi == 4)
					cctvi = 0;
				DFS(xx, yy,timer,cctvi);
				visited[xx][yy] = 0;
			}
		}
	}
}

int main() {
	cin >> n;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> map[i][j];
		}
	}
	cctvx[0].push_back(make_pair(0, n / 4));
	cctvx[1].push_back(make_pair(n - (n / 4), n));
	cctvx[2].push_back(make_pair(n - (n / 4), n));
	cctvx[3].push_back(make_pair(0, n / 4));

	cctvy[0].push_back(make_pair(0, n / 4));
	cctvy[1].push_back(make_pair(0, n/4));
	cctvy[2].push_back(make_pair(n - (n / 4), n));
	cctvy[3].push_back(make_pair(n - (n / 4), n));
	
	visited[1][1] = 1;
	DFS(1,1,0,0);

	if (res == INT_MAX) {
		cout << -1;
		return 0;
	}
	else
	cout << res;
	
	return 0;
}