# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510287 | salamhassan | Tetris (COCI17_tetris) | C++14 | 1 ms | 296 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;
char a[12][12];
int ans[6],n,m;
int main()
{
cin>>n>>m;
for (int i=0; i<n; i++)
{
for (int j=0; j<m; j++)
{
cin>>a[i][j];
}
}
for (int i=0; i<n; i++)
{
for (int j=0; j<m; j++)
{
if (a[i][j]!='.')
{
if (j+3<=m)
{
if (a[i][j+1]==a[i][j] && a[i][j+2]==a[i][j] && a[i][j+3]==a[i][j])
{
ans[2]++;
}
}
if (i+3<=n)
{
if (a[i+1][j]==a[i][j] && a[i+2][j]==a[i][j] && a[i+3][j]==a[i][j])
{
ans[2]++;
}
}
if (a[i][j+1]==a[i][j] && a[i+1][j]==a[i][j] && a[i+1][j+1]==a[i][j])
{
ans[1]++;
}
if (a[i][j+1]==a[i][j] && a[i+1][j]==a[i][j] && a[i+1][j-1]==a[i][j])
ans[3]++;
if (a[i+1][j]==a[i][j] && a[i+1][j+1]==a[i][j] && a[i+2][j+1]==a[i][j])
ans[3]++;
if (a[i][j+1]==a[i][j] && a[i+1][j+1]==a[i][j] && a[i+1][j+2]==a[i][j])
ans[4]++;
if (a[i+1][j]==a[i][j] && a[i+1][j-1]==a[i][j] && a[i+2][j-1]==a[i][j])
ans[4]++;
if (a[i][j+1]==a[i][j] && a[i][j+2]==a[i][j] && a[i-1][j+1]==a[i][j])
ans[5]++;
if (a[i+1][j]==a[i][j] && a[i+2][j]==a[i][j] && a[i+1][j+1]==a[i][j])
ans[5]++;
if (a[i-1][j+1]==a[i][j] && a[i+1][j+1]==a[i][j] && a[i+2][j+1]==a[i][j])
ans[5]++;
if (a[i+1][j-1]==a[i][j] && a[i+1][j]==a[i][j] && a[i+1][j+1]==a[i][j])
ans[5]++;
}
}
}
for (int i=1; i<=5; i++)
cout<<ans[i]<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |