Submission #472753

#TimeUsernameProblemLanguageResultExecution timeMemory
472753SaraMostafaTetris (COCI17_tetris)C++14
32 / 80
1 ms204 KiB
#include <bits/stdc++.h> #include<unordered_map> using namespace std; #define ll long long #define endl "\n" #define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const long long mod=998244353; const double PI=acos(-1); int main() { //freopen("input.in","r",stdin); Sara int n,m; cin>>n>>m; int f1=0,f2=0,f3=0,f4=0,f5=0; vector<vector<char>>v(30,vector<char>(30)); for(int i=1; i<=n; i++) { for(int j=1; j<=m; j++) { cin>>v[i][j]; } } for(int i=1; i<=n; i++) { for(int j=1; j<=m; j++) { if(v[i][j]!='.') { /*figure 1*/ if(v[i+1][j]==v[i][j] && v[i][j+1]==v[i][j] && v[i+1][j+1]==v[i][j] ) { f1++; } /*figure 2*/ if(v[i][j+1]==v[i][j] && v[i][j+2]==v[i][j] && v[i][j+3]==v[i][j] ) { f2++; } else if(v[i+1][j]==v[i][j] && v[i+2][j]==v[i][j] && v[i+3][j]==v[i][j]){ f1++; } /*figure 3*/ if(v[i+1][j]==v[i][j] && v[i+1][j-1]==v[i][j] && v[i][j+1]==v[i][j] ) { f3++; } else if(v[i+1][j]==v[i][j] && v[i+1][j+1]==v[i][j] && v[i+2][j+1]==v[i][j]) { f3++; } /*figure 4*/ if(v[i+1][j+2]==v[i][j] && v[i+1][j+1]==v[i][j] && v[i][j+1]==v[i][j]) { f4++; } else if(v[i+1][j]==v[i][j] && v[i+1][j-1]==v[i][j] && v[i+2][j-1]==v[i][j]) { f4++; } /*figure 5*/ if(v[i+1][j-1]==v[i][j] && v[i+1][j]==v[i][j] && v[i+1][j+1]==v[i][j] ) { f5++; } else if(v[i+1][j]==v[i][j] && v[i+2][j]==v[i][j] && v[i+1][j+1]==v[i][j]) { f5++; } else if(v[i][j+1]==v[i][j] && v[i][j+2]==v[i][j] && v[i+1][j+1]==v[i][j]) { f5++; } else if(v[i+1][j]==v[i][j] && v[i+2][j]==v[i][j] && v[i+1][j-1]==v[i][j]) { f5++; } } } } cout<<f1<<endl<<f2<<endl<<f3<<endl<<f4<<endl<<f5; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...