oj.uz

답안 #377452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377452 2021-03-14T08:31:59 Z Araragi Selotejp (COCI20_selotejp) C++14
0 / 110
 1 ms 620 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

int hr[2][2] = {{1, 0}, {-1, 0}};
int vr[2][2] = {{0, 1}, {0, -1}};

int n, m;
bool vis[101][101];

bool valid(int x, int y) {return (min(x, y) >= 1 && x <= n && y <= m && !vis[x][y]);}

queue<pair<int, int> > q;
int cnt, x, y;

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;

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

            if (c == '.')
                vis[i][j] = true;
        }

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (!vis[i][j])
            {
                q.push({i, j});
                vis[i][j] = true;

                int skok = 0;

                while (!q.empty())
                {
                    skok++;

                    x = q.front().F;
                    y = q.front().S;
                    q.pop();

                    for (int i = 0; i < 2; i++)
                    {
                        int cx = x + hr[i][0];
                        int cy = y + hr[i][1];

                        if (valid(cx, cy))
                        {
                            q.push({cx, cy});
                            vis[cx][cy] = true;
                        }
                    }
                }

                if (skok > 1)
                    cnt++;

                while (!q.empty())
                    q.pop();

                q.push({i, j});

                skok = 0;
                while (!q.empty())
                {
                    x = q.front().F;
                    y = q.front().S;
                    q.pop();
                    skok++;

                    for (int i = 0; i < 2; i++)
                    {
                        int cx = x + vr[i][0];
                        int cy = y + vr[i][1];

                        if (valid(cx, cy))
                        {
                            q.push({cx, cy});
                            vis[cx][cy] = true;
                        }
                    }
                }

                if (skok > 1)
                    cnt++;
            }

    cout << cnt + 1;
}

Subtask #1
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 620 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 620 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -