text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long T = 1;
while (T--) {
vector<string> v;
long long f = 0;
for (long long i = 0; i < 4; i++) {
string s;
cin >> s;
v.push_back(s);
for (long long j = 0; j < 2; j++) {
if (s[j] == 'x') {
if ((s[j + 1] == 'x' || s[j + 2] == 'x') &&
(s[j + 1] != 'o' && s[j + 2] != 'o')) {
f = 1;
}
} else if (s[j] == '.') {
if (s[j + 1] == 'x' && s[j + 2] == 'x') {
f = 1;
}
}
}
}
if (f) {
cout << "YES";
} else {
long long f = 0;
for (long long j = 0; j < 4; j++) {
for (long long i = 0; i < 2; i++) {
if (v[i][j] == 'x') {
if ((v[i + 1][j] == 'x' || v[i + 2][j] == 'x') &&
(v[i + 1][j] != 'o' && v[i + 2][j] != 'o')) {
f = 1;
}
} else if (v[i][j] == '.') {
if (v[i + 1][j] == 'x' && v[i + 2][j] == 'x') {
f = 1;
}
}
}
}
if (f) {
cout << "YES";
} else {
long long f = 0;
for (long long i = 0; i < 2; i++) {
for (long long j = 0; j < 2; j++) {
if (v[i][j] == 'x') {
if ((v[i + 1][j + 1] == 'x' || v[i + 2][j + 2] == 'x') &&
(v[i + 1][j + 1] != 'o' && v[i + 2][j + 2] != 'o')) {
f = 1;
}
} else if (v[i][j] == '.') {
if (v[i + 1][j + 1] == 'x' && v[i + 2][j + 2] == 'x') {
f = 1;
}
}
}
}
if (f) {
cout << "YES";
} else {
long long f = 0;
for (long long i = 0; i < 2; i++) {
for (long long j = 2; j < 4; j++) {
if (v[i][j] == 'x') {
if ((v[i + 1][j - 1] == 'x' || v[i + 2][j - 2] == 'x') &&
(v[i + 1][j - 1] != 'o' && v[i + 2][j - 2] != 'o')) {
f = 1;
}
} else if (v[i][j] == '.') {
if (v[i + 1][j - 1] == 'x' && v[i + 2][j - 2] == 'x') {
f = 1;
}
}
}
}
if (f) {
cout << "YES";
} else {
cout << "NO";
}
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int couldw(char tab[5][5], int f, int c) {
if (f <= 1)
if (tab[f + 1][c] == 'x' && tab[f + 2][c] == 'x') return 1;
if (f > 0 && f < 3)
if (tab[f - 1][c] == 'x' && tab[f + 1][c] == 'x') return 1;
if (f >= 2)
if (tab[f - 2][c] == 'x' && tab[f - 1][c] == 'x') return 1;
if (c <= 1)
if (tab[f][c + 1] == 'x' && tab[f][c + 2] == 'x') return 1;
if (c > 0 && c < 3)
if (tab[f][c - 1] == 'x' && tab[f][c + 1] == 'x') return 1;
if (c >= 2)
if (tab[f][c - 2] == 'x' && tab[f][c - 1] == 'x') return 1;
if (f <= 1 && c <= 1)
if (tab[f + 1][c + 1] == 'x' && tab[f + 2][c + 2] == 'x') return 1;
if (f >= 1 && f <= 2 && c >= 1 && c <= 2)
if (tab[f - 1][c - 1] == 'x' && tab[f + 1][c + 1] == 'x') return 1;
if (f >= 2 && c >= 2)
if (tab[f - 2][c - 2] == 'x' && tab[f - 1][c - 1] == 'x') return 1;
if (f >= 2 && c <= 1)
if (tab[f - 1][c + 1] == 'x' && tab[f - 2][c + 2] == 'x') return 1;
if (f >= 1 && f <= 2 && c >= 1 && c <= 2)
if (tab[f + 1][c - 1] == 'x' && tab[f - 1][c + 1] == 'x') return 1;
if (f <= 1 && c >= 2)
if (tab[f + 1][c - 1] == 'x' && tab[f + 2][c - 2] == 'x') return 1;
return 0;
}
int main() {
char tab[5][5];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> tab[i][j];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (tab[i][j] == '.' && couldw(tab, i, j)) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dc1[] = {1, 1, 1, 0};
int dr1[] = {1, 0, -1, 1};
int dc2[] = {-1, -1, -1, 0};
int dr2[] = {-1, 0, 1, -1};
int main() {
vector<vector<char> > v(4);
char c;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> c;
v[i].push_back(c);
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (v[i][j] == '.') {
for (int k = 0; k < 4; k++) {
if (0 <= i + dr1[k] && i + dr1[k] < 4 && 0 <= i + dr2[k] &&
i + dr2[k] < 4 && 0 <= j + dc1[k] && j + dc1[k] < 4 &&
0 <= j + dc2[k] && j + dc2[k] < 4) {
if (v[i + dr1[k]][j + dc1[k]] == 'x' &&
v[i + dr2[k]][j + dc2[k]] == 'x') {
cout << "YES";
return 0;
}
}
}
}
if (v[i][j] == 'x') {
for (int k = 0; k < 4; k++) {
if (0 <= i + dr1[k] && i + dr1[k] < 4 && 0 <= i + dr2[k] &&
i + dr2[k] < 4 && 0 <= j + dc1[k] && j + dc1[k] < 4 &&
0 <= j + dc2[k] && j + dc2[k] < 4) {
if ((v[i + dr1[k]][j + dc1[k]] == '.' &&
v[i + dr2[k]][j + dc2[k]] == 'x') ||
(v[i + dr1[k]][j + dc1[k]] == 'x' &&
v[i + dr2[k]][j + dc2[k]] == '.')) {
cout << "YES";
return 0;
}
}
}
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
char tic[4][4];
int main() {
int n = 4, flag = 0;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
cin >> tic[i][j];
if (tic[i][j] == 'x') tic[i][j] = 'X';
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (tic[i][j] == 'X') {
if (j - 1 >= 0 && j + 1 < n) {
if ((tic[i][j + 1] == 'X' || tic[i][j - 1] == 'X') &&
tic[i][j + 1] != 'o' && tic[i][j - 1] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i + 1 < n && i - 1 >= 0) {
if ((tic[i + 1][j] == 'X' || tic[i - 1][j] == 'X') &&
tic[i + 1][j] != 'o' && tic[i - 1][j] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i - 2 >= 0) {
if ((tic[i - 1][j] == 'X' || tic[i - 2][j] == 'X') &&
tic[i - 1][j] != 'o' && tic[i - 2][j] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i + 2 < n) {
if ((tic[i + 1][j] == 'X' || tic[i + 2][j] == 'X') &&
tic[i + 1][j] != 'o' && tic[i + 2][j] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (j - 2 >= 0) {
if ((tic[i][j - 1] == 'X' || tic[i][j - 2] == 'X') &&
tic[i][j - 1] != 'o' && tic[i][j - 2] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (j + 2 < 4) {
if ((tic[i][j + 1] == 'X' || tic[i][j + 2] == 'X') &&
tic[i][j + 2] != 'o' && tic[i][j + 1] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (j + 1 < n && i + 1 < n && i - 1 >= 0 && j - 1 >= 0) {
if ((tic[i + 1][j + 1] == 'X' || tic[i - 1][j - 1] == 'X') &&
tic[i - 1][j - 1] != 'o' && tic[i + 1][j + 1] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
if ((tic[i - 1][j + 1] == 'X' || tic[i + 1][j - 1] == 'X') &&
tic[i - 1][j + 1] != 'o' && tic[i + 1][j - 1] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i + 2 < n && j + 2 < n) {
if ((tic[i + 1][j + 1] == 'X' || tic[i + 2][j + 2] == 'X') &&
tic[i + 1][j + 1] != 'o' && tic[i + 2][j + 2] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i - 2 >= 0 && j - 2 >= 0) {
if ((tic[i - 1][j - 1] == 'X' || tic[i - 2][j - 2] == 'X') &&
tic[i - 1][j - 1] != 'o' && tic[i - 2][j - 2] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i - 2 >= 0 && j + 2 < n) {
if ((tic[i - 1][j + 1] == 'X' || tic[i - 2][j + 2] == 'X') &&
tic[i - 1][j + 1] != 'o' && tic[i - 2][j + 2] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
if (i + 2 < n && j - 2 >= 0) {
if ((tic[i + 1][j - 1] == 'X' || tic[i + 2][j - 2] == 'X') &&
tic[i + 1][j - 1] != 'o' && tic[i + 2][j - 2] != 'o') {
cout << "YES\n";
flag = 1;
break;
}
}
}
}
if (flag == 1) break;
}
if (flag == 0) cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char Map[5][5];
int main(void) {
int a, b;
bool flag = false;
for (int i = 0; i < 4; i++) scanf("%s", Map[i]);
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (j + 2 < 4) {
a = b = 0;
for (int k = 0; k < 3; k++)
if (Map[i][j + k] == '.')
a++;
else if (Map[i][j + k] == 'x')
b++;
if (a == 1 && b == 2) flag = true;
}
if (i + 2 < 4) {
a = b = 0;
for (int k = 0; k < 3; k++)
if (Map[i + k][j] == '.')
a++;
else if (Map[i + k][j] == 'x')
b++;
if (a == 1 && b == 2) flag = true;
}
if (j + 2 < 4 && i + 2 < 4) {
a = b = 0;
for (int k = 0; k < 3; k++)
if (Map[i + k][j + k] == '.')
a++;
else if (Map[i + k][j + k] == 'x')
b++;
if (a == 1 && b == 2) flag = true;
}
if (j - 2 >= 0 && i + 2 < 4) {
a = b = 0;
for (int k = 0; k < 3; k++)
if (Map[i + k][j - k] == '.')
a++;
else if (Map[i + k][j - k] == 'x')
b++;
if (a == 1 && b == 2) flag = true;
}
if (flag) break;
}
if (flag)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const int dx[] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dy[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int m[10][10];
int main() {
string s = "";
int i, j;
for (i = 2; i < 6; i++) {
cin >> s;
for (j = 2; j < 6; j++) {
if (s[j - 2] == '.') m[i][j] = -1;
if (s[j - 2] == 'x') m[i][j] = 1;
}
}
for (i = 2; i < 6; i++) {
for (j = 2; j < 6; j++) {
if (m[i][j] == 1) {
for (int k = 0; k < 8; k++) {
if ((m[i + dx[k]][j + dy[k]] == 1 &&
m[i + 2 * dx[k]][j + 2 * dy[k]] == -1) ||
(m[i + dx[k]][j + dy[k]] == -1 &&
m[i + 2 * dx[k]][j + 2 * dy[k]] == 1)) {
cout << "YES";
return 0;
}
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char x[4][4];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> x[i][j];
bool flag = false;
int n = 4;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
int k = 2;
int c = 0;
int c1 = 0;
int r1 = i;
int r2 = j;
while (k) {
r2++;
k--;
}
if (r1 >= n || r2 >= n) continue;
k = 2;
r1 = i;
r2 = j;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
while (k) {
r2++;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
k--;
}
if (c == 2 && c1 == 0) {
flag = true;
break;
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
int k = 2;
int c = 0;
int c1 = 0;
int r1 = i;
int r2 = j;
while (k) {
r1++;
k--;
}
if (r1 >= n || r2 >= n) continue;
k = 2;
r1 = i;
r2 = j;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
while (k) {
r1++;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
k--;
}
if (c == 2 && c1 == 0) {
flag = true;
break;
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
int c = 0;
int c1 = 0;
int k = 2;
int r1 = i;
int r2 = j;
while (k) {
r1++;
r2++;
k--;
}
if (r1 >= 4 || r2 >= 4) continue;
k = 2;
r1 = i;
r2 = j;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
while (k) {
r1++;
r2++;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
k--;
}
if (c == 2 && c1 == 0) {
flag = true;
break;
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
int c = 0;
int c1 = 0;
int k = 2;
int r1 = i;
int r2 = j;
while (k) {
r1++;
r2--;
k--;
}
if (r1 >= 4 || r2 < 0) continue;
k = 2;
r1 = i;
r2 = j;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
while (k) {
r1++;
r2--;
if (x[r1][r2] == 'x') c++;
if (x[r1][r2] == 'o') c1++;
k--;
}
if (c == 2 && c1 == 0) {
flag = true;
break;
}
}
}
if (flag)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a[4];
bool b = 0;
bool visited[4][4];
int dirx[8] = {0, 0, -1, 1, 1, -1, 1, -1};
int diry[8] = {1, -1, 0, 0, 1, -1, -1, 1};
bool valid(int x, int y) { return x < 4 && y < 4 && y > -1 && x > -1; }
void dfs(int x, int y) {
visited[x][y];
for (int i = 0; i < 8; i++) {
int xx = x + dirx[i];
int yy = y + diry[i];
if (valid(xx, yy) && a[xx][yy] == 'x') {
int k = yy + diry[i], t = xx + dirx[i];
if (valid(t, k) && a[t][k] == '.') {
b = 1;
return;
}
k = yy - 2 * diry[i], t = xx - 2 * dirx[i];
if (valid(t, k) && a[t][k] == '.') {
b = 1;
return;
}
} else if (valid(xx, yy) && a[xx][yy] == '.') {
int k = yy + diry[i], t = xx + dirx[i];
if (valid(t, k) && a[t][k] == 'x') {
b = 1;
return;
}
}
}
}
int main() {
for (int i = 0; i < 4; i++) {
cin >> a[i];
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[i][j] == 'x') {
dfs(i, j);
if (b) break;
}
}
}
if (b)
printf("YES");
else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char mat[8][8];
int checklft(int x, int y) {
if (mat[x][y + 1] == 'x' && mat[x][y + 2] == '.') return 1;
if (mat[x][y + 1] == '.' && mat[x][y + 2] == 'x') return 1;
return 0;
}
int checkdn(int x, int y) {
if (mat[x + 1][y] == 'x' && mat[x + 2][y] == '.') return 1;
if (mat[x + 1][y] == '.' && mat[x + 2][y] == 'x') return 1;
return 0;
}
int checkdiag1(int x, int y) {
if (mat[x + 1][y + 1] == 'x' && mat[x + 2][y + 2] == '.') return 1;
if (mat[x + 1][y + 1] == '.' && mat[x + 2][y + 2] == 'x') return 1;
return 0;
}
int checkdiag2(int x, int y) {
if (y - 2 < 0) return 0;
if (mat[x + 1][y - 1] == 'x' && mat[x + 2][y - 2] == '.') return 1;
if (mat[x + 1][y - 1] == '.' && mat[x + 2][y - 2] == 'x') return 1;
if (mat[x + 1][y - 1] == 'x' && mat[x + 2][y - 2] == '.') return 1;
if (mat[x + 1][y - 1] == '.' && mat[x + 2][y - 2] == 'x') return 1;
return 0;
}
int r1[] = {1, 1, 0, -1, -1, -1, 0, 1, 0, -1, -1, -1};
int c1[] = {0, 1, 1, 1, 0, -1, -1, -1, 1, 0, -1, +1};
int r2[] = {2, 2, 0, -2, -2, -2, 0, 2, 0, 1, 1, +1};
int c2[] = {0, 2, 2, 2, 0, -2, -2, -2, -1, 0, 1, -1};
int isval(int x, int y) {
if (x >= 0 && x < 4 && y >= 0 && y < 4) return 1;
return 0;
}
int main() {
for (int k = 0; k < 8; k++) {
for (int l = 0; l < 8; l++) {
mat[k][l] = 'i';
}
}
for (int k = 0; k < 4; k++) {
for (int l = 0; l < 4; l++) {
cin >> mat[k][l];
}
}
for (int k = 0; k < 4; k++) {
for (int l = 0; l < 4; l++) {
if (mat[k][l] == '.') {
for (int m = 0; m < 12; m++) {
int x1 = k + r1[m];
int y1 = l + c1[m];
int x2 = k + r2[m];
int y2 = l + c2[m];
if (isval(x1, y1) && isval(x2, y2)) {
char aa = mat[x1][y1];
char bb = mat[x2][y2];
if (aa == 'x' && bb == 'x') {
cout << "YES" << endl;
return 0;
}
}
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int g[4][4];
int check() {
int i, j, ans = 0;
for (i = 0; i < 2; i++) {
for (j = 0; j < 4; j++)
if (g[i][j] == 1 && g[i + 1][j] == 1 && g[i + 2][j] == 1) {
ans = 1;
return ans;
}
}
for (j = 0; j < 2; j++) {
for (i = 0; i < 4; i++)
if (g[i][j] == 1 && g[i][j + 1] == 1 && g[i][j + 2] == 1) {
ans = 1;
return ans;
}
}
for (i = 0; i < 2; i++) {
for (j = 0; j < 2; j++) {
if (g[i][j] == 1 && g[i + 1][j + 1] == 1 && g[i + 2][j + 2] == 1) {
ans = 1;
return ans;
}
}
}
for (i = 0; i < 2; i++) {
for (j = 2; j < 4; j++) {
if (g[i][j] == 1 && g[i + 1][j - 1] == 1 && g[i + 2][j - 2] == 1) {
ans = 1;
return ans;
}
}
}
return ans;
}
int main() {
char c;
int i, j, flag = 0;
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
scanf("%c", &c);
if (c == 'o')
g[i][j] = 2;
else if (c == 'x')
g[i][j] = 1;
}
getchar();
}
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
if (!g[i][j]) {
g[i][j] = 1;
flag = check();
g[i][j] = 0;
if (flag) {
printf("YES\n");
return 0;
}
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int flag = 0;
char s[6][6];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> s[i][j];
for (int i = 0; i < 4; i++) {
if (flag) break;
for (int j = 0; j < 4; j++) {
if (s[i][j] == 'x' && s[i][j + 1] == 'x' &&
(s[i][j + 2] == '.' || s[i][j - 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i][j + 1] == '.' && s[i][j + 2] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j] == 'x' &&
(s[i + 2][j] == '.' || s[i - 1][j] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j] == '.' && s[i + 2][j] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j + 1] == 'x' &&
(s[i + 2][j + 2] == '.' || s[i - 1][j - 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j + 1] == '.' &&
s[i + 2][j + 2] == 'x') {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j - 1] == 'x' &&
(s[i + 2][j - 2] == '.' || s[i - 1][j + 1] == '.')) {
cout << "YES";
flag = 1;
break;
} else if (s[i][j] == 'x' && s[i + 1][j - 1] == '.' &&
s[i + 2][j - 2] == 'x') {
cout << "YES";
flag = 1;
break;
}
}
}
if (!flag) cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
static int s_board[8][8] = {0};
static const int s_dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};
static const int s_dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};
int main(void) {
memset(s_board, -1, sizeof(s_board));
for (int x = 1; x <= 4; x++) {
for (int y = 1; y <= 4; y++) {
char ch;
cin >> ch;
if (ch == 'x') s_board[x][y] = 1;
if (ch == '.') s_board[x][y] = 0;
}
}
for (int x = 1; x <= 4; x++) {
for (int y = 1; y <= 4; y++) {
for (int d = 0; d < 8; d++) {
if ((s_board[x][y] + s_board[x + s_dx[d]][y + s_dy[d]] +
s_board[x - s_dx[d]][y - s_dy[d]]) >= 2) {
cout << "YES" << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[5][5];
int ok(int u, int v) {
if (u >= 1 && u <= 4 && v >= 1 && v <= 4) {
if (a[u][v] == '.') return 0;
if (a[u][v] == 'x') return 1;
return -10;
}
return -10;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
for (int i = 1; i <= 4; ++i)
for (int j = 1; j <= 4; ++j) cin >> a[i][j];
for (int i = 1; i <= 4; ++i)
for (int j = 1; j <= 4; ++j) {
if (ok(i, j - 1) + ok(i, j - 2) + ok(i, j) >= 2) {
cout << "YES";
return 0;
}
if (ok(i - 1, j) + ok(i - 2, j) + ok(i, j) >= 2) {
cout << "YES";
return 0;
}
if (ok(i - 1, j - 1) + ok(i - 2, j - 2) + ok(i, j) >= 2) {
cout << "YES";
return 0;
}
if (ok(i - 1, j + 1) + ok(i - 2, j + 2) + ok(i, j) >= 2) {
cout << "YES";
return 0;
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
char grid[4][4];
bool is_valid(int i, int j) { return i <= 3 && j <= 3 && grid[i][j] == 'x'; }
bool valid() {
char x = 'x';
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 2; ++j) {
if (grid[i][j] == x && grid[i][j + 1] == x && grid[i][j + 2] == x)
return true;
}
}
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 4; ++j)
if (grid[i][j] == x && grid[i + 1][j] == x && grid[i + 2][j] == x)
return true;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (is_valid(i, j) && is_valid(i + 1, j + 1) && is_valid(i + 2, j + 2))
return true;
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (is_valid(i, j) && is_valid(i - 1, j + 1) && is_valid(i - 2, j + 2))
return true;
}
}
return false;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < 4; ++i)
for (int j = 0; j < 4; ++j) cin >> grid[i][j];
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (grid[i][j] != '.') continue;
grid[i][j] = 'x';
if (valid()) {
cout << "YES";
return 0;
}
grid[i][j] = '.';
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[4][4];
bool found(int m, int n) {
if (m < 2) {
if (n < 2) {
if (a[m][n] == 1 && a[m][n + 1] == 1 && a[m][n + 2] == 1)
return true;
else if (a[m][n] == 1 && a[m + 1][n + 1] == 1 && a[m + 2][n + 2] == 1)
return true;
else if (a[m][n] == 1 && a[m + 1][n] == 1 && a[m + 2][n] == 1)
return true;
} else {
if (a[m][n] == 1 && a[m][n - 1] == 1 && a[m][n - 2] == 1)
return true;
else if (a[m][n] == 1 && a[m + 1][n - 1] == 1 && a[m + 2][n - 2] == 1)
return true;
else if (a[m][n] == 1 && a[m + 1][n] == 1 && a[m + 2][n] == 1)
return true;
}
} else {
if (n < 2) {
if (a[m][n] == 1 && a[m][n + 1] == 1 && a[m][n + 2] == 1)
return true;
else if (a[m][n] == 1 && a[m - 1][n + 1] == 1 && a[m - 2][n + 2] == 1)
return true;
else if (a[m][n] == 1 && a[m - 1][n] == 1 && a[m - 2][n] == 1)
return true;
} else {
if (a[m][n] == 1 && a[m][n - 1] == 1 && a[m][n - 2] == 1)
return true;
else if (a[m][n] == 1 && a[m - 1][n - 1] == 1 && a[m - 2][n - 2] == 1)
return true;
else if (a[m][n] == 1 && a[m - 1][n] == 1 && a[m - 2][n] == 1)
return true;
}
}
return false;
}
bool can(int i, int j) {
a[i][j] = 1;
for (int m = 0; m < 4; m++) {
for (int n = 0; n < 4; n++)
if (found(m, n)) return true;
}
a[i][j] = 0;
return false;
}
int main() {
string s1, s2, s3, s4;
cin >> s1 >> s2 >> s3 >> s4;
for (int i = 0; i < 4; i++) {
if (s1[i] == 'x')
a[0][i] = 1;
else if (s1[i] == '.')
a[0][i] = 0;
else
a[0][i] = -1;
}
for (int i = 0; i < 4; i++) {
if (s2[i] == 'x')
a[1][i] = 1;
else if (s2[i] == '.')
a[1][i] = 0;
else
a[1][i] = -1;
}
for (int i = 0; i < 4; i++) {
if (s3[i] == 'x')
a[2][i] = 1;
else if (s3[i] == '.')
a[2][i] = 0;
else
a[2][i] = -1;
}
for (int i = 0; i < 4; i++) {
if (s4[i] == 'x')
a[3][i] = 1;
else if (s4[i] == '.')
a[3][i] = 0;
else
a[3][i] = -1;
}
bool canwin = false;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[i][j] == 0) {
if (can(i, j)) {
canwin = true;
break;
}
}
}
if (canwin) break;
}
if (canwin)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
bool valid(int x, int y) { return 0 <= x && x < 4 && 0 <= y && y < 4; }
bool win(const vector<string>& s) {
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
for (int d = 0; d < 8; d++) {
bool ok = true;
for (int l = 0; l < 3; l++) {
int x = i + dx[d] * l;
int y = j + dy[d] * l;
if (!valid(x, y) || s[x][y] != 'x') ok = false;
}
if (ok) return true;
}
}
return false;
}
int main() {
vector<string> s(4);
for (int i = 0; i < 4; i++) cin >> s[i];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (s[i][j] == '.') {
s[i][j] = 'x';
if (win(s)) {
cout << "YES" << endl;
return 0;
}
s[i][j] = 'o';
}
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char c[4][4];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
cin >> c[i][j];
}
char ch = 'x';
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if ((i + 2) < 4 && c[i][j] == ch && c[i + 1][j] == ch &&
c[i + 2][j] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((j + 2) < 4 && c[i][j] == ch && c[i][j + 1] == ch &&
c[i][j + 2] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i + 2) < 4 && (j + 2) < 4 && c[i][j] == ch &&
c[i + 1][j + 1] == ch && c[i + 2][j + 2] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i - 2) >= 0 && c[i][j] == ch && c[i - 1][j] == ch &&
c[i - 2][j] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((j - 2) >= 0 && c[i][j] == ch && c[i][j - 1] == ch &&
c[i][j - 2] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i - 2) >= 0 && (j - 2) >= 0 && c[i][j] == ch &&
c[i - 1][j - 1] == ch && c[i - 2][j - 2] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i + 2) < 4 && c[i][j] == ch && c[i + 2][j] == ch &&
c[i + 1][j] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((j + 2) < 4 && c[i][j] == ch && c[i][j + 2] == ch &&
c[i][j + 1] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i + 2) < 4 && (j + 2) < 4 && c[i][j] == ch &&
c[i + 2][j + 2] == ch && c[i + 1][j + 1] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i + 2) < 4 && (j - 2) >= 0 && c[i][j] == ch &&
c[i + 2][j - 2] == ch && c[i + 1][j - 1] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i + 2) < 4 && (j - 2) >= 0 && c[i][j] == ch &&
c[i + 1][j - 1] == ch && c[i + 2][j - 2] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i - 2) >= 0 && (j + 2) < 4 && c[i][j] == ch &&
c[i - 2][j + 2] == ch && c[i - 1][j + 1] == '.') {
flag = 1;
cout << "YES";
break;
}
if ((i - 2) >= 0 && (j + 2) < 4 && c[i][j] == ch &&
c[i - 1][j + 1] == ch && c[i - 2][j + 2] == '.') {
flag = 1;
cout << "YES";
break;
}
}
if (flag == 1) break;
}
if (flag == 0) cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int o = 4;
int main() {
char arr[o][o];
int a = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) cin >> arr[i][j];
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (arr[i][j] == 'x') {
if ((arr[i + 1][j] == 'x' || arr[i + 1][j] == '.') &&
(arr[i + 2][j] == 'x' || arr[i + 2][j] == '.') &&
(arr[i + 1][j] != arr[i + 2][j]) && i + 2 < 4)
a++;
if ((arr[i + 1][j] == 'x' || arr[i + 1][j] == '.') &&
(arr[i - 1][j] == 'x' || arr[i - 1][j] == '.') &&
(arr[i + 1][j] != arr[i - 1][j]) && i > 0 && i < 3)
a++;
if ((arr[i - 1][j] == 'x' || arr[i - 1][j] == '.') &&
(arr[i - 2][j] == 'x' || arr[i - 2][j] == '.') &&
(arr[i - 1][j] != arr[i - 2][j]) && i > 1)
a++;
if ((arr[i][j + 1] == 'x' || arr[i][j + 1] == '.') &&
(arr[i][j + 2] == 'x' || arr[i][j + 2] == '.') &&
(arr[i][j + 1] != arr[i][j + 2]) && j + 2 < 4)
a++;
if ((arr[i][j + 1] == 'x' || arr[i][j + 1] == '.') &&
(arr[i][j - 1] == 'x' || arr[i][j - 1] == '.') &&
(arr[i][j + 1] != arr[i][j - 1]) && j > 0 && j < 3)
a++;
if ((arr[i][j - 1] == 'x' || arr[i][j - 1] == '.') &&
(arr[i][j - 2] == 'x' || arr[i][j - 2] == '.') &&
(arr[i][j - 1] != arr[i][j - 2]) && j > 1)
a++;
if ((arr[i + 1][j + 1] == 'x' || arr[i + 1][j + 1] == '.') &&
(arr[i + 2][j + 2] == 'x' || arr[i + 2][j + 2] == '.') &&
(arr[i + 1][j + 1] != arr[i + 2][j + 2]) && i + 2 < 4 && j + 2 < 4)
a++;
if ((arr[i + 1][j + 1] == 'x' || arr[i + 1][j + 1] == '.') &&
(arr[i - 1][j - 1] == 'x' || arr[i - 1][j - 1] == '.') &&
(arr[i + 1][j + 1] != arr[i - 1][j - 1]) && i > 0 && j > 0 &&
i < 3 && j < 3)
a++;
if ((arr[i - 1][j - 1] == 'x' || arr[i - 1][j - 1] == '.') &&
(arr[i - 2][j - 2] == 'x' || arr[i - 2][j - 2] == '.') &&
(arr[i - 1][j - 1] != arr[i - 2][j - 2]) && i > 1 && j > 1)
a++;
if ((arr[i + 1][j - 1] == 'x' || arr[i + 1][j - 1] == '.') &&
(arr[i + 2][j - 2] == 'x' || arr[i + 2][j - 2] == '.') &&
(arr[i + 1][j - 1] != arr[i + 2][j - 2]) && i + 2 < 4 && j > 1)
a++;
if ((arr[i + 1][j - 1] == 'x' || arr[i + 1][j - 1] == '.') &&
(arr[i - 1][j + 1] == 'x' || arr[i - 1][j + 1] == '.') &&
(arr[i + 1][j - 1] != arr[i - 1][j + 1]) && i + 1 < 4 && i > 0 &&
j + 1 < 4 && j > 0)
a++;
if ((arr[i - 2][j + 2] == 'x' || arr[i - 2][j + 2] == '.') &&
(arr[i - 1][j + 1] == 'x' || arr[i - 1][j + 1] == '.') &&
(arr[i - 2][j + 2] != arr[i - 1][j + 1]) && i - 2 >= 0 && j + 2 < 4)
a++;
}
}
}
if (a > 0)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[8][8];
bool flag = false;
void init() {
for (int i = 0; i <= 7; i++)
for (int j = 0; j <= 7; j++) a[i][j] = 0;
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) cin >> a[i][j];
}
void work() {
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
if (a[i][j] == '.' || a[i][j] == 'x') {
if (a[i - 1][j - 1] == 'x' && a[i - 2][j - 2] == 'x') flag = true;
if (a[i][j - 1] == 'x' && a[i][j - 2] == 'x') flag = true;
if (a[i + 1][j - 1] == 'x' && a[i + 2][j - 2] == 'x') flag = true;
if (a[i - 1][j] == 'x' && a[i - 2][j] == 'x') flag = true;
if (a[i + 1][j] == 'x' && a[i + 2][j] == 'x') flag = true;
if (a[i - 1][j + 1] == 'x' && a[i - 2][j + 2] == 'x') flag = true;
if (a[i][j + 1] == 'x' && a[i][j + 2] == 'x') flag = true;
if (a[i + 1][j + 1] == 'x' && a[i + 2][j + 2] == 'x') flag = true;
if (a[i - 1][j - 1] == 'x' && a[i + 1][j + 1] == 'x') flag = true;
if (a[i][j - 1] == 'x' && a[i][j + 1] == 'x') flag = true;
if (a[i - 1][j] == 'x' && a[i + 1][j] == 'x') flag = true;
if (a[i + 1][j - 1] == 'x' && a[i - 1][j + 1] == 'x') flag = true;
}
if (flag == true) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
}
int main() {
init();
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int MOD = 1000 * 1000 * 1000 + 7;
const int INF = 2000 * 1000 * 1000;
int main() {
char a[7][7];
long long n, i, j;
for (i = 1; i <= (4); i++) {
for (j = 1; j <= (4); j++) {
cin >> a[i][j];
}
}
for (i = 0; i < (6); i++) {
a[i][0] = 'o';
a[0][i] = 'o';
a[5][i] = 'o';
a[i][5] = 'o';
}
for (i = 1; i < 5; i++) {
for (j = 1; j < 5; j++) {
if (a[i][j] == 'x') {
if ((a[i - 1][j - 1] != 'o' && a[i + 1][j + 1] != 'o') &&
(a[i - 1][j - 1] == 'x' || a[i + 1][j + 1] == 'x')) {
cout << "YES\n";
return 0;
}
if ((a[i][j - 1] != 'o' && a[i][j + 1] != 'o') &&
(a[i][j - 1] == 'x' || a[i][j + 1] == 'x')) {
cout << "YES\n";
return 0;
}
if ((a[i - 1][j] != 'o' && a[i + 1][j] != 'o') &&
(a[i - 1][j] == 'x' || a[i + 1][j] == 'x')) {
cout << "YES\n";
return 0;
}
if ((a[i - 1][j + 1] != 'o' && a[i + 1][j - 1] != 'o') &&
(a[i - 1][j + 1] == 'x' || a[i + 1][j - 1] == 'x')) {
cout << "YES\n";
return 0;
}
}
if (a[i][j] == '.') {
if (a[i - 1][j - 1] == 'x' && a[i + 1][j + 1] == 'x') {
cout << "YES\n";
return 0;
}
if (a[i][j - 1] == 'x' && a[i][j + 1] == 'x') {
cout << "YES\n";
return 0;
}
if (a[i - 1][j] == 'x' && a[i + 1][j] == 'x') {
cout << "YES\n";
return 0;
}
if (a[i - 1][j + 1] == 'x' && a[i + 1][j - 1] == 'x') {
cout << "YES\n";
return 0;
}
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char ch[4][4];
int pic[4][4];
int cal() {
int i, j;
for (i = 0; i < 4; i++) {
for (j = 0; j <= 1; j++) {
if (ch[i][j] == 'x' && ch[i][j + 1] == 'x' && ch[i][j + 2] == 'x') {
return 1;
}
}
}
for (j = 0; j <= 1; j++) {
for (i = 0; i < 4; i++) {
if (ch[j][i] == 'x' && ch[j + 1][i] == 'x' && ch[j + 2][i] == 'x') {
return 1;
}
}
}
for (i = 0; i <= 1; i++) {
for (j = 0; j <= 1; j++) {
if (ch[i][j] == 'x' && ch[i + 1][j + 1] == 'x' &&
ch[i + 2][j + 2] == 'x') {
return 1;
}
}
}
for (i = 0; i <= 1; i++) {
for (j = 2; j < 4; j++) {
if (ch[i][j] == 'x' && ch[i + 1][j - 1] == 'x' &&
ch[i + 2][j - 2] == 'x') {
return 1;
}
}
}
return 0;
}
int main() {
for (int i = 0; i < 4; i++) cin >> ch[i];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (ch[i][j] == '.') {
ch[i][j] = 'x';
if (cal() == 1) {
cout << "Yes" << endl;
return 0;
}
ch[i][j] = '.';
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[8][8];
bool check(int i1, int j1, int i2, int j2) {
if (i1 >= 0 && j1 >= 0 && i2 >= 0 && j2 >= 0 && i1 < 4 && j1 < 4 && i2 < 4 &&
j2 < 4) {
if (a[i1][j1] == 1 && a[i2][j2] == 1) return true;
}
return false;
}
int main() {
int t, n, m, x, y;
char s[8];
memset(a, 0, sizeof(a));
for (int i = 0; i < 4; ++i) {
scanf("%s", s);
for (int j = 0; j < 4; ++j) {
if (s[j] == 'x') a[i][j] = 1;
if (s[j] == 'o') a[i][j] = 2;
}
}
bool ans = false;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (a[i][j] == 0) {
if (check(i - 1, j, i + 1, j)) ans = true;
if (check(i - 1, j, i - 2, j)) ans = true;
if (check(i + 1, j, i + 2, j)) ans = true;
if (check(i, j - 1, i, j + 1)) ans = true;
if (check(i, j - 1, i, j - 2)) ans = true;
if (check(i, j + 1, i, j + 2)) ans = true;
if (check(i - 1, j - 1, i + 1, j + 1)) ans = true;
if (check(i - 1, j - 1, i - 2, j - 2)) ans = true;
if (check(i + 1, j + 1, i + 2, j + 2)) ans = true;
if (check(i - 1, j + 1, i + 1, j - 1)) ans = true;
if (check(i - 1, j + 1, i - 2, j + 2)) ans = true;
if (check(i + 1, j - 1, i + 2, j - 2)) ans = true;
}
}
}
printf(ans ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n, i, j, k, t;
string s[4];
cin >> s[0] >> s[1] >> s[2] >> s[3];
for (i = 0; i < 4; i++) {
for (j = 0; j < 2; j++) {
if (s[i][j] == 'x' && s[i][j + 1] == 'x' && s[i][j + 2] == '.') {
cout << "YES";
return 0;
}
if (s[i][j] == 'x' && s[i][j + 1] == '.' && s[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (s[i][j] == '.' && s[i][j + 1] == 'x' && s[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
}
for (i = 0; i < 2; i++) {
for (j = 0; j < 4; j++) {
if (s[i][j] == 'x' && s[i + 1][j] == 'x' && s[i + 2][j] == '.') {
cout << "YES";
return 0;
}
if (s[i][j] == 'x' && s[i + 1][j] == '.' && s[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (s[i][j] == '.' && s[i + 1][j] == 'x' && s[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
}
}
for (i = 0; i < 2; i++) {
for (j = 0; j < 2; j++) {
if (s[i][j] == 'x' && s[i + 1][j + 1] == 'x' && s[i + 2][j + 2] == '.') {
cout << "YES";
return 0;
}
if (s[i][j] == 'x' && s[i + 1][j + 1] == '.' && s[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (s[i][j] == '.' && s[i + 1][j + 1] == 'x' && s[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
}
for (i = 0; i < 2; i++) {
for (j = 2; j < 4; j++) {
if (s[i][j] == 'x' && s[i + 1][j - 1] == 'x' && s[i + 2][j - 2] == '.') {
cout << "YES";
return 0;
}
if (s[i][j] == 'x' && s[i + 1][j - 1] == '.' && s[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (s[i][j] == '.' && s[i + 1][j - 1] == 'x' && s[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a[6][6], i, j, k;
int dx[4] = {-1, 0, 1, -1}, dy[4] = {-1, -1, -1, 0};
char x;
memset(a, -1, sizeof(a));
for (i = 1; i < 5; i++) {
for (j = 1; j < 5; j++) {
x = getchar();
if (x == 'x') a[i][j] = 1;
if (x == '.') a[i][j] = 0;
}
getchar();
}
for (i = 1; i < 5; i++) {
for (j = 1; j < 5; j++) {
for (k = 0; k < 4; k++)
if (a[i][j] + a[i + dx[k]][j + dy[k]] + a[i - dx[k]][j - dy[k]] > 1) {
printf("YES\n");
return 0;
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long maxn = 3e6;
const long long mod = 1e9 + 7;
const long double PI = acos((long double)-1);
long long pw(long long a, long long b, long long md = mod) {
long long res = 1;
while (b) {
if (b & 1) {
res = (a * res) % md;
}
a = (a * a) % md;
b >>= 1;
}
return (res);
}
string s[4];
bool hor(int x, int y) {
if (x < 1 or x > 2) return (0);
int cnt = 0;
if (s[x][y] == 'o') return (0);
if (s[x][y] == '.') cnt++;
if (s[x - 1][y] == 'o') return (0);
if (s[x - 1][y] == '.') cnt++;
if (s[x + 1][y] == 'o') return (0);
if (s[x + 1][y] == '.') cnt++;
return (cnt < 2);
}
bool ver(int x, int y) {
if (y < 1 or y > 2) return (0);
int cnt = 0;
if (s[x][y] == 'o') return (0);
if (s[x][y] == '.') cnt++;
if (s[x][y - 1] == 'o') return (0);
if (s[x][y - 1] == '.') cnt++;
if (s[x][y + 1] == 'o') return (0);
if (s[x][y + 1] == '.') cnt++;
return (cnt < 2);
}
bool dia(int x, int y) {
int cnt = 0;
if (x < 1 or x > 2) return (0);
if (y < 1 or y > 2) return (0);
if (s[x][y] == 'o') return (0);
if (s[x][y] == '.') cnt++;
if (s[x - 1][y - 1] == 'o') return (0);
if (s[x - 1][y - 1] == '.') cnt++;
if (s[x + 1][y + 1] == 'o') return (0);
if (s[x + 1][y + 1] == '.') cnt++;
return (cnt < 2);
}
bool diag(int x, int y) {
int cnt = 0;
if (x < 1 or x > 2) return (0);
if (y < 1 or y > 2) return (0);
if (s[x][y] == 'o') return (0);
if (s[x][y] == '.') cnt++;
if (s[x - 1][y + 1] == 'o') return (0);
if (s[x - 1][y + 1] == '.') cnt++;
if (s[x + 1][y - 1] == 'o') return (0);
if (s[x + 1][y - 1] == '.') cnt++;
return (cnt < 2);
}
bool chk(int x, int y) {
if (ver(x, y)) return (1);
if (hor(x, y)) return (1);
if (dia(x, y)) return (1);
if (diag(x, y)) return (1);
return (0);
}
int32_t main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
for (int i = 0; i < 4; i++) cin >> s[i];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (chk(i, j)) cout << "YES", exit(0);
cout << "NO";
return (0);
}
|
#include <bits/stdc++.h>
char s[10][10];
int dx[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
bool win(int x, int y) {
for (int i = 0; i < 4; i++) {
if (s[x + dx[i]][y + dy[i]] == 'x' && s[x - dx[i]][y - dy[i]] == 'x') {
return true;
}
}
for (int i = 0; i < 8; i++) {
if (s[x + dx[i]][y + dy[i]] == 'x' &&
s[x + 2 * dx[i]][y + 2 * dy[i]] == 'x') {
return true;
}
}
return false;
}
int main() {
for (int i = 2; i <= 5; i++) {
scanf("%s", s[i] + 2);
}
for (int i = 2; i <= 5; i++) {
for (int j = 2; j <= 5; j++) {
if (s[i][j] == '.') {
if (win(i, j)) {
puts("YES");
return 0;
}
}
}
}
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const int fx[4][2] = {{1, 1}, {1, 0}, {1, -1}, {0, 1}};
int grid[4][4];
void init() {
int i, j;
char c;
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
c = getchar();
if (c == 'x')
grid[i][j] = 1;
else if (c == 'o')
grid[i][j] = -1;
else
grid[i][j] = 0;
}
c = getchar();
}
}
bool check(int x, int y) {
int cnt, i, j, c;
grid[x][y] = 1;
for (c = 0; c < 4; c++) {
cnt = -1;
for (i = x, j = y; i >= 0 && i < 4 && j >= 0 && j < 4;
i += fx[c][0], j += fx[c][1]) {
if (grid[i][j] != 1) break;
cnt++;
}
for (i = x, j = y; i >= 0 && i < 4 && j >= 0 && j < 4;
i -= fx[c][0], j -= fx[c][1]) {
if (grid[i][j] != 1) break;
cnt++;
}
if (cnt >= 3) {
return 1;
}
}
grid[x][y] = 0;
return 0;
}
void tr() {
int i, j;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
if (grid[i][j] == 0)
if (check(i, j)) {
puts("YES");
return;
}
puts("NO");
return;
}
int main() {
init();
tr();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[20][20];
bool horizontal(int m, int n) {
if ((a[m][n + 1] == 'x' && a[m][n + 2] == 'x') ||
(a[m][n + 1] == 'x' && a[m][n - 1] == 'x') ||
(a[m][n - 1] == 'x' && a[m][n - 2] == 'x'))
return true;
return false;
}
bool vertical(int m, int n) {
if ((a[m + 1][n] == 'x' && a[m + 2][n] == 'x') ||
(a[m + 1][n] == 'x' && a[m - 1][n] == 'x') ||
(a[m - 1][n] == 'x' && a[m - 2][n] == 'x'))
return true;
return false;
}
bool diagonal(int m, int n) {
if ((a[m - 1][n - 1] == 'x' && a[m + 1][n + 1] == 'x') ||
(a[m + 1][n + 1] == 'x' && a[m + 2][n + 2] == 'x') ||
(a[m - 1][n - 1] == 'x' && a[m - 2][n - 2] == 'x'))
return true;
if ((a[m - 1][n + 1] == 'x' && a[m + 1][n - 1] == 'x') ||
(a[m - 1][n + 1] == 'x' && a[m - 2][n + 2] == 'x') ||
(a[m + 1][n - 1] == 'x' && a[m + 2][n - 2] == 'x'))
return true;
return false;
}
int main() {
bool flag = false;
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 20; j++) {
a[i][j] = '-';
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> a[i + 5][j + 5];
}
}
for (int i = 5; i < 9; i++) {
for (int j = 5; j < 9; j++) {
if (a[i][j] == '.') {
if (horizontal(i, j) || vertical(i, j) || diagonal(i, j)) {
cout << "YES" << endl;
flag = true;
break;
}
}
}
if (flag) break;
}
if (!flag) cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MXN = 100005;
int dx[4] = {-1, 0, 0, 1};
int dy[4] = {0, -1, 1, 0};
int dxx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dyy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
long long mo(long long x) {
if (x < 0) return -x;
return x;
}
char ch[5][5];
int chld(int x, int y) {
if (x >= 2 || y < 2) return 0;
if (ch[x][y] == ch[x + 1][y - 1] && ch[x][y] == ch[x + 2][y - 2]) return 1;
return 0;
}
int chrd(int x, int y) {
if (x >= 2 || y >= 2) return 0;
if (ch[x][y] == ch[x + 1][y + 1] && ch[x][y] == ch[x + 2][y + 2]) return 1;
return 0;
}
int chrw(int x, int y) {
if (y >= 2) return 0;
if (ch[x][y] == ch[x][y + 1] && ch[x][y] == ch[x][y + 2]) return 1;
return 0;
}
int chcl(int x, int y) {
if (x >= 2) return 0;
if (ch[x][y] == ch[x + 1][y] && ch[x][y] == ch[x + 2][y]) return 1;
return 0;
}
int check() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++)
if (ch[i][j] == 'x') {
if (chld(i, j) || chrd(i, j) || chrw(i, j) || chcl(i, j)) {
return 1;
}
}
}
return 0;
}
int main() {
for (int i = 0; i < 4; i++) {
scanf("%s", ch[i]);
}
int w = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (ch[i][j] == '.') {
ch[i][j] = 'x';
w = check();
if (w) {
break;
}
ch[i][j] = '.';
}
}
if (w) break;
}
if (w)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[6][6];
char tl[2] = {'x', 'o'};
int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool judge(int x, int y, int nu) {
for (int i = 0; i < 8; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
if (a[xx][yy] == tl[nu]) {
xx = x - dx[i];
yy = y - dy[i];
if (a[xx][yy] == '.') return true;
}
if (a[xx][yy] == '.') {
xx = xx + dx[i];
yy = yy + dy[i];
if (a[xx][yy] == tl[nu]) return true;
}
}
return false;
}
void solve() {
int num1 = 0, num2 = 0;
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
cin >> a[i][j];
if (a[i][j] == 'x') num1++;
if (a[i][j] == 'o') num2++;
}
for (int i = 0; i < 6; i++) a[i][0] = a[0][i] = a[6][i] = a[i][6] = '*';
int be = 0;
if (num2 < num1) be = 1;
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
if (a[i][j] == tl[be] && judge(i, j, be)) {
cout << "YES" << endl;
return;
}
}
cout << "NO" << endl;
return;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char site[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> site[i][j];
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (site[i][j] == 'x') {
if (j - 2 >= 0) {
if (site[i][j - 2] == '.' && site[i][j - 1] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i][j - 2] == 'x' && site[i][j - 1] == '.') {
cout << "YES" << endl;
return 0;
}
}
if (j + 2 < 4) {
if (site[i][j + 2] == '.' && site[i][j + 1] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i][j + 2] == 'x' && site[i][j + 1] == '.') {
cout << "YES" << endl;
return 0;
}
}
if (i - 2 >= 0) {
if (site[i - 2][j] == '.' && site[i - 1][j] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i - 2][j] == 'x' && site[i - 1][j] == '.') {
cout << "YES" << endl;
return 0;
}
}
if (i + 2 < 4) {
if (site[i + 2][j] == '.' && site[i + 1][j] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i + 2][j] == 'x' && site[i + 1][j] == '.') {
cout << "YES" << endl;
return 0;
}
}
if (i < 2) {
if (j < 2) {
if (site[i + 1][j + 1] == '.' && site[i + 2][j + 2] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i + 1][j + 1] == 'x' && site[i + 2][j + 2] == '.') {
cout << "YES" << endl;
return 0;
}
} else {
if (site[i + 1][j - 1] == '.' && site[i + 2][j - 2] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i + 1][j - 1] == 'x' && site[i + 2][j - 2] == '.') {
cout << "YES" << endl;
return 0;
}
}
} else {
if (j < 2) {
if (site[i - 1][j + 1] == '.' && site[i - 2][j + 2] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i - 1][j + 1] == 'x' && site[i - 2][j + 2] == '.') {
cout << "YES" << endl;
return 0;
}
} else {
if (site[i - 1][j - 1] == '.' && site[i - 2][j - 2] == 'x') {
cout << "YES" << endl;
return 0;
}
if (site[i - 1][j - 1] == 'x' && site[i - 2][j - 2] == '.') {
cout << "YES" << endl;
return 0;
}
}
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mpow(long long int exp, long long int base);
void aeh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
}
int32_t main() {
aeh();
char a[4][4];
for (long long int i = 0; i < 4; i++) {
for (long long int j = 0; j < 4; j++) {
cin >> a[i][j];
}
}
string ans = "NO";
for (long long int i = 0; i < 4; i++) {
for (long long int j = 0; j < 2; j++) {
vector<char> b;
for (long long int k = 0; k < 3; k++) {
b.push_back(a[i][j + k]);
}
sort((b).begin(), (b).end());
long long int x = 0, z = 0;
for (long long int k = 0; k < 3; k++) {
if (b[k] == 'x')
x++;
else if (b[k] == 'o')
z++;
}
if (x == 2 && z == 0) {
ans = "YES";
i = 4;
break;
}
}
}
for (long long int i = 0; i < 2; i++) {
for (long long int j = 0; j < 4; j++) {
vector<char> b;
for (long long int k = 0; k < 3; k++) {
b.push_back(a[i + k][j]);
}
sort((b).begin(), (b).end());
long long int x = 0, z = 0;
for (long long int k = 0; k < 3; k++) {
if (b[k] == 'x')
x++;
else if (b[k] == 'o')
z++;
}
if (x == 2 && z == 0) {
ans = "YES";
i = 4;
break;
}
}
}
for (long long int i = 0; i < 2; i++) {
for (long long int j = 0; j < 2; j++) {
vector<char> b;
for (long long int k = 0; k < 3; k++) {
b.push_back(a[i + k][j + k]);
}
sort((b).begin(), (b).end());
long long int x = 0, z = 0;
for (long long int k = 0; k < 3; k++) {
if (b[k] == 'x')
x++;
else if (b[k] == 'o')
z++;
}
if (x == 2 && z == 0) {
ans = "YES";
i = 4;
break;
}
}
}
for (long long int i = 0; i < 2; i++) {
for (long long int j = 2; j < 4; j++) {
vector<char> b;
for (long long int k = 0; k < 3; k++) {
b.push_back(a[i + k][j - k]);
}
sort((b).begin(), (b).end());
long long int x = 0, z = 0;
for (long long int k = 0; k < 3; k++) {
if (b[k] == 'x')
x++;
else if (b[k] == 'o')
z++;
}
if (x == 2 && z == 0) {
ans = "YES";
i = 4;
break;
}
}
}
cout << ans << endl;
}
long long int mpow(long long int base, long long int exp) {
base %= 1000000007;
long long int result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % 1000000007;
base = (base * base) % 1000000007;
exp >>= 1;
}
return result;
}
|
#include <bits/stdc++.h>
using namespace std;
int t[4][4];
int check(int i, int j) {
if (i + 1 < 4 && i + 2 < 4 && t[i + 1][j] == 1 && t[i + 2][j] == 0) return 1;
if (i + 1 < 4 && i + 2 < 4 && t[i + 1][j] == 0 && t[i + 2][j] == 1) return 1;
if (i - 1 >= 0 && i - 2 >= 0 && t[i - 1][j] == 1 && t[i - 2][j] == 0)
return 1;
if (i - 1 >= 0 && i - 2 >= 0 && t[i - 1][j] == 0 && t[i - 2][j] == 1)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && t[i][j - 1] == 1 && t[i][j - 2] == 0)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && t[i][j - 1] == 0 && t[i][j - 2] == 1)
return 1;
if (j + 1 < 4 && j + 2 < 4 && t[i][j + 1] == 1 && t[i][j + 2] == 0) return 1;
if (j + 1 < 4 && j + 2 < 4 && t[i][j + 1] == 0 && t[i][j + 2] == 1) return 1;
if (j + 1 < 4 && j + 2 < 4 && i + 1 < 4 && i + 2 < 4 &&
t[i + 1][j + 1] == 1 && t[i + 2][j + 2] == 0)
return 1;
if (j + 1 < 4 && j + 2 < 4 && i + 1 < 4 && i + 2 < 4 &&
t[i + 1][j + 1] == 0 && t[i + 2][j + 2] == 1)
return 1;
if (j + 1 < 4 && j + 2 < 4 && i - 1 >= 0 && i - 2 >= 0 &&
t[i - 1][j + 1] == 1 && t[i - 2][j + 2] == 0)
return 1;
if (j + 1 < 4 && j + 2 < 4 && i - 1 >= 0 && i - 2 >= 0 &&
t[i - 1][j + 1] == 0 && t[i - 2][j + 2] == 1)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && i - 1 >= 0 && i - 2 >= 0 &&
t[i - 1][j - 1] == 1 && t[i - 2][j - 2] == 0)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && i - 1 >= 0 && i - 2 >= 0 &&
t[i - 1][j - 1] == 0 && t[i - 2][j - 2] == 1)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && i + 1 < 4 && i + 2 < 4 &&
t[i + 1][j - 1] == 1 && t[i + 2][j - 2] == 0)
return 1;
if (j - 1 >= 0 && j - 2 >= 0 && i + 1 < 4 && i + 2 < 4 &&
t[i + 1][j - 1] == 0 && t[i + 2][j - 2] == 1)
return 1;
return -1;
}
int main() {
char cl;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
char c;
scanf("%c", &c);
if (c == '.') t[i][j] = 0;
if (c == 'x') t[i][j] = 1;
if (c == 'o') t[i][j] = -1;
}
scanf("%c", &cl);
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (t[i][j] == 1)
if (check(i, j) == 1) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool d;
int n;
char c[10][10];
int main() {
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) cin >> c[i][j];
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
if (c[i][j] == '.' and c[i][j - 1] == 'x' and c[i][j + 1] == 'x') d = 1;
if (c[i][j] == '.' and c[i][j - 1] == 'x' and c[i][j - 2] == 'x') d = 1;
if (c[i][j] == '.' and c[i][j + 1] == 'x' and c[i][j + 2] == 'x') d = 1;
if (c[i][j] == '.' and c[i - 1][j] == 'x' and c[i - 2][j] == 'x') d = 1;
if (c[i][j] == '.' and c[i + 1][j] == 'x' and c[i + 2][j] == 'x') d = 1;
if (c[i][j] == '.' and c[i - 1][j] == 'x' and c[i + 1][j] == 'x') d = 1;
if (c[i][j] == '.' and c[i + 1][j + 1] == 'x' and c[i + 2][j + 2] == 'x')
d = 1;
if (c[i][j] == '.' and c[i - 1][j - 1] == 'x' and c[i + 1][j + 1] == 'x')
d = 1;
if (c[i][j] == '.' and c[i - 1][j - 1] == 'x' and c[i - 2][j - 2] == 'x')
d = 1;
if (c[i][j] == '.' and c[i + 1][j - 1] == 'x' and c[i + 2][j - 2] == 'x')
d = 1;
if (c[i][j] == '.' and c[i - 1][j + 1] == 'x' and c[i + 1][j - 1] == 'x')
d = 1;
if (c[i][j] == '.' and c[i - 1][j + 1] == 'x' and c[i - 2][j + 2] == 'x')
d = 1;
}
if (d == 1)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
char a[4][4];
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> a[i][j];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (a[i][j] == '.') {
if (i < 2 && a[i + 1][j] == 'x' && a[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (i > 1 && a[i - 1][j] == 'x' && a[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (j < 2 && a[i][j + 1] == 'x' && a[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (j > 1 && a[i][j - 1] == 'x' && a[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (i < 2 && j < 2 && a[i + 1][j + 1] == 'x' &&
a[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (i > 1 && j < 2 && a[i - 1][j + 1] == 'x' &&
a[i - 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (i < 2 && j > 1 && a[i + 1][j - 1] == 'x' &&
a[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (i > 1 && j > 1 && a[i - 1][j - 1] == 'x' &&
a[i - 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (i > 0 && i < 3 && a[i - 1][j] == 'x' && a[i + 1][j] == 'x') {
cout << "YES";
return 0;
}
if (j > 0 && j < 3 && a[i][j - 1] == 'x' && a[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (i > 0 && j > 0 && i < 3 && j < 3 &&
((a[i - 1][j - 1] == 'x' && a[i + 1][j + 1] == 'x') ||
(a[i - 1][j + 1] == 'x' && a[i + 1][j - 1] == 'x'))) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const N = 200 * 1000 + 16;
int n = 4;
int a[16][16];
char g[16][16];
int alpha[256];
void live() {
puts("YES");
exit(0);
}
bool chk_row(int i) {
return (a[i][0] + a[i][1] + a[i][2] == 2) ||
(a[i][1] + a[i][2] + a[i][3] == 2);
}
bool chk_col(int i) {
return (a[0][i] + a[1][i] + a[2][i] == 2) ||
(a[1][i] + a[2][i] + a[3][i] == 2);
}
bool chk_diag(int i, int j) {
if (1 < i || 1 < j) return false;
return (a[i][j] + a[i + 1][j + 1] + a[i + 2][j + 2] == 2);
}
bool chk_diag2(int i, int j) {
if (1 < i || j < 2) return false;
return (a[i][j] + a[i + 1][j - 1] + a[i + 2][j - 2] == 2);
}
int main() {
alpha['.'] = 0;
alpha['x'] = 1;
alpha['o'] = -1024;
for (int i = 0; i < 4; ++i) {
scanf(" %s", g + i);
for (int j = 0; j < 4; ++j) a[i][j] = alpha[g[i][j]];
}
for (int i = 0; i < 4; ++i)
if (chk_row(i) || chk_col(i)) live();
for (int i = 0; i < 4; ++i)
for (int j = 0; j < 4; ++j)
if (chk_diag(i, j) || chk_diag2(i, j)) live();
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
char matrix[4][4];
int result = 1, i, j;
void printYES() { cout << "YES"; }
void printNO() { cout << "NO"; }
void initializationAfterYES() {
i = 4;
j = 4;
}
void checkForThreeConsecutiveXs() {
int a = i, b = j;
if ((a == 0 && b == 0) || (a == 0 && b == 1) || (a == 1 && b == 0) ||
(a == 1 && b == 1)) {
if ((matrix[a + 1][b] == 'x' && matrix[a + 2][b] == '.') ||
(matrix[a + 1][b] == '.' && matrix[a + 2][b] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a][b + 1] == 'x' && matrix[a][b + 2] == '.') ||
(matrix[a][b + 1] == '.' && matrix[a][b + 2] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a + 1][b + 1] == 'x' && matrix[a + 2][b + 2] == '.') ||
(matrix[a + 1][b + 1] == '.' && matrix[a + 2][b + 2] == 'x')) {
printYES();
initializationAfterYES();
} else
result = 0;
} else if ((a == 0 && b == 2) || (a == 0 && b == 3) || (a == 1 && b == 2) ||
(a == 1 && b == 3)) {
if ((matrix[a + 1][b] == 'x' && matrix[a + 2][b] == '.') ||
(matrix[a + 1][b] == '.' && matrix[a + 2][b] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a][b - 1] == 'x' && matrix[a][b - 2] == '.') ||
(matrix[a][b - 1] == '.' && matrix[a][b - 2] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a + 1][b - 1] == 'x' && matrix[a + 2][b - 2] == '.') ||
(matrix[a + 1][b - 1] == '.' && matrix[a + 2][b - 2] == 'x')) {
printYES();
initializationAfterYES();
} else
result = 0;
} else if ((a == 2 && b == 0) || (a == 2 && b == 1) || (a == 3 && b == 0) ||
(a == 3 && b == 1)) {
if ((matrix[a - 1][b] == 'x' && matrix[a - 2][b] == '.') ||
(matrix[a - 1][b] == '.' && matrix[a - 2][b] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a][b + 1] == 'x' && matrix[a][b + 2] == '.') ||
(matrix[a][b + 1] == '.' && matrix[a][b + 2] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a - 1][b + 1] == 'x' && matrix[a - 2][b + 2] == '.') ||
(matrix[a - 1][b + 1] == '.' && matrix[a - 2][b + 2] == 'x')) {
printYES();
initializationAfterYES();
} else
result = 0;
} else if ((a == 2 && b == 2) || (a == 2 && b == 3) || (a == 3 && b == 2) ||
(a == 3 && b == 3)) {
if ((matrix[a - 1][b] == 'x' && matrix[a - 2][b] == '.') ||
(matrix[a - 1][b] == '.' && matrix[a - 2][b] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a][b - 1] == 'x' && matrix[a][b - 2] == '.') ||
(matrix[a][b - 1] == '.' && matrix[a][b - 2] == 'x')) {
printYES();
initializationAfterYES();
} else if ((matrix[a - 1][b - 1] == 'x' && matrix[a - 2][b - 2] == '.') ||
(matrix[a - 1][b - 1] == '.' && matrix[a - 2][b - 2] == 'x')) {
printYES();
initializationAfterYES();
} else
result = 0;
}
}
int main(void) {
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
cin >> matrix[i][j];
}
}
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
if (matrix[i][j] == 'x') {
result = 1;
checkForThreeConsecutiveXs();
}
if (result == 0) printNO();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[8][8];
for (int i = 1; i <= 5; i++) {
a[5][i] = 100;
a[i][5] = 100;
a[0][i] = 100;
a[i][0] = 100;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
cin >> a[i][j];
if (a[i][j] == 'x') a[i][j] = 1;
if (a[i][j] == '.') a[i][j] = 0;
if (a[i][j] == 'o') a[i][j] = 100;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) {
if ((a[i][j] + a[i][j + 1] + a[i][j + 2]) == 2) {
cout << "YES";
return 0;
}
if ((a[i][j] + a[i + 1][j + 1] + a[i + 2][j + 2]) == 2) {
cout << "YES";
return 0;
}
if ((a[i][j] + a[i + 1][j] + a[i + 2][j]) == 2) {
cout << "YES";
return 0;
}
if ((a[i][j] + a[i + 1][j - 1] + a[i + 2][j - 2]) == 2) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char store[3][4] = {
{'.', 'x', 'x', '\0'}, {'x', '.', 'x', '\0'}, {'x', 'x', '.', '\0'}};
char arr[4][5];
int i;
for (i = 0; i < 4; ++i) {
cin >> arr[i];
}
int c[4] = {0}, r[4] = {0}, j;
for (i = 0; i < 4; i++) {
string s = arr[i];
for (j = 0; j < 3; j++) {
size_t temp = s.find(store[j]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
}
for (i = 0; i < 4; i++) {
char ch[5] = {arr[0][i], arr[1][i], arr[2][i], arr[3][i], '\0'};
string s = ch;
for (j = 0; j < 3; j++) {
size_t temp = s.find(store[j]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
}
for (i = 0; i < 3; i++) {
char ch[4] = {arr[0][1], arr[1][2], arr[2][3], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
for (i = 0; i < 3; i++) {
char ch[4] = {arr[1][0], arr[2][1], arr[3][2], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
for (i = 0; i < 3; i++) {
char ch[5] = {arr[0][0], arr[1][1], arr[2][2], arr[3][3], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
for (i = 0; i < 3; i++) {
char ch[4] = {arr[0][2], arr[1][1], arr[2][0], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
for (i = 0; i < 3; i++) {
char ch[4] = {arr[1][3], arr[2][2], arr[3][1], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
for (i = 0; i < 3; i++) {
char ch[5] = {arr[0][3], arr[1][2], arr[2][1], arr[3][0], '\0'};
string s = ch;
size_t temp = s.find(store[i]);
if (temp != string::npos) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char str[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) cin >> str[i][j];
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (str[i][j] == '.') {
if (i == 0 && j == 0) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j + 1] == 'x' && str[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 0 && j == 3) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 3 && j == 0) {
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j + 1] == 'x' && str[i - 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 3 && j == 3) {
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i - 1][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 0 && j == 1) {
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j + 1] == 'x' && str[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 0 && j == 2) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 1 && j == 0) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j + 1] == 'x' && str[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 1 && j == 1) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j - 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i + 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i - 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j + 1] == 'x' && str[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 1 && j == 2) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i + 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i - 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 1 && j == 3) {
if (str[i + 1][j] == 'x' && str[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i + 1][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 2 && j == 0) {
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j + 1] == 'x' && str[i - 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 2 && j == 3) {
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i - 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 2 && j == 2) {
if (str[i][j + 1] == 'x' && str[i][j - 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i + 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i - 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i - 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 2 && j == 1) {
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j] == 'x' && str[i - 1][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i + 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i + 1][j - 1] == 'x' && str[i - 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j + 1] == 'x' && str[i - 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 3 && j == 1) {
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j + 1] == 'x' && str[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j + 1] == 'x' && str[i - 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (i == 3 && j == 2) {
if (str[i][j - 1] == 'x' && str[i][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j] == 'x' && str[i - 2][j] == 'x') {
cout << "YES";
return 0;
}
if (str[i][j - 1] == 'x' && str[i][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (str[i - 1][j - 1] == 'x' && str[i - 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char arr[5][5];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
cin >> arr[i][j];
}
bool flg = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 2; j++) {
if (arr[i][j] == 'x' and arr[i][j + 1] == 'x' and arr[i][j + 2] == 'x')
flg = 1;
if (arr[i][j] == '.' and arr[i][j + 1] == 'x' and arr[i][j + 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i][j + 1] == '.' and arr[i][j + 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i][j + 1] == 'x' and arr[i][j + 2] == '.')
flg = 1;
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (arr[i][j] == 'x' and arr[i + 1][j] == 'x' and arr[i + 2][j] == 'x')
flg = 1;
if (arr[i][j] == '.' and arr[i + 1][j] == 'x' and arr[i + 2][j] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i + 1][j] == '.' and arr[i + 2][j] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i + 1][j] == 'x' and arr[i + 2][j] == '.')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j + 1] == 'x' and
arr[i - 2][j + 2] == 'x')
flg = 1;
if (arr[i][j] == '.' and arr[i - 1][j + 1] == 'x' and
arr[i - 2][j + 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j + 1] == '.' and
arr[i - 2][j + 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j + 1] == 'x' and
arr[i - 2][j + 2] == '.')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j - 1] == 'x' and
arr[i - 2][j - 2] == 'x')
flg = 1;
if (arr[i][j] == '.' and arr[i - 1][j - 1] == 'x' and
arr[i - 2][j - 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j - 1] == '.' and
arr[i - 2][j - 2] == 'x')
flg = 1;
if (arr[i][j] == 'x' and arr[i - 1][j - 1] == 'x' and
arr[i - 2][j - 2] == '.')
flg = 1;
}
}
cout << ((flg) ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s[4];
for (int i = 0; i < 4; ++i) {
cin >> s[i];
}
int f = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (j < 2) {
if (s[i][j] == '.' && s[i][j + 1] == 'x' && s[i][j + 2] == 'x') f = 1;
if (s[i][j] == 'x' && s[i][j + 1] == 'x' && s[i][j + 2] == '.') f = 1;
if (s[i][j] == 'x' && s[i][j + 1] == '.' && s[i][j + 2] == 'x') f = 1;
}
if (i < 2) {
if (s[i][j] == '.' && s[i + 1][j] == 'x' && s[i + 2][j] == 'x') f = 1;
if (s[i][j] == 'x' && s[i + 1][j] == 'x' && s[i + 2][j] == '.') f = 1;
if (s[i][j] == 'x' && s[i + 1][j] == '.' && s[i + 2][j] == 'x') f = 1;
}
if (i < 2 && j < 2) {
if (s[i][j] == '.' && s[i + 1][j + 1] == 'x' && s[i + 2][j + 2] == 'x')
f = 1;
if (s[i][j] == 'x' && s[i + 1][j + 1] == 'x' && s[i + 2][j + 2] == '.')
f = 1;
if (s[i][j] == 'x' && s[i + 1][j + 1] == '.' && s[i + 2][j + 2] == 'x')
f = 1;
}
}
}
for (int i = 3; i >= 0; i--) {
for (int j = 3; j >= 0; j--) {
if (i < 2 && j >= 2) {
if (s[i][j] == '.' && s[i + 1][j - 1] == 'x' && s[i + 2][j - 2] == 'x')
f = 1;
if (s[i][j] == 'x' && s[i + 1][j - 1] == 'x' && s[i + 2][j - 2] == '.')
f = 1;
if (s[i][j] == 'x' && s[i + 1][j - 1] == '.' && s[i + 2][j - 2] == 'x')
f = 1;
}
}
}
if (f)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> map1;
map<int, map<int, int> > map2;
int mat[10][10];
int main() {
for (int i = 1; i <= 4; ++i) {
string str;
cin >> str;
for (int j = 1; j <= 4; ++j) {
if (str[j - 1] == '.')
mat[i][j] = 0;
else if (str[j - 1] == 'x')
mat[i][j] = 1;
else if (str[j - 1] == 'o')
mat[i][j] = -1;
}
}
for (int i = 1; i <= 4; ++i) {
if (mat[i][1] + mat[i][2] + mat[i][3] == 2 ||
mat[i][2] + mat[i][3] + mat[i][4] == 2) {
printf("YES\n");
return 0;
}
}
for (int i = 1; i <= 4; ++i) {
if (mat[1][i] + mat[2][i] + mat[3][i] == 2 ||
mat[2][i] + mat[3][i] + mat[4][i] == 2) {
printf("YES\n");
return 0;
}
}
if (mat[1][1] + mat[2][2] + mat[3][3] == 2 ||
mat[2][2] + mat[3][3] + mat[4][4] == 2) {
printf("YES\n");
return 0;
}
if (mat[1][4] + mat[2][3] + mat[3][2] == 2 ||
mat[2][3] + mat[3][2] + mat[4][1] == 2) {
printf("YES\n");
return 0;
}
if (mat[2][1] + mat[3][2] + mat[4][3] == 2 ||
mat[1][2] + mat[2][3] + mat[3][4] == 2 ||
mat[1][3] + mat[2][2] + mat[3][1] == 2 ||
mat[2][4] + mat[3][3] + mat[4][2] == 2) {
printf("YES\n");
return 0;
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char grid[5][5];
bool inRange(int x, int y) { return (x >= 0 && x < 4 && y >= 0 && y < 4); }
bool solve(int x, int y) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (i == 0 && j == 0) continue;
int xx = x + i, yy = y + j;
int xx2 = x + 2 * i, yy2 = y + 2 * j;
if (inRange(xx, yy) && inRange(xx2, yy2) && grid[xx][yy] == 'x' &&
grid[xx2][yy2] == 'x') {
return true;
}
}
for (int j = -1; j <= 1; j++) {
if (i == 0 && j == 0) continue;
int xx = x + i, yy = y + j;
int xx2 = x + -1 * i, yy2 = y + -1 * j;
if (inRange(xx, yy) && inRange(xx2, yy2) && grid[xx][yy] == 'x' &&
grid[xx2][yy2] == 'x') {
return true;
}
}
}
return false;
}
bool canWin() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (grid[i][j] == '.') {
if (solve(i, j)) return true;
}
}
}
return false;
}
int main() {
for (int i = 0; i < 4; i++) {
scanf("%s", grid[i]);
}
puts((canWin()) ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char t[10][10] = {0};
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> t[i][j];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if ((t[i][j] + t[i + 1][j] + t[i + 2][j] == 286) or
(t[i][j] + t[i][j + 1] + t[i][j + 2] == 286) or
(t[i][j] + t[i + 1][j + 1] + t[i + 2][j + 2] == 286) or
(t[i][j] + t[i + 1][j - 1] + t[i + 2][j - 2] == 286)) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s[4];
int n = 4;
for (int i = 0; i < n; i++) cin >> s[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (s[i][j] == 'x') {
if ((i - 1 >= 0 && s[i - 1][j] == 'x' && i - 2 >= 0 &&
s[i - 2][j] == '.') ||
(i - 1 >= 0 && s[i - 1][j] == '.' && i - 2 >= 0 &&
s[i - 2][j] == 'x')) {
cout << "YES";
return 0;
}
if ((i + 1 < n && s[i + 1][j] == 'x' && i + 2 < n &&
s[i + 2][j] == '.') ||
(i + 1 < n && s[i + 1][j] == '.' && i + 2 < n &&
s[i + 2][j] == 'x')) {
cout << "YES";
return 0;
}
if ((j - 1 >= 0 && s[i][j - 1] == 'x' && j - 2 >= 0 &&
s[i][j - 2] == '.') ||
(j - 1 >= 0 && s[i][j - 1] == '.' && j - 2 >= 0 &&
s[i][j - 2] == 'x')) {
cout << "YES";
return 0;
}
if ((j + 1 < n && s[i][j + 1] == 'x' && j + 2 < n &&
s[i][j + 2] == '.') ||
(j + 1 < n && s[i][j + 1] == '.' && j + 2 < n &&
s[i][j + 2] == 'x')) {
cout << "YES";
return 0;
}
if ((i + 1 < n && j + 1 < n && s[i + 1][j + 1] == 'x' && i + 2 < n &&
j + 2 < n && s[i + 2][j + 2] == '.') ||
(i + 1 < n && j + 1 < n && s[i + 1][j + 1] == '.' && i + 2 < n &&
j + 2 < n && s[i + 2][j + 2] == 'x')) {
cout << "YES";
return 0;
}
if ((i - 1 >= 0 && j + 1 < n && s[i - 1][j + 1] == 'x' && i - 2 >= 0 &&
j + 2 < n && s[i - 2][j + 2] == '.') ||
(i - 1 >= 0 && j + 1 < n && s[i - 1][j + 1] == '.' && i - 2 >= 0 &&
j + 2 < n && s[i - 2][j + 2] == 'x')) {
cout << "YES";
return 0;
}
if ((i - 1 >= 0 && j - 1 >= 0 && s[i - 1][j - 1] == 'x' && i - 2 >= 0 &&
j - 2 >= 0 && s[i - 2][j - 2] == '.') ||
(i - 1 >= 0 && j - 1 >= 0 && s[i - 1][j - 1] == '.' && i - 2 >= 0 &&
j - 2 >= 0 && s[i - 2][j - 2] == 'x')) {
cout << "YES";
return 0;
}
if ((i + 1 < n && j - 1 >= 0 && s[i + 1][j - 1] == 'x' && i + 2 < n &&
j - 2 >= 0 && s[i + 2][j - 2] == '.') ||
(i + 1 < n && j - 1 >= 0 && s[i + 1][j - 1] == '.' && i + 2 < n &&
j - 2 >= 0 && s[i + 2][j - 2] == 'x')) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const double g = 10.0, eps = 1e-7;
const int N = 100 + 10, maxn = 500 + 100, inf = 0x3f3f3f;
char ma[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> ma[i][j];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (i + 2 < 4) {
int p = 0, x = 0;
for (int k = 0; k < 3; k++) {
if (ma[i + k][j] == '.')
p++;
else if (ma[i + k][j] == 'x')
x++;
}
if (p == 1 && x == 2) {
cout << "YES" << endl;
return 0;
}
}
if (j + 2 < 4) {
int p = 0, x = 0;
for (int k = 0; k < 3; k++) {
if (ma[i][j + k] == '.')
p++;
else if (ma[i][j + k] == 'x')
x++;
}
if (p == 1 && x == 2) {
cout << "YES" << endl;
return 0;
}
}
if (i + 2 < 4 && j + 2 < 4) {
int p = 0, x = 0;
for (int k = 0; k < 3; k++) {
if (ma[i + k][j + k] == '.')
p++;
else if (ma[i + k][j + k] == 'x')
x++;
}
if (p == 1 && x == 2) {
cout << "YES" << endl;
return 0;
}
}
if (i - 2 >= 0 && j + 2 < 4) {
int p = 0, x = 0;
for (int k = 0; k < 3; k++) {
if (ma[i - k][j + k] == '.')
p++;
else if (ma[i - k][j + k] == 'x')
x++;
}
if (p == 1 && x == 2) {
cout << "YES" << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[10][10];
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> s[0] >> s[1] >> s[2] >> s[3];
int fg = 0;
for (int i = 0; i < 4; ++i) {
int x, y;
for (int j = 0; j < 4; ++j) {
x = 0;
y = 0;
if (s[i][j] == 'x') x++;
if (s[i][j] == '.') y++;
if (s[i][j + 1] == 'x') x++;
if (s[i][j + 1] == '.') y++;
if (s[i][j + 2] == 'x') x++;
if (s[i][j + 2] == '.') y++;
if (x == 2 && y == 1) fg = 1;
x = 0;
y = 0;
if (s[i][j] == 'x') x++;
if (s[i][j] == '.') y++;
if (s[i + 1][j] == 'x') x++;
if (s[i + 1][j] == '.') y++;
if (s[i + 2][j] == 'x') x++;
if (s[i + 2][j] == '.') y++;
if (x == 2 && y == 1) fg = 1;
x = 0;
y = 0;
if (s[i][j] == 'x') x++;
if (s[i][j] == '.') y++;
if (s[i + 1][j + 1] == 'x') x++;
if (s[i + 1][j + 1] == '.') y++;
if (s[i + 2][j + 2] == 'x') x++;
if (s[i + 2][j + 2] == '.') y++;
if (x == 2 && y == 1) fg = 1;
x = 0;
y = 0;
if (s[i][j] == 'x') x++;
if (s[i][j] == '.') y++;
if (j > 0 && s[i + 1][j - 1] == 'x') x++;
if (j > 0 && s[i + 1][j - 1] == '.') y++;
if (j > 1 && s[i + 2][j - 2] == 'x') x++;
if (j > 1 && s[i + 2][j - 2] == '.') y++;
if (x == 2 && y == 1) fg = 1;
}
}
puts(fg == 1 ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char field[4][4];
bool small_check(int x, int y, int dir) {
int cur_x = x;
int cur_y = y;
for (int i = 0; i < 3; ++i) {
if (cur_x >= 4 || cur_y >= 4 || cur_x < 0 || cur_y < 0) {
return false;
}
if (field[cur_x][cur_y] != 'x') {
return false;
}
if (dir == 0) {
cur_x++;
} else if (dir == 1) {
cur_y++;
} else if (dir == 2) {
cur_y++;
cur_x++;
} else {
cur_x++;
cur_y--;
}
}
return true;
}
bool check() {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
for (int dir = 0; dir < 4; dir++) {
if (small_check(i, j, dir)) {
return true;
}
}
}
}
return false;
}
int main() {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
cin >> field[i][j];
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (field[i][j] == '.') {
field[i][j] = 'x';
if (check()) {
cout << "YES";
return 0;
}
field[i][j] = '.';
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
char mat[8][8];
int r1[] = {1, 1, 0, -1, -1, -1, 0, 1, 0, -1, -1, -1};
int c1[] = {0, 1, 1, 1, 0, -1, -1, -1, 1, 0, -1, +1};
int r2[] = {2, 2, 0, -2, -2, -2, 0, 2, 0, 1, 1, +1};
int c2[] = {0, 2, 2, 2, 0, -2, -2, -2, -1, 0, 1, -1};
int isval(int x, int y) {
if (x >= 0 && x < 4 && y >= 0 && y < 4) return 1;
return 0;
}
int main() {
for (int k = 0; k < 8; k++) {
for (int l = 0; l < 8; l++) {
mat[k][l] = 'i';
}
}
for (int k = 0; k < 4; k++) {
for (int l = 0; l < 4; l++) {
cin >> mat[k][l];
}
}
for (int k = 0; k < 4; k++) {
for (int l = 0; l < 4; l++) {
if (mat[k][l] == '.') {
for (int m = 0; m < 12; m++) {
int x1 = k + r1[m];
int y1 = l + c1[m];
int x2 = k + r2[m];
int y2 = l + c2[m];
if (isval(x1, y1) && isval(x2, y2)) {
char aa = mat[x1][y1];
char bb = mat[x2][y2];
if (aa == 'x' && bb == 'x') {
cout << "YES" << endl;
return 0;
}
}
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char mat[4][4];
int diag1(int i, int j) {
int nx = 0, nv = 0;
for (int k = 0; k < 3; k++) {
if (mat[i + k][j + k] == 'x')
nx++;
else if (mat[i + k][j + k] == '.')
nv++;
}
if ((nx == 2) && (nv == 1)) return 1;
return 0;
}
int diag2(int i, int j) {
int nx = 0, nv = 0;
for (int k = 0; k < 3; k++) {
if (mat[i + k][j - k] == 'x')
nx++;
else if (mat[i + k][j - k] == '.')
nv++;
}
if ((nx == 2) && (nv == 1)) return 1;
return 0;
}
int main() {
int win = 0, nx = 0, nv = 0;
char prim;
for (int i = 0; i <= 3; i++) {
nx = 0;
nv = 0;
for (int j = 0; j <= 3; j++) {
cin >> mat[i][j];
if (j == 0) prim = mat[i][j];
if (mat[i][j] == 'x')
nx++;
else if (mat[i][j] == '.')
nv++;
if ((j == 3) && (prim == 'x'))
nx--;
else if ((j == 3) && (prim == '.'))
nv--;
if ((nx == 2) && (nv == 1)) {
cout << "YES" << endl;
return 0;
}
}
}
for (int j = 0; j <= 3; j++) {
nx = 0;
nv = 0;
for (int i = 0; i <= 3; i++) {
if (i == 0) prim = mat[i][j];
if (mat[i][j] == 'x')
nx++;
else if (mat[i][j] == '.')
nv++;
if ((i == 3) && (prim == 'x'))
nx--;
else if ((i == 3) && (prim == '.'))
nv--;
if ((nx == 2) && (nv == 1)) {
cout << "YES" << endl;
return 0;
}
}
}
for (int j = 0; j <= 3; j++) {
nx = 0;
nv = 0;
for (int i = 0; i <= 3; i++) {
if (i == 0) prim = mat[i][j];
if (mat[i][j] == 'x')
nx++;
else if (mat[i][j] == '.')
nv++;
if ((i == 3) && (prim == 'x'))
nx--;
else if ((i == 3) && (prim == '.'))
nv--;
if ((nx == 2) && (nv == 1)) {
cout << "YES" << endl;
return 0;
}
}
}
if (diag1(0, 0) || diag1(0, 1) || diag1(1, 0) || diag1(1, 1)) {
cout << "YES" << endl;
return 0;
}
if (diag2(0, 3) || diag2(0, 2) || diag2(1, 3) || diag2(1, 2)) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
char str[10][10];
int to[8][2] = {-1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1};
bool judge(int x, int y) {
for (int i = 0; i < 8; i++) {
if (str[x + to[i][0]][y + to[i][1]] == 'x' &&
str[x + to[i][0] * 2][y + to[i][1] * 2] == 'x')
return true;
if (str[x + to[i][0]][y + to[i][1]] == 'x' &&
str[x - to[i][0]][y - to[i][1]] == 'x')
return true;
}
return false;
}
int main() {
for (int i = 1; i <= 8; i++)
for (int j = 1; j <= 8; j++) str[i][j] = '.';
for (int i = 3; i <= 6; i++) scanf("%s", str[i] + 3);
for (int i = 3; i <= 6; i++) {
for (int j = 3; j <= 6; j++) {
if (str[i][j] == '.' && judge(i, j)) {
printf("YES");
return 0;
}
}
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, r;
char s[10][10];
bool f[10][10], flag;
memset(f, false, sizeof(f));
for (i = 1; i <= 4; i++)
for (j = 1; j <= 4; j++) {
cin >> s[i][j];
if (s[i][j] == '.') f[i][j] = true;
}
flag = false;
r = 0;
for (i = 1; i <= 4; i++)
for (j = 1; j <= 4; j++) {
if (!f[i][j]) continue;
s[i][j] = 'x';
for (k = i; k >= 1; k--)
if (s[k][j] == 'x')
r++;
else
break;
for (k = i + 1; k <= 4; k++)
if (s[k][j] == 'x')
r++;
else
break;
if (r >= 3) flag = true;
r = 0;
for (k = j; k >= 1; k--)
if (s[i][k] == 'x')
r++;
else
break;
for (k = j + 1; k <= 4; k++)
if (s[i][k] == 'x')
r++;
else
break;
if (r >= 3) flag = true;
r = 0;
for (k = 0; k <= 3; k++) {
if (i - k < 1 || j - k < 1) break;
if (s[i - k][j - k] == 'x')
r++;
else
break;
}
for (k = 1; k <= 3; k++) {
if (i + k > 4 || j + k > 4) break;
if (s[i + k][j + k] == 'x')
r++;
else
break;
}
if (r >= 3) flag = true;
r = 0;
for (k = 0; k <= 3; k++) {
if (i - k < 1 || j + k > 4) break;
if (s[i - k][j + k] == 'x')
r++;
else
break;
}
for (k = 1; k <= 3; k++) {
if (i + k > 4 || j - k < 1) break;
if (s[i + k][j - k] == 'x')
r++;
else
break;
}
if (r >= 3) flag = true;
r = 0;
s[i][j] = '.';
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
char st[4][4];
int main() {
for (int i = 0; i < 4; i++) scanf("%s", st[i]);
int ok = 0;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (st[i][j] != 'o') {
if (i > 0 && i < 3 && st[i - 1][j] == 'x' && st[i + 1][j] == 'x')
ok = 1;
if (j > 0 && j < 3 && st[i][j - 1] == 'x' && st[i][j + 1] == 'x')
ok = 1;
if (i > 0 && j > 0 && i < 3 && j < 3 &&
((st[i - 1][j - 1] == 'x' && st[i + 1][j + 1] == 'x') ||
(st[i - 1][j + 1] == 'x' && st[i + 1][j - 1] == 'x')))
ok = 1;
if (i < 2 && st[i + 1][j] == 'x' && st[i + 2][j] == 'x') ok = 1;
if (j < 2 && st[i][j + 1] == 'x' && st[i][j + 2] == 'x') ok = 1;
if (i > 1 && st[i - 1][j] == 'x' && st[i - 2][j] == 'x') ok = 1;
if (j > 1 && st[i][j - 1] == 'x' && st[i][j - 2] == 'x') ok = 1;
if (i > 1 && j > 1 && st[i - 1][j - 1] == 'x' &&
st[i - 2][j - 2] == 'x')
ok = 1;
if (i < 2 && j < 2 && st[i + 1][j + 1] == 'x' &&
st[i + 2][j + 2] == 'x')
ok = 1;
if (i > 1 && j < 2 && st[i - 1][j + 1] == 'x' &&
st[i - 2][j + 2] == 'x')
ok = 1;
if (i < 2 && j > 1 && st[i + 1][j - 1] == 'x' &&
st[i + 2][j - 2] == 'x')
ok = 1;
}
}
if (ok)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;
char ss[10][10];
int dx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {-1, -1}, {-1, 1}, {1, -1}};
int dp[7][7][10];
int dfs(int i, int j, int k) {
if (dp[i][j][k] != -1) return dp[i][j][k];
dp[i][j][k] = 1;
if (i + dx[k][0] > 0 && i + dx[k][0] < 5 && j + dx[k][1] > 0 &&
j + dx[k][1] < 5) {
if (ss[i + dx[k][0]][j + dx[k][1]] == ss[i][j])
dp[i][j][k] += dfs(i + dx[k][0], j + dx[k][1], k);
}
return dp[i][j][k];
}
bool cmp(int i, int j) {
for (int k = 0; k < 8; k += 2) {
int a = 0, b = 0;
if (ss[i + dx[k][0]][j + dx[k][1]] == 'x')
a = dfs(i + dx[k][0], j + dx[k][1], k);
if (ss[i + dx[k + 1][0]][j + dx[k + 1][1]] == 'x')
b = dfs(i + dx[k + 1][0], j + dx[k + 1][1], k + 1);
if (a + b > 1) return true;
}
return false;
}
int main() {
memset(dp, -1, sizeof(dp));
bool flag = false;
for (int i = 1; i < 5; i++) scanf("%s", ss[i] + 1);
for (int i = 1; i < 5; i++)
for (int j = 1; j < 5; j++)
if (ss[i][j] == '.')
if (cmp(i, j)) flag = true;
if (flag)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char arr[4][4];
bool isinposition(int i, int j) {
return (i >= 0 && i <= 3) && (j >= 0 && j <= 3);
}
bool isx(int i, int j, int i2, int j2) {
return (arr[i][j] == 'x' && arr[i2][j2] == 'x');
}
bool isdot(int i, int j) { return arr[i][j] == '.'; }
int main() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) cin >> arr[i][j];
}
bool answer = false;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 2; j++)
answer = (answer | (isx(i, j, i, j + 1) && arr[i][j + 2] == '.'));
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 2; j++)
answer = (answer | (isx(i, j, i, j + 2) && arr[i][j + 1] == '.'));
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 2; j++)
answer = (answer | (isx(i, j + 1, i, j + 2) && arr[i][j] == '.'));
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 4; j++)
answer = (answer | (isx(i, j, i + 1, j) && arr[i + 2][j] == '.'));
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 4; j++)
answer = (answer | (isx(i, j, i + 2, j) && (arr[i + 1][j] == '.')));
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 4; j++)
answer = (answer | (isx(i + 1, j, i + 2, j) && (arr[i][j] == '.')));
}
answer = (answer | (isx(0, 0, 1, 1) && arr[2][2] == '.') |
(isx(0, 0, 2, 2) && arr[1][1] == '.') |
(isx(0, 1, 1, 2) && arr[2][3] == '.') |
(isx(0, 1, 2, 3) && arr[1][2] == '.') |
(isx(1, 1, 2, 2) && arr[3][3] == '.') |
(isx(1, 2, 2, 3) && arr[0][1] == '.') |
(isx(1, 0, 2, 1) && arr[3][2] == '.') |
(isx(1, 0, 3, 2) && arr[2][1] == '.') |
(isx(2, 1, 3, 2) && arr[1][0] == '.'));
answer =
(answer | (isx(1, 1, 2, 2) && isdot(3, 3)) |
(isx(1, 1, 3, 3) && isdot(2, 2)) | (isx(2, 2, 3, 3) && isdot(1, 1)));
answer =
(answer | (isx(0, 3, 1, 2) && isdot(2, 1)) |
(isx(0, 3, 2, 1) && isdot(1, 2)) | (isx(1, 2, 2, 1) && isdot(0, 3)) |
(isx(0, 2, 1, 1) && isdot(2, 0)) | (isx(0, 2, 2, 0) && isdot(1, 1)) |
(isx(1, 1, 2, 0) && isdot(0, 2)) | (isx(1, 3, 2, 2) && isdot(3, 1)) |
(isx(1, 3, 3, 1) && isdot(2, 2)) | (isx(2, 2, 3, 1) && isdot(1, 3)));
answer =
(answer | (isx(1, 2, 2, 1) && isdot(3, 0)) |
(isx(1, 2, 3, 0) && isdot(2, 1)) | (isx(2, 1, 3, 0) && isdot(1, 2)));
if (answer)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
const int MAXINT = 2147483640;
const long long MAXLL = 9223372036854775800LL;
const long long MAXN = 10;
using namespace std;
char c[MAXN][MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n = 4, m = 4, i, j;
for (i = 0; i <= n + 1; i++)
for (j = 0; j <= m + 1; j++) c[i][j] = 'o';
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) cin >> c[i][j];
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
if (c[i][j] == '.') {
if ((c[i + 1][j] == 'x' && c[i + 2][j] == 'x' && i <= 2) ||
(c[i - 1][j] == 'x' && c[i - 2][j] == 'x' && i >= 2) ||
(c[i - 1][j] == 'x' && c[i + 1][j] == 'x')) {
cout << "YES" << endl;
return 0;
}
if ((c[i][j + 1] == 'x' && c[i][j + 2] == 'x' && j <= 2) ||
(c[i][j - 1] == 'x' && c[i][j - 2] == 'x' && j >= 2) ||
(c[i][j - 1] == 'x' && c[i][j + 1] == 'x')) {
cout << "YES" << endl;
return 0;
}
if ((c[i + 1][j + 1] == 'x' && c[i + 2][j + 2] == 'x' && i <= 2 &&
j <= 2) ||
((c[i - 1][j - 1] == 'x' && c[i - 2][j - 2] == 'x' && i >= 2 &&
j >= 2)) ||
(c[i - 1][j - 1] == 'x' && c[i + 1][j + 1] == 'x') ||
(c[i - 1][j + 1] == 'x' && c[i + 1][j - 1] == 'x')) {
cout << "YES" << endl;
return 0;
}
if ((c[i + 1][j - 1] == 'x' && c[i + 2][j - 2] == 'x' && i <= 2 &&
j >= 2) ||
(c[i - 1][j + 1] == 'x' && c[i - 2][j + 2] == 'x' && i >= 2 &&
j <= 2)) {
cout << "YES" << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100][100];
int dir1[4] = {1, 0, 1, 1};
int dir2[4] = {0, 1, 1, -1};
bool check() {
for (int i = 1; i <= 4; ++i) {
for (int j = 1; j <= 4; ++j) {
for (int k = 0; k < 4; ++k) {
int ii = i;
int jj = j;
int cnt = 0;
for (int h = 0; h < 3 && ii <= 4 && jj <= 4 && ii >= 1 && jj >= 1;
ii += dir1[k], jj += dir2[k], ++h) {
if (s[ii][jj] == 'x') ++cnt;
}
if (cnt == 3) {
return true;
}
}
}
}
return false;
}
void solve() {
for (int i = 1; i <= 4; ++i) {
cin >> s[i] + 1;
}
for (int i = 1; i <= 4; ++i) {
for (int j = 1; j <= 4; ++j) {
if (s[i][j] == '.') {
s[i][j] = 'x';
if (check()) {
cout << "YES\n";
return;
}
s[i][j] = '.';
}
}
}
cout << "NO\n";
}
int main() {
int k = 1;
for (; k <= 1; ++k)
;
{ solve(); }
}
|
#include <bits/stdc++.h>
char map[5][5];
int solve(int x, int y) {
int ans = 0;
for (int i = y + 1; i < 4; i++) {
if (map[x][i] == 'x')
ans++;
else
break;
}
for (int i = y - 1; i >= 0; i--) {
if (map[x][i] == 'x')
ans++;
else
break;
}
if (ans >= 2) return 1;
ans = 0;
for (int i = x + 1; i < 4; i++) {
if (map[i][y] == 'x')
ans++;
else
break;
}
for (int i = x - 1; i >= 0; i--) {
if (map[i][y] == 'x')
ans++;
else
break;
}
if (ans >= 2) return 1;
ans = 0;
for (int i = x + 1, j = y + 1; i < 4 && j < 4; i++, j++) {
if (map[i][j] == 'x')
ans++;
else
break;
}
for (int i = x - 1, j = y - 1; i >= 0 && j >= 0; i--, j--) {
if (map[i][j] == 'x')
ans++;
else
break;
}
if (ans >= 2) return 1;
ans = 0;
for (int i = x - 1, j = y + 1; i >= 0 && j < 4; i--, j++) {
if (map[i][j] == 'x')
ans++;
else
break;
}
for (int i = x + 1, j = y - 1; i < 4, j >= 0; i++, j--) {
if (map[i][j] == 'x')
ans++;
else
break;
}
if (ans >= 2) return 1;
return 0;
}
int main() {
while (scanf("%s", map[0]) != EOF) {
int flag = 0;
for (int i = 1; i < 4; i++) scanf("%s", map[i]);
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++)
if (map[i][j] == '.')
if (solve(i, j)) flag = 1;
printf("%s\n", flag ? "YES" : "NO");
}
}
|
#include <bits/stdc++.h>
using namespace std;
char tab[4][4];
int xi[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int yi[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool found = false;
bool inbound(int i, int j) { return (i < 4 && j < 4 && i >= 0 && j >= 0); }
bool check(int x, int y) {
for (int i = 0; i < 8; i++) {
int x1 = x + xi[i];
int x2 = x - xi[i];
int y1 = y + yi[i];
int y2 = y - yi[i];
if (inbound(x1, y1) && inbound(x2, y2)) {
if (tab[x1][y1] == 'x' && tab[x2][y2] == 'x') return true;
}
x1 = x + xi[i];
x2 = x1 + xi[i];
y1 = y + yi[i];
y2 = y1 + yi[i];
if (inbound(x1, y1) && inbound(x2, y2)) {
if (tab[x1][y1] == 'x' && tab[x2][y2] == 'x') return true;
}
x1 = x - xi[i];
x2 = x1 - xi[i];
y1 = y - yi[i];
y2 = y1 - yi[i];
if (inbound(x1, y1) && inbound(x2, y2)) {
if (tab[x1][y1] == 'x' && tab[x2][y2] == 'x') return true;
}
}
return false;
}
int main() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> tab[i][j];
}
}
for (int i = 0; i < 4 && (found == false); i++) {
for (int j = 0; j < 4 && (found == false); j++) {
if (tab[i][j] == '.') {
tab[i][j] = 'x';
found = check(i, j);
tab[i][j] = '.';
}
}
}
if (found) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c[4][4];
bool use[4][4];
int dx[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
inline void dfs() {
int i, j, xx, yy, p, q;
bool ok = 1;
for (p = 0; p < 4; p++) {
for (q = 0; q < 4; q++) {
for (i = 0; i < 8; i++) {
for (j = 0; j < 3; j++) {
xx = p + dx[i] * j;
yy = q + dy[i] * j;
if (xx < 0 || xx == 4 || yy < 0 || yy == 4) {
ok = 0;
break;
}
if (c[xx][yy] != 'x') {
ok = 0;
break;
}
}
if (ok == 1) {
cout << "YES" << endl;
exit(0);
}
ok = 1;
}
}
}
}
int main() {
int i, j, x, y;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++) cin >> c[i][j];
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
if (c[i][j] != '.') continue;
c[i][j] = 'x';
dfs();
c[i][j] = '.';
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s[4];
int codifica() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (i <= 1 && s[i][j] == 'x' && s[i + 1][j] == 'x' &&
s[i + 2][j] == 'x') {
return 1;
}
if (j <= 1 && s[i][j] == 'x' && s[i][j + 1] == 'x' &&
s[i][j + 2] == 'x') {
return 1;
}
if (i <= 1 && s[i][j] == 'x' && s[i + 1][j + 1] == 'x' &&
s[i + 2][j + 2] == 'x') {
return 1;
}
if (j >= 2 && i <= 1 && s[i][j] == 'x' && s[i + 1][j - 1] == 'x' &&
s[i + 2][j - 2] == 'x') {
return 1;
}
if (i >= 2 && j >= 2 && s[i][j] == 'x' && s[i - 1][j - 1] == 'x' &&
s[i - 2][j - 2] == 'x') {
return 1;
}
}
}
return 0;
}
int main() {
int flag = 0;
cin >> s[0] >> s[1] >> s[2] >> s[3];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i][j] == '.') {
s[i][j] = 'x';
flag = codifica();
if (flag == 1) {
cout << "YES" << endl;
return 0;
}
s[i][j] = '.';
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int game[8][8];
bool check(int x, int y) {
if (game[x][y - 2] == -1 && game[x][y - 1] == -1) return true;
if (game[x][y - 1] == -1 && game[x][y + 1] == -1) return true;
if (game[x][y + 1] == -1 && game[x][y + 2] == -1) return true;
if (game[x - 2][y] == -1 && game[x - 1][y] == -1) return true;
if (game[x - 1][y] == -1 && game[x + 1][y] == -1) return true;
if (game[x + 1][y] == -1 && game[x + 2][y] == -1) return true;
if (game[x - 2][y - 2] == -1 && game[x - 1][y - 1] == -1) return true;
if (game[x - 1][y - 1] == -1 && game[x + 1][y + 1] == -1) return true;
if (game[x + 1][y + 1] == -1 && game[x + 2][y + 2] == -1) return true;
if (game[x - 2][y + 2] == -1 && game[x - 1][y + 1] == -1) return true;
if (game[x - 1][y + 1] == -1 && game[x + 1][y - 1] == -1) return true;
if (game[x + 1][y - 1] == -1 && game[x + 2][y - 2] == -1) return true;
return false;
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<pair<int, int> > possible;
string str;
int i = 2, j;
while (cin >> str) {
for (j = 0; j < 4; j++) {
if (str[j] == '.') {
game[i][j + 2] = 1;
possible.push_back(make_pair(i, j + 2));
} else if (str[j] == 'x')
game[i][j + 2] = -1;
}
i++;
}
vector<pair<int, int> >::iterator vi;
for (vi = possible.begin(); vi != possible.end(); vi++)
if (check(vi->first, vi->second)) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char ch[16];
bool xie(char c) {
return ((ch[4] == c && ch[9] == c && ch[14] == c) ||
(ch[0] == c && ch[5] == c && ch[10] == c) ||
(ch[5] == c && ch[10] == c && ch[15] == c) ||
(ch[1] == c && ch[6] == c && ch[11] == c) ||
(ch[2] == c && ch[5] == c && ch[8] == c) ||
(ch[3] == c && ch[6] == c && ch[9] == c) ||
(ch[6] == c && ch[9] == c && ch[12] == c) ||
(ch[7] == c && ch[10] == c && ch[13] == c));
}
bool judge(char c) {
for (int i = 0; i <= 3; i++) {
for (int j = 0; j <= 1; j++) {
if (ch[i * 4 + j] == c && ch[i * 4 + j + 1] == c &&
ch[i * 4 + j + 2] == c)
return 1;
if (ch[j * 4 + i] == c && ch[(j + 1) * 4 + i] == c &&
ch[(j + 2) * 4 + i] == c)
return 1;
}
}
if (xie(c) == 1) return 1;
return 0;
}
int main() {
for (int i = 0; i <= 15; i++) {
cin >> ch[i];
}
for (int i = 0; i <= 15; i++) {
if (ch[i] == '.') {
ch[i] = 'x';
if (judge('x') == 1) {
puts("YES");
return 0;
}
ch[i] = '.';
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int A[100009];
bool visit[100009];
int main() {
long long int t, T, n, m, i, j, k, ans, a, b, c, x, y, l, r;
string second[5];
while (cin >> second[0]) {
ans = 0;
cin >> second[1];
cin >> second[2];
cin >> second[3];
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
x = 0;
for (k = j; k < j + 3; k++) {
if (k > 3) {
x = 0;
break;
}
if (second[i][k] == 'x') x++;
if (second[i][k] == 'o') x--;
}
if (x == 2) ans = 1;
x = 0;
for (k = i; k < i + 3; k++) {
if (k > 3) {
x = 0;
break;
}
if (second[k][j] == 'x') x++;
if (second[k][j] == 'o') x--;
}
if (x == 2) ans = 1;
x = 0;
for (k = 0; k < 3; k++) {
if (i + k > 3 || j + k > 3) {
x = 0;
break;
}
if (second[i + k][j + k] == 'x') x++;
if (second[i + k][j + k] == 'o') x--;
}
if (x == 2) ans = 1;
x = 0;
for (k = 0; k < 3; k++) {
if (i + k > 3 || j - k < 0) {
x = 0;
break;
}
if (second[i + k][j - k] == 'x') x++;
if (second[i + k][j - k] == 'o') x--;
}
if (x == 2) ans = 1;
if (ans == 1) break;
}
if (ans == 1) break;
}
if (ans == 1)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Emsawy() {}
int dx[]{1, -1, 0, 0, 1, -1, 1, -1};
int dy[]{0, 0, 1, -1, 1, -1, -1, 1};
long long suf(long long x) { return (x * (x + 1)) / 2; }
vector<vector<pair<int, int> > > adj;
const long long mod = 1e9 + 7, oo = 1e9;
int n, m;
char g[6][6];
bool go() {
bool ok = 0;
for (int i = 0; i < 4; i++) {
int x = 0, o = 0;
for (int j = 0; j < 4; j++) {
x += (g[i][j] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i][j] != 'x') x = 0;
}
}
for (int i = 0; i < 4; i++) {
int x = 0, o = 0;
for (int j = 0; j < 4; j++) {
x += (g[i][3 - j] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i][3 - j] != 'x') x = 0;
}
}
for (int i = 0; i < 4; i++) {
int x = 0, o = 0;
for (int j = 0; j < 4; j++) {
x += (g[j][i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[j][i] != 'x') x = 0;
}
}
for (int i = 0; i < 4; i++) {
int x = 0, o = 0;
for (int j = 0; j < 4; j++) {
x += (g[3 - j][i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[3 - j][i] != 'x') x = 0;
}
}
int x = 0, o = 0;
for (int i = 0; i < 4; i++) {
x += (g[i][i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i][i] != 'x') x = 0;
}
x = 0, o = 0;
for (int i = 0; i < 4; i++) {
x += (g[3 - i][3 - i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[3 - i][3 - i] != 'x') x = 0;
}
x = 0, o = 0;
for (int i = 0; i < 4; i++) {
x += (g[i][3 - i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i][3 - i] != 'x') x = 0;
}
x = 0, o = 0;
for (int i = 0; i < 4; i++) {
x += (g[3 - i][i] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[3 - i][i] != 'x') x = 0;
}
x = 0;
int i2 = 0, j2 = 1;
while (i2 < 4 && j2 < 4) {
x += (g[i2][j2] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i2][j2] != 'x') x = 0;
i2++, j2++;
}
x = 0;
i2 = 1, j2 = 0;
while (i2 < 4 && j2 < 4) {
x += (g[i2][j2] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i2][j2] != 'x') x = 0;
i2++, j2++;
}
x = 0;
i2 = 0, j2 = 2;
while (i2 < 4 && j2 >= 0) {
x += (g[i2][j2] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i2][j2] != 'x') x = 0;
i2++, j2--;
}
x = 0;
i2 = 1, j2 = 3;
while (i2 < 4 && j2 >= 0) {
x += (g[i2][j2] == 'x');
if (x == 3) {
ok = 1;
break;
}
if (g[i2][j2] != 'x') x = 0;
i2++, j2--;
}
return ok;
}
int main() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> g[i][j];
}
}
bool ok = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (g[i][j] == '.') {
g[i][j] = 'x';
ok |= go();
g[i][j] = '.';
}
}
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
char a[5][5];
int judge() {
int i, j;
int flag = 0;
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
if (a[i][j] == 'x') {
if (i <= 1 && a[i + 1][j] == 'x' && a[i + 2][j] == 'x') {
flag = 1;
} else if (j <= 1 && a[i][j + 1] == 'x' && a[i][j + 2] == 'x') {
flag = 1;
} else if (i <= 1 && j <= 1 && a[i + 1][j + 1] == 'x' &&
a[i + 2][j + 2] == 'x') {
flag = 1;
} else if (i >= 2 && i <= 3 && j <= 1 && a[i - 1][j + 1] == 'x' &&
a[i - 2][j + 2] == 'x') {
flag = 1;
} else {
flag = 0;
}
}
if (flag) {
return 1;
}
}
}
return 0;
}
int main() {
int i, j;
int flag = 0;
for (i = 0; i < 4; i++) {
scanf("%s", a[i]);
}
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
if (a[i][j] == '.') {
a[i][j] = 'x';
flag = judge();
a[i][j] = '.';
if (flag == 1) {
printf("YES\n");
return 0;
}
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[5][5];
char c;
int main() {
for (int i = 1; i <= 4; i++) {
for (int j = 1; j <= 4; j++) {
c = getchar();
if (c == '.')
a[i][j] = 0;
else if (c == 'x')
a[i][j] = 1;
else
a[i][j] = -1;
}
c = getchar();
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 2; j++) {
if (a[i][j] != -1 && a[i][j + 1] != -1 && a[i][j + 2] != -1 &&
a[i][j] + a[i][j + 1] + a[i][j + 2] >= 2) {
printf("YES\n");
return 0;
}
}
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= 4; j++) {
if (a[i][j] != -1 && a[i + 1][j] != -1 && a[i + 2][j] != -1 &&
a[i][j] + a[i + 1][j] + a[i + 2][j] >= 2) {
printf("YES\n");
return 0;
}
}
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= 2; j++) {
if (a[i][j] != -1 && a[i + 1][j + 1] != -1 && a[i + 2][j + 2] != -1 &&
a[i][j] + a[i + 1][j + 1] + a[i + 2][j + 2] >= 2) {
printf("YES\n");
return 0;
}
}
for (int i = 1; i <= 2; i++)
for (int j = 3; j <= 4; j++) {
if (a[i][j] != -1 && a[i + 1][j - 1] != -1 && a[i + 2][j - 2] != -1 &&
a[i][j] + a[i + 1][j - 1] + a[i + 2][j - 2] >= 2) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int G() {
char tt = getchar();
int o, f = 0;
while (tt < '0' || tt > '9') {
if (tt == '-') f = 1;
tt = getchar();
}
for (o = 0; tt >= '0' && tt <= '9'; tt = getchar()) o = o * 10 + tt - '0';
return f ? -o : o;
}
const int INF = 0x3c3c3c3c;
int n, i, j, k, ni, nj;
char S[5][5];
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int main() {
for (i = 1; i <= 4; i++) {
scanf("%s", &S[i][1]);
}
for (i = 1; i <= 4; i++) {
for (j = 1; j <= 4; j++) {
if (S[i][j] == 'x') {
for (k = 0; k < 8; k++) {
ni = i + dx[k], nj = j + dy[k];
if (S[ni][nj] == 'x') {
ni += dx[k], nj += dy[k];
if (S[ni][nj] == '.') return cout << "YES", 0;
} else if (S[ni][nj] == '.') {
ni += dx[k], nj += dy[k];
if (S[ni][nj] == 'x') return cout << "YES", 0;
}
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void deba(int* a, int n) {
cerr << "| ";
for (int i = 0; i < (n); i++) cerr << a[i] << " ";
cerr << "|" << endl;
}
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 30;
char m[10][10];
int v[10][10];
bool yes(int i, int j) {
if (v[i][j] + v[i - 1][j] + v[i + 1][j] >= 2) return true;
if (v[i][j] + v[i][j - 1] + v[i][j + 1] >= 2) return true;
if (v[i][j] + v[i + 1][j + 1] + v[i - 1][j - 1] >= 2) return true;
if (v[i][j] + v[i - 1][j + 1] + v[i + 1][j - 1] >= 2) return true;
return false;
}
int main() {
for (int i = 0; i < (10); i++)
for (int j = 0; j < (10); j++) v[i][j] = -100;
for (int i = (1); i <= (4); i++) scanf("%s", m[i] + 1);
for (int i = (1); i <= (4); i++)
for (int j = (1); j <= (4); j++) {
if (m[i][j] == '.') v[i][j] = 0;
if (m[i][j] == 'x') v[i][j] = 1;
}
for (int i = (1); i <= (4); i++)
for (int j = (1); j <= (4); j++) {
if (yes(i, j)) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char grid[4][4];
bool winner(char c) {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
int ver = 0, hor = 0, crs1 = 0, crs2 = 0;
for (int k = 0; k < 3; ++k) {
if (i + k < 4) ver += grid[i + k][j] == c;
if (j + k < 4) hor += grid[i][j + k] == c;
if (i + k < 4 && j + k < 4) crs1 += grid[i + k][j + k] == c;
if (i + k < 4 && j - k >= 0) crs2 += grid[i + k][j - k] == c;
}
if (ver == 3 || hor == 3 || crs1 == 3 || crs2 == 3) {
return true;
}
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int os = 0, xs = 0;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
cin >> grid[i][j];
os += grid[i][j] == 'o';
xs += grid[i][j] == 'x';
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (grid[i][j] == '.') {
grid[i][j] = (os == xs) ? 'x' : 'o';
if (winner(grid[i][j])) {
cout << "YES\n";
return 0;
}
grid[i][j] = '.';
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
char table[10][10];
bool check() {
for (int i = 0; i < 4; i++) {
if (table[i][0] == 'x' && table[i][1] == 'x' && table[i][2] == 'x')
return true;
if (table[i][3] == 'x' && table[i][1] == 'x' && table[i][2] == 'x')
return true;
}
for (int i = 0; i < 4; i++) {
if (table[0][i] == 'x' && table[1][i] == 'x' && table[2][i] == 'x')
return true;
if (table[3][i] == 'x' && table[1][i] == 'x' && table[2][i] == 'x')
return true;
}
for (int i = 0; i < 2; i++) {
if (table[i][0] == 'x' && table[i + 1][1] == 'x' && table[i + 2][2] == 'x')
return true;
if (table[i][1] == 'x' && table[i + 1][2] == 'x' && table[i + 2][3] == 'x')
return true;
if (table[i][2] == 'x' && table[i + 1][1] == 'x' && table[i + 2][0] == 'x')
return true;
if (table[i][3] == 'x' && table[i + 1][2] == 'x' && table[i + 2][1] == 'x')
return true;
}
return false;
}
int main() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
scanf("%c", &table[i][j]);
}
getchar();
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (table[i][j] == '.') {
table[i][j] = 'x';
if (check()) {
printf("YES");
return 0;
} else {
table[i][j] = '.';
}
}
}
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
char a[6][6];
int main() {
int i, j, ok = 0;
for (i = 1; i <= 4; i++) {
for (j = 1; j <= 4; j++) a[i][j] = fgetc(stdin);
fgetc(stdin);
}
ok = 0;
for (i = 1; i <= 4; i++) {
for (j = 1; j <= 4; j++) {
if ((a[i][j] == 'x' && a[i - 1][j] == 'x' && a[i + 1][j] == '.') ||
(a[i][j] == 'x' && a[i + 1][j] == 'x' && a[i - 1][j] == '.') ||
(a[i + 1][j] == 'x' && a[i - 1][j] == 'x' && a[i][j] == '.'))
ok = 1;
if ((a[i][j] == 'x' && a[i][j - 1] == 'x' && a[i][j + 1] == '.') ||
(a[i][j] == 'x' && a[i][j + 1] == 'x' && a[i][j - 1] == '.') ||
(a[i][j - 1] == 'x' && a[i][j + 1] == 'x' && a[i][j] == '.'))
ok = 1;
if ((a[i][j] == 'x' && a[i - 1][j - 1] == 'x' &&
a[i + 1][j + 1] == '.') ||
(a[i][j] == 'x' && a[i + 1][j + 1] == 'x' &&
a[i - 1][j - 1] == '.') ||
(a[i - 1][j - 1] == 'x' && a[i + 1][j + 1] == 'x' && a[i][j] == '.'))
ok = 1;
if ((a[i][j] == 'x' && a[i + 1][j - 1] == 'x' &&
a[i - 1][j + 1] == '.') ||
(a[i][j] == 'x' && a[i - 1][j + 1] == 'x' &&
a[i + 1][j - 1] == '.') ||
(a[i + 1][j - 1] == 'x' && a[i - 1][j + 1] == 'x' && a[i][j] == '.'))
ok = 1;
}
}
if (ok == 1)
printf("YES");
else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<string> s(4);
int n, i, j, k, a, b, x, y, t;
cin >> s[0] >> s[1] >> s[2] >> s[3];
int v[4][2] = {1, 0, 1, 1, 0, 1, 1, -1};
bool found = false;
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
for (k = 0; k < 4; k++) {
a = 0;
b = 0;
for (t = 0; t < 3; t++) {
x = i + v[k][0] * t;
y = j + v[k][1] * t;
if ((x >= 0) && (x < 4) && (y >= 0) && (y < 4)) {
if (s[x][y] == 'x') a++;
if (s[x][y] == '.') b++;
}
}
if ((a == 2) && (b == 1)) found = true;
}
}
}
if (found)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c, d;
cin >> a >> b >> c >> d;
if (((a[0] == 'x' && b[1] == 'x') && c[2] == '.') ||
(((a[0] == 'x' && b[1] == '.') && c[2] == 'x') ||
((a[0] == '.' && b[1] == 'x') && c[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[1] == 'x' && b[2] == 'x') && c[3] == '.') ||
(((a[1] == 'x' && b[2] == '.') && c[3] == 'x') ||
((a[1] == '.' && b[2] == 'x') && c[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[0] == 'x' && c[1] == 'x') && d[2] == '.') ||
(((b[0] == 'x' && c[1] == '.') && d[2] == 'x') ||
((b[0] == '.' && c[1] == 'x') && d[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[1] == 'x' && c[2] == 'x') && d[3] == '.') ||
(((b[1] == 'x' && c[2] == '.') && d[3] == 'x') ||
((b[1] == '.' && c[2] == 'x') && d[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[0] == 'x' && b[1] == 'x') && c[2] == '.') ||
(((a[0] == 'x' && b[1] == '.') && c[2] == 'x') ||
((a[0] == '.' && b[1] == 'x') && c[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[3] == 'x' && b[2] == 'x') && c[1] == '.') ||
(((a[3] == 'x' && b[2] == '.') && c[1] == 'x') ||
((a[3] == '.' && b[2] == 'x') && c[1] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[2] == 'x' && b[1] == 'x') && c[0] == '.') ||
(((a[2] == 'x' && b[1] == '.') && c[0] == 'x') ||
((a[2] == '.' && b[1] == 'x') && c[0] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[2] == 'x' && c[1] == 'x') && d[0] == '.') ||
(((b[2] == 'x' && c[1] == '.') && d[0] == 'x') ||
((b[2] == '.' && c[1] == 'x') && d[0] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[3] == 'x' && c[2] == 'x') && d[1] == '.') ||
(((b[3] == 'x' && c[2] == '.') && d[1] == 'x') ||
((b[3] == '.' && c[2] == 'x') && d[1] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[0] == 'x' && a[1] == 'x') && a[2] == '.') ||
(((a[0] == 'x' && a[1] == '.') && a[2] == 'x') ||
((a[0] == '.' && a[1] == 'x') && a[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[1] == 'x' && a[2] == 'x') && a[3] == '.') ||
(((a[1] == 'x' && a[2] == '.') && a[3] == 'x') ||
((a[1] == '.' && a[2] == 'x') && a[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[0] == 'x' && b[1] == 'x') && b[2] == '.') ||
(((b[0] == 'x' && b[1] == '.') && b[2] == 'x') ||
((b[0] == '.' && b[1] == 'x') && b[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[1] == 'x' && b[2] == 'x') && b[3] == '.') ||
(((b[1] == 'x' && b[2] == '.') && b[3] == 'x') ||
((b[1] == '.' && b[2] == 'x') && b[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((c[0] == 'x' && c[1] == 'x') && c[2] == '.') ||
(((c[0] == 'x' && c[1] == '.') && c[2] == 'x') ||
((c[0] == '.' && c[1] == 'x') && c[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((c[1] == 'x' && c[2] == 'x') && c[3] == '.') ||
(((c[1] == 'x' && c[2] == '.') && c[3] == 'x') ||
((c[1] == '.' && c[2] == 'x') && c[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((d[0] == 'x' && d[1] == 'x') && d[2] == '.') ||
(((d[0] == 'x' && d[1] == '.') && d[2] == 'x') ||
((d[0] == '.' && d[1] == 'x') && d[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((d[1] == 'x' && d[2] == 'x') && d[3] == '.') ||
(((d[1] == 'x' && d[2] == '.') && d[3] == 'x') ||
((d[1] == '.' && d[2] == 'x') && d[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[0] == 'x' && b[0] == 'x') && c[0] == '.') ||
(((a[0] == 'x' && b[0] == '.') && c[0] == 'x') ||
((a[0] == '.' && b[0] == 'x') && c[0] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[0] == 'x' && c[0] == 'x') && d[0] == '.') ||
(((b[0] == 'x' && c[0] == '.') && d[0] == 'x') ||
((b[0] == '.' && c[0] == 'x') && d[0] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[1] == 'x' && b[1] == 'x') && c[1] == '.') ||
(((a[1] == 'x' && b[1] == '.') && c[1] == 'x') ||
((a[1] == '.' && b[1] == 'x') && c[1] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[1] == 'x' && c[1] == 'x') && d[1] == '.') ||
(((b[1] == 'x' && c[1] == '.') && d[1] == 'x') ||
((b[1] == '.' && c[1] == 'x') && d[1] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[2] == 'x' && b[2] == 'x') && c[2] == '.') ||
(((a[2] == 'x' && b[2] == '.') && c[2] == 'x') ||
((a[2] == '.' && b[2] == 'x') && c[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[2] == 'x' && c[2] == 'x') && d[2] == '.') ||
(((b[2] == 'x' && c[2] == '.') && d[2] == 'x') ||
((b[2] == '.' && c[2] == 'x') && d[2] == 'x'))) {
cout << "YES";
return 0;
} else if (((a[3] == 'x' && b[3] == 'x') && c[3] == '.') ||
(((a[3] == 'x' && b[3] == '.') && c[3] == 'x') ||
((a[3] == '.' && b[3] == 'x') && c[3] == 'x'))) {
cout << "YES";
return 0;
} else if (((b[3] == 'x' && c[3] == 'x') && d[3] == '.') ||
(((b[3] == 'x' && c[3] == '.') && d[3] == 'x') ||
((b[3] == '.' && c[3] == 'x') && d[3] == 'x'))) {
cout << "YES";
return 0;
} else {
cout << "NO";
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
const double EPS = 1e-9;
const long long MOD = (long long)(1e9 + 7);
const long long MAXV = (long long)(5e4 + 10);
const long long MAXE = (long long)(3e4 + 10);
char mat[5][5];
int cf[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int cc[] = {-1, 0, 1, 1, 1, 0, -1, -1};
bool walk(int a, int b, int k) {
int cont = 0;
int equis = 0;
while (1) {
if (a >= 4 || a < 0 || b >= 4 || b < 0 || cont >= 3) break;
if (mat[a][b] == 'x') equis++;
a = a + cf[k];
b = b + cc[k];
cont++;
}
return equis == 3;
}
bool check(int a, int b) {
mat[a][b] = 'x';
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 8; k++) {
if (walk(i, j, k)) {
mat[a][b] = '.';
return true;
}
}
}
mat[a][b] = '.';
return false;
}
bool vacio = true;
int main() {
for (int i = 0; i < 4; i++) scanf("%s", &mat[i]);
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (mat[i][j] != '.') vacio = false;
if (mat[i][j] == '.')
if (check(i, j)) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, t, k, mx, mn = 1e9 + 5, a, b, c, z, cnt, ans;
int main() {
string ar[4];
for (int i = 0; i < 4; i++) {
cin >> ar[i];
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if ((ar[i][j] + ar[i + 1][j] + ar[i + 2][j] == 286) or
(ar[i][j] + ar[i][j + 1] + ar[i][j + 2] == 286) or
(ar[i][j] + ar[i + 1][j + 1] + ar[i + 2][j + 2] == 286) or
(ar[i][j] + ar[i + 1][j - 1] + ar[i + 2][j - 2] == 286)) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int st = 0;
char c[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> c[i][j];
}
}
for (int i = 0; i < 4 && st == 0; i++) {
for (int j = 0; j < 4 && st == 0; j++) {
if (c[i][j] == 'x') {
if (j > 0 && j < 3) {
if ((c[i][j - 1] == '.' && c[i][j + 1] == 'x') ||
(c[i][j - 1] == 'x' && c[i][j + 1] == '.'))
st = 1;
}
if (j < 2) {
if ((c[i][j + 1] == '.' && c[i][j + 2] == 'x') ||
(c[i][j + 1] == 'x' && c[i][j + 2] == '.'))
st = 1;
}
if (i > 0 && i < 3) {
if ((c[i - 1][j] == '.' && c[i + 1][j] == 'x') ||
(c[i - 1][j] == 'x' && c[i + 1][j] == '.'))
st = 1;
}
if (i < 2) {
if ((c[i + 1][j] == '.' && c[i + 2][j] == 'x') ||
(c[i + 1][j] == 'x' && c[i + 2][j] == '.'))
st = 1;
}
if (i > 0 && i < 3 && j > 0 && j < 3) {
if ((c[i - 1][j - 1] == '.' && c[i + 1][j + 1] == 'x') ||
(c[i - 1][j - 1] == 'x' && c[i + 1][j + 1] == '.'))
st = 1;
}
if (i < 2 && j < 2) {
if ((c[i + 1][j + 1] == '.' && c[i + 2][j + 2] == 'x') ||
(c[i + 1][j + 1] == 'x' && c[i + 2][j + 2] == '.'))
st = 1;
}
if (i > 0 && i < 3 && j > 0 && j < 3) {
if ((c[i + 1][j - 1] == '.' && c[i - 1][j + 1] == 'x') ||
(c[i + 1][j - 1] == 'x' && c[i - 1][j + 1] == '.'))
st = 1;
}
if (i < 2 && j > 1) {
if ((c[i + 1][j - 1] == '.' && c[i + 2][j - 2] == 'x') ||
(c[i + 1][j - 1] == 'x' && c[i + 2][j - 2] == '.'))
st = 1;
}
}
}
}
if (st == 1)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int ok;
char a[10][10];
int check(int i, int j) {
if ((a[i][j + 1] == '.' && a[i][j + 2] == 'x') ||
(a[i][j + 1] == 'x' && a[i][j + 2] == '.') && j + 2 <= 4)
return 1;
if ((a[i][j - 1] == '.' && a[i][j - 2] == 'x') ||
(a[i][j - 1] == 'x' && a[i][j - 2] == '.') && j - 2 >= 1)
return 1;
if ((a[i + 1][j] == '.' && a[i + 2][j] == 'x') ||
(a[i + 1][j] == 'x' && a[i + 2][j] == '.') && i + 2 <= 4)
return 1;
if ((a[i - 1][j] == '.' && a[i - 2][j] == 'x') ||
(a[i - 1][j] == 'x' && a[i - 2][j] == '.') && i - 2 >= 1)
return 1;
if ((a[i + 1][j + 1] == '.' && a[i + 2][j + 2] == 'x') ||
(a[i + 1][j + 1] == 'x' && a[i + 2][j + 2] == '.') && i + 2 <= 4 &&
j + 2 <= 4)
return 1;
if ((a[i - 1][j - 1] == '.' && a[i - 2][j - 2] == 'x') ||
(a[i - 1][j - 1] == 'x' && a[i - 2][j - 2] == '.') && i - 2 >= 1 &&
j - 2 >= 1)
return 1;
if ((a[i - 1][j + 1] == '.' && a[i - 2][j + 2] == 'x') ||
(a[i - 1][j + 1] == 'x' && a[i - 2][j + 2] == '.') && i - 2 >= 1 &&
j + 2 <= 4)
return 1;
if ((a[i + 1][j - 1] == '.' && a[i + 2][j - 2] == 'x') ||
(a[i + 1][j - 1] == 'x' && a[i + 2][j - 2] == '.') && i + 2 <= 4 &&
j - 2 >= 1)
return 1;
return 0;
}
int main() {
for (int i = 1; i <= 4; ++i)
for (int j = 1; j <= 4; ++j) cin >> a[i][j];
for (int i = 1; i <= 4; ++i)
for (int j = 1; j <= 4; ++j)
if (a[i][j] == 'x') {
if (check(i, j) == 1) {
cout << "YES";
ok = 1;
return 0;
}
}
if (ok == 0) cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int judge(int b[4][4]) {
for (int i = 0; i < 4; i++) {
if (b[i][0] == 1 && b[i][1] == 1 && b[i][2] == 1) return 1;
if (b[i][1] == 1 && b[i][2] == 1 && b[i][3] == 1) return 1;
if (b[0][i] == 1 && b[1][i] == 1 && b[2][i] == 1) return 1;
if (b[1][i] == 1 && b[2][i] == 1 && b[3][i] == 1) return 1;
}
if (b[0][0] == 1 && b[1][1] == 1 && b[2][2] == 1) return 1;
if (b[1][1] == 1 && b[2][2] == 1 && b[3][3] == 1) return 1;
if (b[1][0] == 1 && b[2][1] == 1 && b[3][2] == 1) return 1;
if (b[0][1] == 1 && b[1][2] == 1 && b[2][3] == 1) return 1;
if (b[0][3] == 1 && b[1][2] == 1 && b[2][1] == 1) return 1;
if (b[1][2] == 1 && b[2][1] == 1 && b[3][0] == 1) return 1;
if (b[0][2] == 1 && b[1][1] == 1 && b[2][0] == 1) return 1;
if (b[1][3] == 1 && b[2][2] == 1 && b[3][1] == 1) return 1;
return 0;
}
int main() {
int a[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
char c;
c = getchar();
if (c == 'x')
a[i][j] = 1;
else if (c == 'o')
a[i][j] = 2;
else
a[i][j] = 0;
}
getchar();
}
int b[4][4];
int flag = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[i][j] == 0) {
for (int ii = 0; ii < 4; ii++) {
for (int jj = 0; jj < 4; jj++) {
b[ii][jj] = a[ii][jj];
}
}
b[i][j] = 1;
if (judge(b)) {
flag = 1;
}
}
}
}
if (flag)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using std::cin;
using std::string;
int main() {
char board[4][4];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> board[i][j];
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (board[i][j] == 'x' && board[i][j + 1] == 'x' && j <= 2)
if (((j > 0) && (board[i][j - 1] == '.')) ||
((j <= 1) && (board[i][j + 2] == '.'))) {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i][j + 2] == 'x' && j <= 1)
if (board[i][j + 1] == '.') {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 1][j] == 'x' && i <= 2 && j <= 3)
if (((i > 0) && (board[i - 1][j] == '.')) ||
((i <= 1) && (board[i + 2][j] == '.'))) {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 2][j] == 'x' && i <= 1 && j <= 3)
if (board[i + 1][j] == '.') {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 1][j + 1] == 'x' && i <= 2 && j <= 2)
if (((i > 0 && j > 0) && (board[i - 1][j - 1] == '.')) ||
((i <= 1 && j <= 1) && (board[i + 2][j + 2] == '.'))) {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 2][j + 2] == 'x' && i <= 1 && j <= 1)
if (board[i + 1][j + 1] == '.') {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 1][j - 1] == 'x' && i <= 2 && j > 0)
if (((i > 0 && j <= 2) && (board[i - 1][j + 1] == '.')) ||
((j > 1) && (board[i + 2][j - 2] == '.'))) {
printf("YES\n");
return 0;
}
if (board[i][j] == 'x' && board[i + 2][j - 2] == 'x' && i <= 1 && j > 1)
if (board[i + 1][j - 1] == '.' && j > 0) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const double EPS = 1e-10;
double zero(double d) { return d < EPS ? 0.0 : d; }
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
os << '[';
for (int i = 0; i < (int)(a.size()); i++) os << (i ? " " : "") << a[i];
return os << ']';
}
string toString(int i) {
stringstream ss;
ss << i;
return ss.str();
}
const int MOD = 1000000007;
long long fpow(long long a, long long k, int M) {
long long res = 1ll;
long long x = a;
while (k != 0) {
if ((k & 1) == 1) res = (res * x) % M;
x = (x * x) % M;
k >>= 1;
}
return res;
}
struct prepare {
prepare() {
cout.setf(ios::fixed, ios::floatfield);
cout.precision(8);
ios_base::sync_with_stdio(false);
}
} _prepare;
pair<int, int> cnt(string s) {
pair<int, int> c = make_pair(0, 0);
for (int i = 0; i < (int)(s.size()); i++) {
if (s[i] == 'o')
c.first++;
else if (s[i] == 'x')
c.second++;
}
return c;
}
bool solve() {
vector<string> fi(4);
for (int i = 0; i < (int)(4); i++) {
cin >> fi[i];
}
for (int r = 0; r < (int)(4); r++) {
for (int c = 0; c < (int)(2); c++) {
pair<int, int> cn = cnt(fi[r].substr(c, 3));
if (cn.first == 0 && cn.second == 2) return true;
}
}
for (int c = 0; c < (int)(4); c++) {
for (int r = 0; r < (int)(2); r++) {
stringstream ss;
ss << fi[r][c];
ss << fi[r + 1][c];
ss << fi[r + 2][c];
pair<int, int> cn = cnt(ss.str());
if (cn.first == 0 && cn.second == 2) return true;
}
}
for (int r = 0; r < (int)(2); r++) {
for (int c = 0; c < (int)(2); c++) {
stringstream ss;
ss << fi[r][c];
ss << fi[r + 1][c + 1];
ss << fi[r + 2][c + 2];
pair<int, int> cn = cnt(ss.str());
if (cn.first == 0 && cn.second == 2) return true;
}
}
for (int r = 0; r < (int)(2); r++) {
for (int c = 2; c < (int)(4); c++) {
stringstream ss;
ss << fi[r][c];
ss << fi[r + 1][c - 1];
ss << fi[r + 2][c - 2];
pair<int, int> cn = cnt(ss.str());
if (cn.first == 0 && cn.second == 2) return true;
}
}
return false;
}
int main() {
if (solve()) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[4][4], a[4][4];
bool flag = false, n;
void check() {
for (int i = 0; i < 4; i++) {
if (s[i][0] == 'x' && s[i][1] == 'x' && s[i][2] == 'x') flag = 1;
if (s[i][3] == 'x' && s[i][1] == 'x' && s[i][2] == 'x') flag = 1;
}
for (int i = 0; i < 4; i++) {
if (s[0][i] == 'x' && s[1][i] == 'x' && s[2][i] == 'x') flag = 1;
if (s[3][i] == 'x' && s[1][i] == 'x' && s[2][i] == 'x') flag = 1;
}
if (s[0][0] == 'x' && s[1][1] == 'x' && s[2][2] == 'x') flag = 1;
if (s[3][3] == 'x' && s[1][1] == 'x' && s[2][2] == 'x') flag = 1;
if (s[0][3] == 'x' && s[1][2] == 'x' && s[2][1] == 'x') flag = 1;
if (s[1][2] == 'x' && s[2][1] == 'x' && s[3][0] == 'x') flag = 1;
if (s[0][1] == 'x' && s[1][2] == 'x' && s[2][3] == 'x') flag = 1;
if (s[0][2] == 'x' && s[1][1] == 'x' && s[2][0] == 'x') flag = 1;
if (s[1][3] == 'x' && s[2][2] == 'x' && s[3][1] == 'x') flag = 1;
if (s[1][0] == 'x' && s[2][1] == 'x' && s[3][2] == 'x') flag = 1;
}
int main() {
flag = false;
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> s[i][j];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (s[i][j] == '.') {
s[i][j] = 'x';
check();
s[i][j] = '.';
}
}
}
if (flag)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, n, m, k, t, s, z, ans, a[100][100];
char c;
int main() {
for (i = 1; i < 5; i++)
for (j = 1; j < 5; j++) {
c = getchar();
while (c != 'o' && c != 'x' && c != '.') c = getchar();
if (c == 'x') a[i][j] = 1;
if (c == 'o') a[i][j] = 20;
if (c == '.') a[i][j] = 0;
}
for (i = 1; i < 3; i++)
for (j = 1; j < 5; j++)
if (a[i][j] + a[i + 1][j] + a[i + 2][j] == 2) {
printf("YES\n");
return 0;
}
for (i = 1; i < 3; i++)
for (j = 1; j < 5; j++)
if (a[j][i] + a[j][i + 1] + a[j][i + 2] == 2) {
printf("YES\n");
return 0;
}
for (i = 1; i < 3; i++)
for (j = 1; j < 3; j++)
if (a[i][j] + a[i + 1][j + 1] + a[i + 2][j + 2] == 2) {
printf("YES\n");
return 0;
}
for (i = 3; i < 5; i++)
for (j = 1; j < 3; j++)
if (a[i][j] + a[i - 1][j + 1] + a[i - 2][j + 2] == 2) {
printf("YES\n");
return 0;
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[10][10];
int nr;
int dx[] = {-1, 1, 0, 0, -1, 1, 1, -1};
int dy[] = {0, 0, -1, 1, 1, -1, 1, -1};
void Read() {
int i;
for (i = 1; i <= 4; i++) cin >> (a[i] + 1);
}
void Frame() {
int i;
for (i = 0; i <= 5; i++) a[i][0] = a[0][i] = a[i][5] = a[5][i] = 'o';
}
void Solve() {
int i, j, k, ii, jj;
nr = 0;
for (i = 1; i <= 4; i++)
for (j = 1; j <= 4; j++)
if (a[i][j] == 'x') {
for (k = 0; k < 8; k++) {
ii = i + dx[k];
jj = j + dy[k];
if (a[ii][jj] == '.' && a[ii + dx[k]][jj + dy[k]] == 'x') {
cout << "YES\n";
exit(0);
}
if (a[ii][jj] == 'x' && a[ii + dx[k]][jj + dy[k]] == '.') {
cout << "YES\n";
exit(0);
}
}
} else if (a[i][j] == '.') {
for (k = 0; k < 8; k++) {
ii = i + dx[k];
jj = j + dy[k];
if (a[ii][jj] == 'x' && a[ii + dx[k]][jj + dy[k]] == 'x') {
cout << "YES\n";
exit(0);
}
}
}
cout << "NO\n";
}
int main() {
Read();
Frame();
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> b[20000 + 10];
const int INF = 1000000;
string a[10];
int main() {
for (int i = 1; i <= 4; i++) {
cin >> a[i];
}
for (int i = 1; i <= 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[i][j] == 'x') {
if (j >= 2 && a[i][j - 2] == '.' && (a[i][j - 1] == 'x') && j >= 2) {
cout << "YES";
return 0;
}
if (j <= 1 && a[i][j + 2] == '.' && (a[i][j + 1] == 'x') && j <= 1) {
cout << "YES";
return 0;
}
if (i <= 1 && a[i + 2][j] == '.' && (a[i + 1][j] == 'x') && i <= 1) {
cout << "YES";
return 0;
}
if (i >= 2 && a[i - 2][j] == '.' && (a[i - 1][j] == 'x') && i >= 2) {
cout << "YES";
return 0;
}
if (i <= 1 && j <= 1 && a[i + 2][j + 2] == '.' &&
a[i + 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (i >= 2 && j >= 2 && a[i - 2][j - 2] == '.' &&
a[i - 1][j - 1] == 'x') {
cout << "YES";
return 0;
}
if (i >= 2 && j <= 1 && a[i - 2][j + 2] == '.' &&
a[i - 1][j + 1] == 'x') {
cout << "YES";
return 0;
}
if (i <= 1 && j >= 2 && a[i + 2][j - 2] == '.' &&
a[i + 1][j - 1] == 'x') {
cout << "YES";
return 0;
}
if (j >= 2 && a[i][j - 2] == 'x' && (a[i][j - 1] == '.') && j >= 2) {
cout << "YES";
return 0;
}
if (j <= 1 && a[i][j + 2] == 'x' && (a[i][j + 1] == '.') && j <= 1) {
cout << "YES";
return 0;
}
if (i <= 1 && a[i + 2][j] == 'x' && (a[i + 1][j] == '.') && i <= 1) {
cout << "YES";
return 0;
}
if (i >= 2 && a[i - 2][j] == 'x' && (a[i - 1][j] == '.') && i >= 2) {
cout << "YES";
return 0;
}
if (i <= 1 && j <= 1 && a[i + 2][j + 2] == 'x' &&
a[i + 1][j + 1] == '.') {
cout << "YES";
return 0;
}
if (i >= 2 && j >= 2 && a[i - 2][j - 2] == 'x' &&
a[i - 1][j - 1] == '.') {
cout << "YES";
return 0;
}
if (i >= 2 && j <= 1 && a[i - 2][j + 2] == 'x' &&
a[i - 1][j + 1] == '.') {
cout << "YES";
return 0;
}
if (i <= 1 && j >= 2 && a[i + 2][j - 2] == 'x' &&
a[i + 1][j - 1] == '.') {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long n) {
if (a == 0) return 0;
if (a == 1 || n == 0) return 1;
if (n == 1) return a % 1000000007;
long long t = power(a, n / 2);
t = t * t % 1000000007;
if (n & 1) return t * a % 1000000007;
return t;
}
int popcount(long long a) {
int c = 0;
while (a) {
c++;
a -= a & -a;
}
return c;
}
void factorize(int a) {}
void update(int tree[], int idx, int val, int maxval) {
for (; idx <= maxval; idx += idx & -idx) {
tree[idx] += val;
}
}
int read(int tree[], int idx) {
long long sum = 0;
for (; idx > 0; idx -= idx & -idx) {
sum += tree[idx];
}
return sum;
}
struct node2 {
int id, val;
node2() {
static int ctx = 1;
id = ctx++;
};
node2(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
val = a;
}
};
struct comp2 {
bool operator()(int a, int b) { return b < a; }
};
bool cmp2(int a, int b) { return b < a; }
struct node {
int id, val;
node() {
static int ctx = 1;
id = ctx++;
};
node(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
val = a;
}
};
struct comp {
bool operator()(int a, int b) { return b < a; }
};
bool cmp(int a, int b) { return b < a; }
int n, m, a, b, c, d, k, h, w, x, y, p, q, t, ans, res, ma, mi, T,
act = 0, pas = 1, cur, flag, now;
int dp[10][10];
char s[10][10];
double e, f, z;
vector<int> v[1], vec;
set<int> sett;
map<int, int> mapp;
void print() {}
void print2() {}
void input() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 4; i++) cin >> s[i];
}
bool check(int i, int j) {
s[i][j] = 'x';
if (j - 1 >= 0 && s[i][j - 1] == 'x') {
if (j - 2 >= 0 && s[i][j - 2] == 'x') return 1;
if (j + 1 < 4 && s[i][j + 1] == 'x') return 1;
}
if (j + 2 < 4 && s[i][j + 1] == 'x' && s[i][j + 2] == 'x') return 1;
if (i - 1 >= 0 && s[i - 1][j] == 'x') {
if (i - 2 >= 0 && s[i - 2][j] == 'x') return 1;
if (i + 1 < 4 && s[i + 1][j] == 'x') return 1;
}
if (i + 2 < 4 && s[i + 1][j] == 'x' && s[i + 2][j] == 'x') return 1;
if (j - 1 >= 0 && i - 1 >= 0 && s[i - 1][j - 1] == 'x') {
if (j - 2 >= 0 && i - 2 >= 0 && s[i - 2][j - 2] == 'x') return 1;
if (j + 1 < 4 && i + 1 < 4 && s[i + 1][j + 1] == 'x') return 1;
}
if (j + 2 < 4 && i + 2 < 4 && s[i + 1][j + 1] == 'x' &&
s[i + 2][j + 2] == 'x')
return 1;
if (j + 1 < 4 && i - 1 >= 0 && s[i - 1][j + 1] == 'x') {
if (j + 2 < 4 && i - 2 >= 0 && s[i - 2][j + 2] == 'x') return 1;
if (j - 1 >= 0 && i + 1 < 4 && s[i + 1][j - 1] == 'x') return 1;
}
if (j - 2 >= 0 && i + 2 < 4 && s[i + 2][j - 2] == 'x' &&
s[i + 1][j - 1] == 'x')
return 1;
s[i][j] = '.';
return 0;
}
void solve() {
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) {
if (s[i][j] == '.') {
if (check(i, j)) {
flag = 1;
return;
}
}
}
}
void output() {
if (flag == 1)
cout << "YES";
else
cout << "NO";
}
int main() {
input();
solve();
output();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char x[10][10];
int main() {
for (int i = (0); i < (4); i++) cin >> x[i];
int f = 0;
for (int i = (0); i < (4); i++) {
for (int j = (0); j < (2); j++) {
f |= (x[i][j] == 'x' && x[i][j + 1] == '.' && x[i][j + 2] == 'x');
f |= (x[i][j] == '.' && x[i][j + 1] == 'x' && x[i][j + 2] == 'x');
f |= (x[i][j] == 'x' && x[i][j + 1] == 'x' && x[i][j + 2] == '.');
}
}
for (int j = (0); j < (4); j++) {
for (int i = (0); i < (2); i++) {
f |= (x[i][j] == 'x' && x[i + 1][j] == 'x' && x[i + 2][j] == '.');
f |= (x[i][j] == 'x' && x[i + 1][j] == '.' && x[i + 2][j] == 'x');
f |= (x[i][j] == '.' && x[i + 1][j] == 'x' && x[i + 2][j] == 'x');
}
}
for (int i = (0); i < (2); i++) {
for (int j = (0); j < (2); j++) {
f |= (x[i][j] == 'x' && x[i + 1][j + 1] == 'x' && x[i + 2][j + 2] == '.');
f |= (x[i][j] == 'x' && x[i + 1][j + 1] == '.' && x[i + 2][j + 2] == 'x');
f |= (x[i][j] == '.' && x[i + 1][j + 1] == 'x' && x[i + 2][j + 2] == 'x');
}
}
for (int i = (0); i < (2); i++) {
for (int j = (2); j < (4); j++) {
f |= (x[i][j] == 'x' && x[i + 1][j - 1] == 'x' && x[i + 2][j - 2] == '.');
f |= (x[i][j] == 'x' && x[i + 1][j - 1] == '.' && x[i + 2][j - 2] == 'x');
f |= (x[i][j] == '.' && x[i + 1][j - 1] == 'x' && x[i + 2][j - 2] == 'x');
}
}
if (f)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
int s(char a, char b, char c) { return a == b && b == c; }
int win(char cc[5][5]) {
int i, j;
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
if (cc[i][j] == 'x') {
if (i >= 2 && s(cc[i][j], cc[i - 1][j], cc[i - 2][j])) return 1;
if (j >= 2 && s(cc[i][j], cc[i][j - 1], cc[i][j - 2])) return 1;
if (i < 2 && j < 2 && s(cc[i][j], cc[i + 1][j + 1], cc[i + 2][j + 2]))
return 1;
if (i >= 2 && j < 2 && s(cc[i][j], cc[i - 1][j + 1], cc[i - 2][j + 2]))
return 1;
}
return 0;
}
int main() {
static char cc[5][5];
int i, j;
for (i = 0; i < 4; i++) scanf("%s", cc[i]);
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
if (cc[i][j] == '.') {
cc[i][j] = 'x';
if (win(cc)) {
printf("YES\n");
return 0;
}
cc[i][j] = '.';
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int f[10][10];
bool ok;
bool cty() {
for (int i = 1; i <= 4; i++) {
for (int j = 1; j <= 4; j++) {
if (f[i][j] == 'x' && f[i + 1][j] == 'x' && f[i + 2][j] == 'x') return 1;
if (f[i][j] == 'x' && f[i][j + 1] == 'x' && f[i][j + 2] == 'x') return 1;
if (f[i][j] == 'x' && f[i + 1][j + 1] == 'x' && f[i + 2][j + 2] == 'x')
return 1;
}
}
for (int i = 3; i <= 4; i++) {
for (int j = 1; j <= 4; j++)
if (f[i][j] == 'x' && f[i - 1][j + 1] == 'x' && f[i - 2][j + 2] == 'x')
return 1;
}
return 0;
}
int main() {
for (int i = 1; i <= 4; i++) {
for (int j = 1; j <= 4; j++) {
char c;
scanf(" %c", &c);
f[i][j] = c;
}
}
for (int i = 1; i <= 4; i++) {
for (int j = 1; j <= 4; j++) {
if (f[i][j] != '.') continue;
f[i][j] = 'x';
if (cty()) ok = 1;
f[i][j] = '.';
}
}
puts(ok ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[101][101];
int main() {
int n = 4;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 'x' && a[i][j + 1] == 'x' && a[i][j + 2] == '.') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i][j + 1] == '.' && a[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == '.' && a[i][j + 1] == 'x' && a[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j] == 'x' && a[i + 2][j] == '.') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j] == '.' && a[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == '.' && a[i + 1][j] == 'x' && a[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j + 1] == 'x' && a[i + 2][j + 2] == '.') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j + 1] == '.' && a[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == '.' && a[i + 1][j + 1] == 'x' && a[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j - 1] == 'x' && a[i + 2][j - 2] == '.') {
cout << "YES";
return 0;
}
if (a[i][j] == 'x' && a[i + 1][j - 1] == '.' && a[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
if (a[i][j] == '.' && a[i + 1][j - 1] == 'x' && a[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[i][j] == 'x') {
if (a[i + 1][j] == '.' && i + 2 < 4) {
if (a[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
} else if (a[i + 1][j] == 'x' && i + 2 < 4) {
if (a[i + 2][j] == '.') {
cout << "YES";
return 0;
}
}
if (a[i + 1][j + 1] == '.' && i + 2 < 4 && j + 2 < 4) {
if (a[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
} else if (a[i + 1][j + 1] == 'x' && i + 2 < 4 && j + 2 < 4) {
if (a[i + 2][j + 2] == '.') {
cout << "YES";
return 0;
}
}
if (a[i + 1][j - 1] == '.' && i + 2 < 4 && j - 2 > -1) {
if (a[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
} else if (a[i + 1][j - 1] == 'x' && i + 2 < 4 && j - 2 > -1) {
if (a[i + 2][j - 2] == '.') {
cout << "YES";
return 0;
}
}
if (a[i][j + 1] == '.' && j + 2 < 4) {
if (a[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
} else if (a[i][j + 1] == 'x' && j + 2 < 4) {
if (a[i][j + 2] == '.') {
cout << "YES";
return 0;
}
}
} else if (a[i][j] == '.') {
if (a[i + 1][j] == 'x' && i + 2 < 4) {
if (a[i + 2][j] == 'x') {
cout << "YES";
return 0;
}
}
if (a[i + 1][j + 1] == 'x' && i + 2 < 4 && j + 2 < 4) {
if (a[i + 2][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
if (a[i + 1][j - 1] == 'x' && i + 2 < 4 && j - 2 > -1) {
if (a[i + 2][j - 2] == 'x') {
cout << "YES";
return 0;
}
}
if (a[i][j + 1] == 'x' && j + 2 < 4) {
if (a[i][j + 2] == 'x') {
cout << "YES";
return 0;
}
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[4][4];
bool c1() {
int dot, cross;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 4; j++) {
dot = 0;
cross = 0;
for (int k = i; k <= i + 2; k++) {
if (a[k][j] == '.')
dot++;
else if (a[k][j] == 'x')
cross++;
}
if (dot == 1 && cross == 2) return 1;
}
}
return 0;
}
bool c2() {
int dot, cross;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 2; j++) {
dot = 0;
cross = 0;
for (int k = j; k <= j + 2; k++) {
if (a[i][k] == '.')
dot++;
else if (a[i][k] == 'x')
cross++;
}
if (dot == 1 && cross == 2) return 1;
}
}
return 0;
}
bool c3() {
int dot, cross;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
dot = 0;
cross = 0;
if (a[i][j] == '.')
dot++;
else if (a[i][j] == 'x')
cross++;
if (a[i + 1][j + 1] == '.')
dot++;
else if (a[i + 1][j + 1] == 'x')
cross++;
if (a[i + 2][j + 2] == '.')
dot++;
else if (a[i + 2][j + 2] == 'x')
cross++;
if (dot == 1 && cross == 2) return 1;
}
}
return 0;
}
bool c4() {
int dot, cross;
for (int i = 0; i < 2; i++) {
for (int j = 2; j < 4; j++) {
dot = 0;
cross = 0;
if (a[i][j] == '.')
dot++;
else if (a[i][j] == 'x')
cross++;
if (a[i + 1][j - 1] == '.')
dot++;
else if (a[i + 1][j - 1] == 'x')
cross++;
if (a[i + 2][j - 2] == '.')
dot++;
else if (a[i + 2][j - 2] == 'x')
cross++;
if (dot == 1 && cross == 2) return 1;
}
}
return 0;
}
int main() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
cin >> a[i][j];
}
}
if (c1() || c2() || c3() || c4())
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> field(4);
bool check_row(int row) {
if (field[row][1] == field[row][2] && field[row][1] == 'x' &&
(field[row][0] == 'x' || field[row][3] == 'x'))
return true;
return false;
}
bool check_col(int col) {
if (field[1][col] == field[2][col] && field[1][col] == 'x' &&
(field[0][col] == 'x' || field[3][col] == 'x'))
return true;
return false;
}
bool check_main_diag() {
if (field[1][1] == field[2][2] && field[1][1] == 'x' &&
(field[0][0] == 'x' || field[3][3] == 'x'))
return true;
if (field[0][1] == field[1][2] && field[1][2] == field[2][3] &&
field[2][3] == 'x')
return true;
if (field[1][0] == field[2][1] && field[2][1] == field[3][2] &&
field[3][2] == 'x')
return true;
return false;
}
bool check_dop_diag() {
if (field[2][1] == field[1][2] && field[2][1] == 'x' &&
(field[0][3] == 'x' || field[3][0] == 'x'))
return true;
if (field[2][0] == field[1][1] && field[1][1] == field[0][2] &&
field[0][2] == 'x')
return true;
if (field[3][1] == field[2][2] && field[2][2] == field[1][3] &&
field[1][3] == 'x')
return true;
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
for (int i = 0; i < 4; ++i) {
cin >> field[i];
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (field[i][j] == '.') {
field[i][j] = 'x';
for (int k = 0; k < 4; ++k) {
if (check_col(k) || check_row(k)) {
cout << "YES" << endl;
return 0;
}
}
if (check_main_diag() || check_dop_diag()) {
cout << "YES" << endl;
return 0;
}
field[i][j] = '.';
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 2e18;
const double PI = acos(-1.0);
const double E = exp(1);
const double EPS = 1e-8;
const long long mod = 1e4 + 7;
const int maxn = 2e5 + 5;
void pre() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
char mp[10][10];
int main(void) {
for (int i = 0; i < (4); i++)
for (int j = 0; j < (4); j++) cin >> mp[i][j];
for (int i = 0; i < (4); i++)
for (int j = 0; j < (4); j++) {
if (mp[i][j] == '.') {
int cnt = 1;
for (int ii = (i + 1); ii < (4); ii++) {
if (mp[ii][j] == 'x')
cnt++;
else
break;
}
for (int ii = (i - 1); ii >= (0); ii--) {
if (mp[ii][j] == 'x')
cnt++;
else
break;
}
if (cnt >= 3) {
puts("YES");
return 0;
}
cnt = 1;
for (int jj = (j + 1); jj < (4); jj++) {
if (mp[i][jj] == 'x')
cnt++;
else
break;
}
for (int jj = (j - 1); jj >= (0); jj--) {
if (mp[i][jj] == 'x')
cnt++;
else
break;
}
if (cnt >= 3) {
puts("YES");
return 0;
}
cnt = 1;
for (int cc = (1); cc < (4); cc++) {
if (i + cc > 3 || j + cc > 3) break;
if (mp[cc + i][cc + j] == 'x')
cnt++;
else
break;
}
for (int cc = (1); cc < (4); cc++) {
if (i - cc < 0 || j - cc < 0) break;
if (mp[i - cc][j - cc] == 'x')
cnt++;
else
break;
}
if (cnt >= 3) {
puts("YES");
return 0;
}
cnt = 1;
for (int cc = (1); cc < (4); cc++) {
if (i + cc > 3 || j - cc < 0) break;
if (mp[cc + i][j - cc] == 'x')
cnt++;
else
break;
}
for (int cc = (1); cc < (4); cc++) {
if (i - cc < 0 || j + cc > 3) break;
if (mp[i - cc][j + cc] == 'x')
cnt++;
else
break;
}
if (cnt >= 3) {
puts("YES");
return 0;
}
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int n = 4;
char a[5][5];
bool check() {
for (int i = 0; i < n; i++) {
if (a[i][1] != 'x' || a[i][2] != 'x') continue;
if (a[i][0] == 'x' || a[i][3] == 'x') return true;
}
for (int i = 0; i < n; i++) {
if (a[1][i] != 'x' || a[2][i] != 'x') continue;
if (a[0][i] == 'x' || a[3][i] == 'x') return true;
}
if (a[0][2] == 'x' && a[1][1] == 'x' && a[2][0] == 'x') return true;
if (a[1][3] == 'x' && a[2][2] == 'x' && a[3][1] == 'x') return true;
if (a[1][0] == 'x' && a[2][1] == 'x' && a[3][2] == 'x') return true;
if (a[0][1] == 'x' && a[1][2] == 'x' && a[2][3] == 'x') return true;
if (a[1][1] == 'x' && a[2][2] == 'x' && a[0][0] == 'x') return true;
if (a[1][1] == 'x' && a[2][2] == 'x' && a[3][3] == 'x') return true;
if (a[0][3] == 'x' && a[1][2] == 'x' && a[2][1] == 'x') return true;
if (a[3][0] == 'x' && a[1][2] == 'x' && a[2][1] == 'x') return true;
return false;
}
int main() {
for (int i = 0; i < n; i++) scanf("%s", a[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (a[i][j] == '.') {
a[i][j] = 'x';
if (check()) {
printf("YES");
return 0;
}
a[i][j] = '.';
}
printf("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
string arr[5];
string tmp[5];
bool check(int i, int j) {
if (j < 3 && tmp[i][j] == 'x' && tmp[i][j + 1] == 'x' && tmp[i][j + 2] == 'x')
return true;
if (i < 3 && tmp[i][j] == 'x' && tmp[i + 1][j] == 'x' && tmp[i + 2][j] == 'x')
return true;
if (i < 3 && j < 3 && tmp[i][j] == 'x' && tmp[i + 1][j + 1] == 'x' &&
tmp[i + 2][j + 2] == 'x')
return true;
if (i >= 2 && j < 3 && tmp[i][j] == 'x' && tmp[i - 1][j + 1] == 'x' &&
tmp[i - 2][j + 2] == 'x')
return true;
return false;
}
bool valid(int a, int b) {
for (int i = 0; i < 5; i++) tmp[i] = arr[i];
if (tmp[a][b] != '.') return false;
tmp[a][b] = 'x';
bool ans = false;
for (int i = 0; i < 5; i++)
for (int j = 0; j < 5; j++) ans |= check(i, j);
return ans;
}
int main() {
for (int i = 0; i < 5; i++) cin >> arr[i];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (valid(i, j)) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
char board[4][5];
int rPlus[8] = {0, 0, -1, 1, 1, -1, -1, 1};
int cPlus[8] = {-1, 1, 0, 0, -1, 1, -1, 1};
int isPossible(int row, int col);
int numConsecutive(int row, int col, int rPlus, int cPlus);
int main() {
int i, j, found = 0;
for (i = 0; i < 4; i++) {
gets(board[i]);
}
for (i = 0; i < 4; i++) {
for (j = 0; j < 4; j++) {
if (board[i][j] != '.') continue;
if (isPossible(i, j)) {
found = 1;
break;
}
}
if (found) break;
}
if (found)
puts("YES");
else
puts("NO");
return 0;
}
int isPossible(int row, int col) {
int i, cnt = 1;
for (i = 0; i < 8; i++) {
cnt += numConsecutive(row, col, rPlus[i], cPlus[i]);
if (i % 2 == 1) {
if (cnt >= 3) return 1;
cnt = 1;
}
}
return 0;
}
int numConsecutive(int row, int col, int rPlus, int cPlus) {
int ret = 0, rNext = row, cNext = col;
while (1) {
rNext += rPlus;
cNext += cPlus;
if (rNext < 0 || rNext >= 4 || cNext < 0 || cNext >= 4) break;
if (board[rNext][cNext] != 'x') break;
++ret;
}
return ret;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
char t[10][10];
int chk(int x, int y) {
if ((t[x][y - 1] == 'x' && t[x][y + 1] == '.') ||
((t[x][y - 1] == '.' && t[x][y + 1] == 'x')))
return true;
if ((t[x + 1][y] == 'x' && t[x - 1][y] == '.') ||
((t[x + 1][y] == '.' && t[x - 1][y] == 'x')))
return true;
if ((t[x + 1][y] == 'x' && t[x + 2][y] == '.') ||
((t[x + 1][y] == '.' && t[x + 2][y] == 'x')))
return true;
if ((t[x][y + 1] == 'x' && t[x][y + 2] == '.') ||
((t[x][y + 1] == '.' && t[x][y + 2] == 'x')))
return true;
if ((t[x + 1][y - 1] == 'x' && t[x - 1][y + 1] == '.') ||
((t[x + 1][y - 1] == '.' && t[x - 1][y + 1] == 'x')))
return true;
if ((t[x - 1][y - 1] == 'x' && t[x + 1][y + 1] == '.') ||
((t[x - 1][y - 1] == '.' && t[x + 1][y + 1] == 'x')))
return true;
if ((t[x + 1][y + 1] == 'x' && t[x + 2][y + 2] == '.') ||
((t[x + 1][y + 1] == '.' && t[x + 2][y + 2] == 'x')))
return true;
if ((t[x - 1][y + 1] == 'x' && t[x - 2][y + 2] == '.') ||
((t[x - 1][y + 1] == '.' && t[x - 2][y + 2] == 'x')))
return true;
return false;
}
int main() {
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++) cin >> t[i][j];
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 4; j++)
if (t[i][j] == 'x' && chk(i, j)) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
static void call(const char* it) {}
template <typename T, typename... aT>
static void call(const char* it, T a, aT... rest) {
string b;
for (; *it && *it != ','; ++it)
if (*it != ' ') b += *it;
cerr << b << "=" << a << " ";
call(++it, rest...);
}
};
int dr[] = {0, 1, 1, -1, 0, -1, -1, 1};
int dc[] = {1, 0, 1, 1, -1, 0, -1, -1};
char field[4][4];
int dt = 0;
int tour(int r, int c, char c1, char c2, int d) {
if (r < 0 || r > 3 || c < 0 || c > 3) return 0;
if (field[r][c] == c2) {
dt++;
if (dt > 1) return 0;
} else if (field[r][c] != c1)
return 0;
int ans = 1;
ans += tour(r + dr[d], c + dc[d], c1, c2, d);
return ans;
}
int main() {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
};
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4; j++) cin >> field[i][j];
int y = 0;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
if (tour(i, j, 'x', '.', k) == 3) {
y = 1;
break;
}
dt = 0;
}
if (y) break;
}
if (y) break;
}
if (y)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.