-
Notifications
You must be signed in to change notification settings - Fork 0
/
16236.cpp
97 lines (87 loc) · 1.78 KB
/
16236.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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <iostream>
#include <queue>
#include <cmath>
#include <vector>
using namespace std;
int N;
int ocean[20][20];
int dy[] = { -1, 0, 0, 1 }, dx[] = { 0, -1, 1, 0 };
struct Fish
{
int y, x, dist;
bool operator<(const Fish &b) const
{
if (dist == b.dist)
{
if (y == b.y)
return x > b.x;
return y > b.y;
}
return dist > b.dist;
}
};
queue<Fish> shark;
int getMaxTime()
{
int time = 0, eat = 0, size = 2;
while (true)
{
priority_queue<Fish> feed;
vector<vector<bool>> visit(N, vector<bool>(N));
// bfs로 먹을 수 있는 먹이 모두 찾기
while (!shark.empty())
{
Fish curr = shark.front();
shark.pop();
for (int i = 0; i < 4; i++)
{
int ny = curr.y + dy[i], nx = curr.x + dx[i];
if (ny < 0 || nx < 0 || ny >= N || nx >= N)
continue;
if (visit[ny][nx] || ocean[ny][nx] > size)
continue;
visit[ny][nx] = true;
shark.push({ ny, nx, curr.dist + 1 });
if (ocean[ny][nx] < size && ocean[ny][nx] != 0)
feed.push({ ny, nx, curr.dist + 1 });
}
}
// feed가 비어있으면 break
if (feed.empty())
break;
// 먹이 먹기
Fish selected = feed.top();
int feedY = selected.y, feedX = selected.x, feedSize = ocean[feedY][feedX];
if (++eat == size)
{
eat = 0;
size++;
}
// 먹이 위치로 이동
ocean[feedY][feedX] = 0;
shark.push({ feedY, feedX, 0 });
time += selected.dist;
}
return time;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// 입력
cin >> N;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
{
cin >> ocean[i][j];
if (ocean[i][j] == 9)
{
ocean[i][j] = 0;
shark.push({ i, j, 0 });
}
}
// 출력
cout << getMaxTime() << '\n';
return 0;
}