Elevator Trouble

#include <bits/stdc++.h>

using namespace std;



int main()
{
	int floors;
	int start;
	int goal;
	int up;
	int down;

	cin >> floors >> start >> goal >> up >> down;
	vector<int> visited(floors+1, false);

	queue<pair<int, int>> floorQue;

	floorQue.push(make_pair(start, 0));

	int howMany = -1;

	while (!floorQue.empty()) {

		pair<int, int> toHandle = floorQue.front();
		floorQue.pop();

		// cout << "at floor " << toHandle.first << " with this many steps: " << toHandle.second << "\n";

		if (visited[toHandle.first]) continue;

		// cout << "not found from visited\n";

		if (toHandle.first > floors || toHandle.first < 1) continue;

		// cout << "within correct range\n";

		if (toHandle.first == goal) {
			howMany = toHandle.second;
			break;
		}

		// cout << "not goal\n";

		visited[toHandle.first] = true;

		pair<int, int> toPushUp = make_pair(toHandle.first+up, toHandle.second + 1);
		floorQue.push(toPushUp);

		pair<int, int> toPushDown = make_pair(toHandle.first-down, toHandle.second + 1);
		floorQue.push(toPushDown);
	}

	if (howMany != -1) {
		cout << howMany << "\n";
	} else {
		cout << "use the stairs\n";
	}


	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED