Submission #510193

#TimeUsernameProblemLanguageResultExecution timeMemory
510193Rasoul006Tetris (COCI17_tetris)C++17
80 / 80
1 ms204 KiB
#include <bits/stdc++.h> #define endl "\n" ; typedef long long ll ; using namespace std; char a[19][19]; ll n,m,ans1,ans2,ans3,ans4,ans5; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); 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]==a[i+1][j] && a[i][j] == a[i][j+1] && a[i][j] == a[i+1][j+1] && a[i][j] != '.') ans1++; } } for (int i=0 ; i<n ; i++) { for (int j=0 ; j<m ; j++) { if (a[i][j]==a[i+1][j]&&a[i][j]==a[i+2][j]&&a[i][j]==a[i+3][j]&& a[i][j] != '.') ans2++; if (a[i][j]==a[i][j+1]&&a[i][j]==a[i][j+2]&&a[i][j]==a[i][j+3] && a[i][j] != '.') ans2++; } } for (int i=0 ; i<n ; i++) { for (int j=0 ; j<m ; j++) { if (a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j-1] && a[i][j] == a[i][j+1] && a[i][j] != '.') ans3++; if (a[i][j] == a[i-1][j] && a[i][j] == a[i][j+1] && a[i][j] == a[i+1][j+1] && a[i][j] != '.') ans3++; } } for (int i=0 ; i<n ; i++) { for (int j=0 ; j<m ; j++) { if (a[i][j] == a[i][j-1] && a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j+1] && a[i][j] != '.') ans4++; if (a[i][j] == a[i][j-1] && a[i][j] == a[i-1][j] && a[i][j] == a[i+1][j-1] && a[i][j] != '.') ans4++; } } for (int i=0 ; i<n ; i++) { for (int j=0 ; j<m ; j++) { if (a[i][j]==a[i][j+1] && a[i][j] == a[i-1][j+1] && a[i][j] == a[i+1][j+1] && a[i][j] != '.') ans5++; if (a[i][j]==a[i+1][j] && a[i][j]==a[i-1][j] && a[i][j] == a[i][j+1] && a[i][j] != '.') ans5++; if (a[i][j] == a[i-1][j] && a[i][j] == a[i][j+1] && a[i][j] == a[i][j-1] && a[i][j] != '.') ans5++; if (a[i][j]== a[i+1][j] && a[i][j] == a[i][j-1] && a[i][j] == a[i][j+1] && a[i][j] != '.') ans5++; } } cout<<ans1<<"\n"<<ans2<<"\n"<<ans3<<"\n"<<ans4<<"\n"<<ans5<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...