2020 计蒜之道 预赛 第一场 A. 五子棋 (模拟)

题目链接

Solution
简单模拟

Code

#include <bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int n = 25;
int mp[n+3][n+3];
char s[n+3][n+3];
int cnt = 0;
pii ans[(n+3)*(n+3)];
bool judge(int now,int x,int y) {
	int r = 0;
	int j = y + 1;while(j < n && mp[x][j] == now) {j++, r++;}
	j = y - 1;while(j >=0 && mp[x][j] == now) {j--,r++;}
	if(r>=4) return true;

	int c = 0;
	int i = x + 1;while(i < n && mp[i][y] == now) {i++, c++;}
	i = x - 1;while(i >= 0 && mp[i][y] == now) {i--, c++;}
	if(c>=4) return true;

	int l = 0;
	i = x - 1, j = y - 1;while(i >= 0 && j >= 0 && mp[i][j] == now) {i--,j--,l++;}
	i = x + 1, j = y + 1;while(i < n && j < n && mp[i][j] == now) {i++,j++,l++;}
	if(l >= 4) return true;

	int k = 0;
	i = x - 1, j = y + 1;while(i >= 0 && j < n && mp[i][j] == now) {i--,j++,k++;}
	i = x + 1, j = y - 1;while(i < n && j >= 0 && mp[i][j] == now) {i++,j--,k++;}
	if(k >= 4) return true;
	return false; 
}
void solve(int now) {
	for(int i = 0;i < n;++i) {
		for(int j = 0;j < n;++j) {
			if(mp[i][j] != -1) continue;
			if(judge(now,i,j)) ans[cnt++] = {i,j};
		}
	}
}
int main() {
	//black	white
	int cnt0 = 0, cnt1 = 0;
	for(int i = 0;i < n;++i) {
		scanf("%s",s[i]);
		for(int j = 0;j < n;++j) {
			if(s[i][j] == '.') mp[i][j] = -1;
			if(s[i][j] == 'x') mp[i][j] = 0, cnt0++;
			if(s[i][j] == 'o') mp[i][j] = 1, cnt1++;
		}
	}
	if(cnt0 == cnt1) solve(0);
	else solve(1);
	if(cnt == 0) printf("tie\n");
	else {
		for(int i = 0;i < cnt;++i) 
			printf("%d %d\n", ans[i].fi,ans[i].se);
	}
	return 0;
}