oj.uz

답안 #234377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234377 2020-05-24T06:29:47 Z kartel Tetris (COCI17_tetris) C++14
80 / 80
 6 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int ans[6];
char c[20][20];
int mrk[20][20];
int n, m, i, j;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m;
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++)
        {
            cin >> c[i][j];

            if (c[i][j] == '.')
                mrk[i][j] = 1;
        }

    for (i = 1; i <= n; i++)
       for (j = 1; j <= m; j++)
    {
        if (mrk[i][j]) continue;

        if (j + 3 <= m)
        {
            if (c[i][j] == c[i][j + 1] && c[i][j] == c[i][j + 2] && c[i][j] == c[i][j + 3])
            {
                mrk[i][j] = 1;
                mrk[i][j + 1] = 1;
                mrk[i][j + 2] = 1;
                mrk[i][j + 3] = 1;
                ans[2]++;
                continue;
            }
        }

        if (i + 3 <= n)
        {
            if (c[i][j] == c[i + 1][j] && c[i][j] == c[i + 2][j] && c[i][j] == c[i + 3][j])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 2][j] = 1;
                mrk[i + 3][j] = 1;
                ans[2]++;
                continue;
            }
        }

        if (i + 1 <= n && j + 1 <= m)
        {
            if (c[i][j + 1] != c[i][j] && c[i + 1][j] == c[i][j] && c[i + 1][j - 1] == c[i][j] && c[i + 1][j + 1] == c[i][j])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 1][j - 1] = 1;
                mrk[i + 1][j + 1] = 1;
                ans[5]++;
                continue;
            }
        }

        if (i + 2 <= n && j > 1)
        {
            if (c[i][j] == c[i + 1][j] && c[i + 2][j] == c[i][j] && c[i + 1][j - 1] == c[i][j])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 2][j] = 1;
                mrk[i + 1][j - 1] = 1;
                ans[5]++;
                continue;
            }
        }

        if (i + 2 <= n && j + 1 <= m)
        {
            if (c[i][j] == c[i + 1][j] && c[i + 2][j] == c[i][j] && c[i + 1][j + 1] == c[i][j])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 2][j] = 1;
                mrk[i + 1][j + 1] = 1;
                ans[5]++;
                continue;
            }
        }

        if (i + 1 <= n && j + 2 <= m)
        {
            if (c[i][j] == c[i + 1][j + 1] && c[i][j] == c[i][j + 1] && c[i][j] == c[i][j + 2])
            {
                mrk[i][j] = 1;
                mrk[i][j + 1] = 1;
                mrk[i][j + 2] = 1;
                mrk[i + 1][j + 1] = 1;
                ans[5]++;
                continue;
            }
        }

        if (i + 1 <= n && j + 1 <= m)
        {
            if (c[i][j] == c[i + 1][j] && c[i][j] == c[i][j + 1] && c[i][j] == c[i + 1][j + 1])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i][j + 1] = 1;
                mrk[i + 1][j + 1] = 1;
                ans[1]++;
                continue;
            }
        }

        if (i + 1 <= n && j - 1 >= 1 && j + 1 <= m)
        {
            if (c[i][j] == c[i + 1][j] && c[i][j] == c[i][j + 1] && c[i][j] == c[i + 1][j - 1])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 1][j - 1] = 1;
                mrk[i][j + 1] = 1;
                ans[3]++;
                continue;
            }
        }

        if (i + 2 <= n && j + 1 <= m)
        {
            if (c[i][j] == c[i + 1][j] && c[i + 2][j + 1] == c[i][j] && c[i + 1][j + 1] == c[i][j])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 2][j + 1] = 1;
                mrk[i + 1][j + 1] = 1;
                ans[3]++;
                continue;
            }
        }

        if (i + 1 <= n && j + 2 <= m)
        {
            if (c[i][j] == c[i + 1][j + 1] && c[i][j] == c[i + 1][j + 2] && c[i][j] == c[i][j + 1])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j + 1] = 1;
                mrk[i + 1][j + 2] = 1;
                mrk[i][j + 1] = 1;
                ans[4]++;
                continue;
            }
        }

        if (i + 2 <= n && j - 1 >= 1)
        {
            if (c[i][j] == c[i + 1][j] && c[i][j] == c[i + 1][j - 1] && c[i][j] == c[i + 2][j - 1])
            {
                mrk[i][j] = 1;
                mrk[i + 1][j] = 1;
                mrk[i + 1][j - 1] = 1;
                mrk[i + 2][j - 1] = 1;
                ans[4]++;
                continue;
            }
        }

    }
    for (i = 1; i <= 5; i++) cout << ans[i] << el;
}

Subtask #1
80.0 / 80.0

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