oj.uz

답안 #1055374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055374 2024-08-12T18:27:02 Z fryingduc Emacs (COCI20_emacs) C++17
50 / 50
 1 ms 476 KB 
/* #pragma GCC optimize("Ofast,unroll-loops") */
#include "bits/stdc++.h"
using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else 
#define debug(...)     
#endif

/* #define int long long */

bool vis[105][105];
char a[105][105];
int n, m;
void dfs(int x, int y){
    if(x > n || y > m) return;
    if(!vis[x][y] and a[x][y] == '*'){
        vis[x][y] = 1;
        dfs(x + 1, y);
        dfs(x, y + 1);
    }
}
void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(!vis[i][j] and a[i][j] == '*'){
                dfs(i, j);
                ans++;
                debug(i, j);
            }
        }
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int test = 1;
    /* cin >> test; */
    for(int i = 1; i <= test; i++){
        /* cout << "Case " << "#" << i << ": "; */
        solve();
    }

    return 0;
}

Subtask #1
50.0 / 50.0

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