oj.uz

답안 #823887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823887 2023-08-13T09:41:44 Z ajay Emacs (COCI20_emacs) C++14
50 / 50
 1 ms 416 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

void dfs(vector<string> &grid, int x, int y)
{
    grid[x][y] = '.';

    for (int i = 0; i < 4; i++)
    {
        int newx = dx[i] + x;
        int newy = dy[i] + y;
        if (newx >= 0 and newx < sz(grid) and newy >= 0 and newy < sz(grid[0]) and grid[newx][newy] == '*')
        {
            dfs(grid, newx, newy);
        }
    }
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string> grid(n);
    rep(i, 0, n)
    {
        cin >> grid[i];
    }
    int ans = 0;
    rep(i, 0, n)
    {
        rep(j, 0, m)
        {
            if (grid[i][j] == '*')
            {
                dfs(grid, i, j);
                ans++;
            }
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
50.0 / 50.0

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