-
Notifications
You must be signed in to change notification settings - Fork 0
/
SnakeNLadder.cpp
68 lines (58 loc) · 1.13 KB
/
SnakeNLadder.cpp
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <cmath>
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cassert>
#include <queue>
using namespace std;
//#define TRvii(c, it) for (vii::iterator it = c.begin(); it != c.end(); it++)
queue<int> q;
map<int, int> dist;
int MinSteps(int moves[], int N)
{
q.push(0);
dist[0] = 0;
int u;
while (!q.empty()) {
u = q.front();
q.pop();
//printf("Visit %d, Layer %d\n", u, dist[u]);
int v = u;
if (v == N - 1)
break;
for (auto i = v + 1; i <= (v + 6) && i < N; ++i)
if (!dist.count(i)) { // if v is not visited before and reachable from u
dist[i] = dist[u] + 1;
if (moves[i] != -1)
u = moves[i];
else
u = i;
q.push(u); // enqueue v for next steps
}
}
//cout << dist[u] << endl;
return dist[u];
}
int main()
{
const int N = 30;
int moves[N];
memset(moves, -1, sizeof(moves));
// Ladders
//moves[0] = 29;
moves[2] = 21;
moves[4] = 7;
moves[10] = 25;
moves[19] = 28;
// Snakes
moves[26] = 0;
moves[20] = 8;
moves[16] = 3;
moves[18] = 6;
int res = MinSteps(moves,N);
cout << "Dice moves " << res;
cin.get();
return 0;
}