# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510291 | 2022-01-14T22:23:11 Z | salamhassan | Tetris (COCI17_tetris) | C++14 | 1 ms | 208 KB |
#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 (a[i][j+1]==a[i][j] && a[i][j+2]==a[i][j] && a[i][j+3]==a[i][j]) { ans[2]++; } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Incorrect | 0 ms | 204 KB | Output isn't correct |