oj.uz

답안 #510238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
510238 2022-01-14T20:37:14 Z NeroZein Tetris (COCI17_tetris) C++14
80 / 80
 0 ms 332 KB 
#include <bits/stdc++.h>
#define endl "\n"
#define sz = s.size()
using ll = long long;
const int Z = 1e8+9;
const int INF = 1e9+9;
const int mod = 1e9+7;
using namespace std;
ll fp (ll x, ll y)
{
    if (y == 0) return 1;
    if (y == 1) return x;
    ll ret = fp(x, y/2) % mod;
    if (y % 2) ret *= x;
    return ret;
}
char a[11100][11100];
ll x, n, mn, mx, sum, ans, dif, t, k , m ;
ll fig1 , fig2 , fig3 , fig4 , fig5 ;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(NULL);

    cin >> n >> m;
    for (int i = 0; i < n + 5; i++)
        for (int j = 0; j < m + 5; j++)
            a[i][j] = '.';
    for (int i = 1 ; i <= n ; i++)
        for (int j = 1 ; j <= m ; j++)
            cin >> a[i][j];

    for (int i = 1 ; i <= n  ; i++){
        for (int j = 1 ; j <= m ; j++){
            if (a[i][j] == '.' || a[i][j] == 0) continue;
            if (a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2] && a[i][j] == a[i][j+3]){
                    fig2++;
                    a[i][j] = '.';
                    a[i][j+1] = '.';
                    a[i][j+2] = '.';
                    a[i][j+3] = '.';
            }
            else if (a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j] && a[i][j] == a[i+3][j]){
                fig2++;
                a[i][j] = '.';
                a[i+1][j] = '.';
                a[i+2][j] = '.';
                a[i+3][j] = '.';
            }
            else if (a[i][j] == a[i][j+1] && a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j+1]){
                fig1++;
                a[i][j] = '.' ;
                a[i][j+1] = '.' ;
                a[i+1][j] = '.' ;
                a[i+1][j+1] = '.' ;
            }
            else if (a[i][j] == a[i][j+1] && a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j-1]){
                fig3++;
                a[i][j] = '.';
                a[i][j+1] = '.';
                a[i+1][j] = '.';
                a[i+1][j-1] = '.';
            }
            else if (a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j+1] && a[i][j] == a[i+2][j+1]){
                fig3++;
                a[i][j] = '.';;
                a[i+1][j] = '.';
                a[i+1][j+1] = '.';
                a[i+2][j+1] = '.';
            }

            else if (a[i][j] == a[i][j+1] && a[i][j] == a[i+1][j+1] && a[i][j] == a[i+1][j+2]){
                fig4++;
                a[i][j] = '.';
                a[i][j+1] = '.';
                a[i+1][j+1] = '.';
                a[i+1][j+2] = '.';
            }
            else if (a[i][j] == a[i+1][j] && a[i][j] == a[i+1][j-1] && a[i][j] == a[i+2][j-1]){
                fig4++;
                a[i][j] = '.';;
                a[i+1][j] = '.';
                a[i+1][j-1] = '.';
                a[i+2][j-1] = '.';
            }
            else if (a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j] && a[i+1][j-1] == a[i][j]){
                fig5++;
                a[i][j] = '.' ;
                a[i+1][j] = '.';
                a[i+2][j] = '.';
                a[i+1][j-1] = '.' ;
            }
            else if (a[i][j] == a[i+1][j] && a[i][j] == a[i+2][j] && a[i+1][j+1] == a[i][j]){
                fig5++;
                a[i][j] = '.' ;
                a[i+1][j] = '.';
                a[i+2][j] = '.';
                a[i+1][j+1] = '.' ;
            }
            else if (a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2] && a[i][j] == a[i+1][j+1]){
                fig5++;
                a[i][j] = '.' ;
                a[i][j+1] = '.' ;
                a[i][j+2] = '.' ;
                a[i+1][j+1] = '.' ;
            }
            else if (a[i][j] == a[i][j+1] && a[i][j] == a[i][j+2] && a[i][j] == a[i-1][j+1]){
                fig5++;
                a[i][j] = '.' ;
                a[i][j+1] = '.' ;
                a[i][j+2] = '.' ;
                a[i-1][j+1] = '.' ;
            }
        }
    }
    cout << fig1 << endl << fig2 << endl << fig3 << endl << fig4 << endl << fig5 << endl;
    return 0 ;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct