Elevator Trouble

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<utility>
#include<queue>

using namespace std;

int main(void) {
  int64_t f,s,g,u,d;
  cin >> f >> s >> g >> u >> d;
  vector<int64_t> moves(f+1,-1);
  queue<int64_t> bfs;
  bfs.push(s);
  moves[s]=0;
  while(!bfs.empty()) {
    int64_t cur=bfs.front();
    bfs.pop();

    if(cur + u <= f && moves[cur+u] == -1) {
      moves[cur+u]=moves[cur]+1;
      bfs.push(cur+u);
    }
    if(cur - d >= 1 && moves[cur-d] == -1) {
      moves[cur-d]=moves[cur]+1;
      bfs.push(cur-d);
    }
  }
  if(moves[g] == -1) {
    cout << "use the stairs\n";
  } else {
    cout << moves[g] << "\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