백준 2072번 오목 C++

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

2072번: 오목

 

단순한 구현 문제

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

enum class StoneType {
    NOTHING,
    BLACK,
    WHITE
};

enum Dir {
    UP,
    UR,
    RIGHT,
    DR,
    DOWN,
    DL,
    LEFT,
    UL
};

int n;
int ans = -1;
int dRow[8] = { -1,-1,0,1,1,1,0,-1 };
int dCol[8] = { 0,1,1,1,0,-1,-1,-1 };

vector<vector<StoneType>> board;

int GetSameStoneCnt(int row, int col, StoneType stoneType, Dir dir) {
    int ret = 0;
    while (true) {
        row += dRow[(int)dir];
        col += dCol[(int)dir];
        if (row <= 0 || row >= 20) break;
        if (col <= 0 || col >= 20) break;
        if (board[row][col] != stoneType) break;
        ret++;
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    board = vector<vector<StoneType>>(20, vector<StoneType>(20, StoneType::NOTHING));
    cin >> n;
    StoneType currType = StoneType::NOTHING;
    for (int i = 1; i <= n; i++) {
        if (i % 2 == 0) currType = StoneType::WHITE;
        else currType = StoneType::BLACK;
        int r, c;
        cin >> r >> c;
        board[r][c] = currType;
        int val1 = GetSameStoneCnt(r, c, currType, UP) + GetSameStoneCnt(r, c, currType, DOWN);
        int val2 = GetSameStoneCnt(r, c, currType, UR) + GetSameStoneCnt(r, c, currType, DL);
        int val3 = GetSameStoneCnt(r, c, currType, RIGHT) + GetSameStoneCnt(r, c, currType, LEFT);
        int val4 = GetSameStoneCnt(r, c, currType, DR) + GetSameStoneCnt(r, c, currType, UL);
        if (val1 == 4 || val2 == 4 || val3 == 4 || val4 == 4) {
            ans = i;
            break;
        }
    }
    cout << ans;
}