# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111329 | vjudge1 | Tetris (COCI17_tetris) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, m;
char a[N][N];
int b[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (a[i][j] == '.') {
continue;
}
if (i+1 < n && j+1 < m &&
a[i+1][j] == a[i][j] &&
a[i][j+1] == a[i][j] &&
a[i+1][j+1] == a[i][j]) {
++b[0];
}
if (j+3 < m &&
a[i][j+1] == a[i][j] &&
a[i][j+2] == a[i][j] &&
a[i][j+3] == a[i][j]) {
++b[1];
}
if (i+3 < n &&
a[i+1][j] == a[i][j] &&
a[i+2][j] == a[i][j] &&
a[i+3][j] == a[i][j]) {
++b[1];
}
for (int i = 0; i < 5; ++i) {
cout << b[i] << endl;
}
return 0;
}