(c++) 백준 "2578. 빙고"

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

2578번: 빙고

---

#include <iostream>
#include <vector>
#include <map>

using namespace std;
vector<vector<int>> board;
vector<int> say;
map<int, pair<int, int>> m;
bool flagslide[] = { false,false }; //대각선 여부
bool flagwidth[5] = { false }; //가로 여부
bool flagheight[5] = { false }; //세로 여부

int bingo() {
	int count = 0;
	bool slid[] = { true ,true }; //대각선
	for (int i = 0; i < 5; i++) {
		bool flag[] = { true ,true }; //가로, 세로
		for (int k = 0; k < 5; k++) {
			if (board[i][k] != -1) { //가로
				flag[0] = false;
			}
			if (board[k][i] != -1) { //세로
				flag[1] = false;
			}
		}
		if (flag[0])count++;
		if (flag[1])count++;
		if (board[i][i] != -1) {
			slid[0] = false;
		}
		if (board[4 - i][i] != -1) {
			slid[1] = false;
		}
	}
	if (slid[0]) count++;
	if (slid[1])count++;
	return count;
}

void solution() { 
	for (int i = 0; i < 25; i++) {
		auto index = m.find(say[i])->second;
		board[index.first][index.second] = -1;
		if (i > 10) {
			if (bingo() >= 3) {
				cout << i + 1 << endl;
				return;
			}
		}
	}
}

int main() {
	for (int i = 0; i < 5; i++) {
		vector<int> tmp;
		for (int k = 0; k < 5; k++) {
			int n; cin >> n;
			tmp.push_back(n);
			m.insert({ n,{i,k} });
		}
		board.push_back(tmp);
	}
	for (int i = 0; i < 25; i++) {
		int n; cin >> n;
		say.push_back(n);
	}
	solution();
	return 0;
}