제출 #1216098

#제출 시각아이디문제언어결과실행 시간메모리
1216098cuenta_verdaderaTetris (COCI17_tetris)C++20
0 / 80
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,m,c=0,l=0,z=0,s=0,t=0;
    cin>>n>>m;
    vector<vector<char>>v(n,vector<char>(m));
        for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            cin >> v[i][j];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
        if(v[i][j]!='.'){
            if(i+1<n && j+1<m){
            if(v[i][j]==v[i+1][j] && v[i][j]==v[i][j+1] && v[i][j]==v[i+1][j+1]){
                c++;
                v[i+1][j]='.';
                v[i][j]='.';
                v[i][j+1]='.';
                v[i+1][j+1]='.';
            }
            }
             if(i+3<n){
            if(v[i][j]==v[i+1][j] && v[i][j]==v[i+2][j] && v[i][j]==v[i+3][j]){
                l++;
                v[i][j]='.';
                v[i+1][j]='.';
                v[i+2][j]='.';
                v[i+3][j]='.';
            }
            }
             if(j+3<m){
            if(v[i][j]==v[i][j+1] && v[i][j]==v[i][j+2] && v[i][j]==v[i][j+3]){
                l++;
                v[i][j]='.';
                v[i][j+1]='.';
                v[i][j+2]='.';
                v[i][j+3]='.';
            }
            }
             if (i+1<n && i-1>=0 && j+1<m){
            if(v[i][j]==v[i+1][j+1] && v[i][j]==v[i][j+1] && v[i][j]==v[i-1][j+1]){
                t++;
                v[i][j]='.';
                v[i+1][j+1]='.';
                v[i-1][j+1]='.';
                v[i][j+1]='.';
            }
            }
             if (i+1<n && j+2<m){
            if(v[i][j]==v[i][j+1] && v[i][j]==v[i][j+2] && v[i][j]==v[i+1][j+1]){
                t++;
                v[i][j]='.';
                v[i][j+1]='.';
                v[i][j+2]='.';
                v[i+1][j+1]='.';
            }
            }
            if (i+2<n && j+1<m){
            if(v[i][j]==v[i+1][j] && v[i][j]==v[i+1][j+1] && v[i][j]==v[i+2][j+1]){
                z++;
                v[i][j]='.';
                v[i+1][j]='.';
                v[i+1][j+1]='.';
                v[i+2][j+1]='.';
            }
            }
            if (i+1<n && j+2<m){
            if(v[i][j]==v[i][j+1] && v[i][j]==v[i][j+2] && v[i][j]==v[i+1][j+2]){
                z++;
                v[i][j]='.';
                v[i][j+1]='.';
                v[i][j+2]='.';
                v[i+1][j+2]='.';
            }
            }
            if (i+1<n && j+2<m){
            if(v[i][j]==v[i][j+1] && v[i][j]==v[i+1][j+1] && v[i][j]==v[i+1][j+2]){
                s++;
                v[i][j]='.';
                v[i+1][j+1]='.';
                v[i][j+1]='.';
                v[i+1][j+2]='.';
            }
            }
             if (j+2<m){
            if(v[i][j]==v[i][j+1] && v[i][j]==v[i-1][j+1] && v[i][j]==v[i-1][j+2]){
                s++;
                v[i][j]='.';
                v[i-1][j+1]='.';
                v[i][j+1]='.';
                v[i-1][j+2]='.';
            }
            }

    }
    }
    }
    cout<<c<<endl;
    cout<<l<<endl;
     cout<<z<<endl;
    cout<<s<<endl;
     cout<<t<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...