백준 17135번

https://www.acmicpc.net/problem/17135

17135번: 캐슬 디펜스

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int N, M, D, result = 0, count = 0;
	int map[15][15];

	cin >> N >> M >> D;

	vector<pair<int, int>> enemy;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cin >> map[i][j];

			if (map[i][j] == 1)
			{
				enemy.push_back({ i, j });
			}
		}
	}

	while (true)
	{
		int y = N;
		vector<int> target;
		for (int i = 0; i < M-3; i++)
		{
			int dist = abs(y - enemy[0].first) + abs(i - enemy[0].second);
		}


		vector<pair<int, int>> temp;
		for (int i = 0; i < enemy.size(); i++)
		{
			if (enemy[i].first < N - 1)
			{
				temp.push_back({ enemy[i].first + 1, enemy[i].second });
			}
		}

		enemy = temp;

		if (enemy.empty())
		{
			result = max(result, count);
			break;
		}
	}

	cout << result << "\n";

}