forked from b-chae/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path5014.cpp
More file actions
45 lines (38 loc) · 708 Bytes
/
Copy path5014.cpp
File metadata and controls
45 lines (38 loc) · 708 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <iostream>
#include <list>
using namespace std;
int F, S, G, U, D;
int value[1000001];
bool visited[1000001];
list<int> BFSQueue;
void bfs() {
if (BFSQueue.empty()) return;
int x = BFSQueue.front();
BFSQueue.pop_front();
if (x == G) return;
if (x + U <= F && !visited[x+U]) {
BFSQueue.push_back(x + U);
visited[x + U] = true;
value[x + U] = value[x] + 1;
}
if (x - D > 0 && !visited[x-D]) {
BFSQueue.push_back(x - D);
visited[x - D] = true;
value[x - D] = value[x] + 1;
}
bfs();
}
int main()
{
cin >> F >> S >> G >> U >> D;
visited[S] = true;
BFSQueue.push_back(S);
bfs();
if (visited[G]) {
cout << value[G];
}
else {
cout << "use the stairs";
}
return 0;
}