-
Notifications
You must be signed in to change notification settings - Fork 0
/
16928.cpp
66 lines (62 loc) · 1.8 KB
/
16928.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
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
int n, m;
int tmp1, tmp2;
map<int, int>ladder;
map<int, int>snake;
map<int, int>:: iterator iter;
int answer = 0;
queue<pair<int, int>>q;
bool visited[101] = {0, };
int bfs();
int main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//입력
cin >> n >> m;
for(int i = 0; i < n; i++){
cin >> tmp1 >> tmp2;
ladder.insert(make_pair(tmp1, tmp2));
}
for(int i = 0; i < m; i++){
cin >> tmp1 >> tmp2;
snake.insert(make_pair(tmp1, tmp2));
}
cout << bfs();
}
int bfs(){
q.push(make_pair(1,0));
while(!q.empty()){
answer++;
for(int i = 1; i <= 6; i++){
if(snake.find(q.front().first + i) != snake.end()){
if(!visited[snake[q.front().first+i]]){
visited[snake[q.front().first+i]] = 1;
q.push(make_pair(snake[q.front().first+i], q.front().second+1));
}
}
else if(ladder.find(q.front().first+i) != ladder.end()){
if(ladder[q.front().first+i] == 100){
return q.front().second+1;
}
if(!visited[ladder[q.front().first+i]]){
visited[ladder[q.front().first+i]] = 1;
q.push(make_pair(ladder[q.front().first+i], q.front().second+1));
}
}
else {
if(q.front().first+i == 100)
return q.front().second+1;
if(!visited[q.front().first+i] && q.front().first+i <100){
visited[q.front().first+i] = 1;
q.push(make_pair(q.front().first+i, q.front().second+1));
}
}
}
q.pop();
}
}