Submission

PPPPPPPP

Score: 100

User: Dormon

Problemset: Sirabyrinth 2

Language: cpp

Time: 0.002 second

Submitted On: 2024-12-02 12:16:41

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>

#define debug(...) Debug(#__VA_ARGS__, __VA_ARGS__)
using namespace std;

template<typename T>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* name, T value) {
    std::cout << name << " : " << value << '\n';
}

template<typename T, typename... Args>
typename std::enable_if<std::is_integral<T>::value>::type
Debug(const char* names, T value, Args... args) {
    const char* comma = strchr(names, ',');
    std::cout.write(names, comma - names) << " : " << value << " | ";
    Debug(comma + 1, args...);
}

vector<pair<int, int>> dir = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};

void solve(){
    int n, m;
    cin >> n >> m;
    vector<string> grid(n);
    queue<pair<int, int>> q;
    for (int i = 0;i < n;i++){
        cin >> grid[i];
        for (int j = 0;j < m;j++){
            if (grid[i][j] == 'S')
                q.push({i, j});
        }
    }

    auto invalid = [&](int i, int j) -> bool {
        return i < 0 || i >= n || j < 0 || j >= m || grid[i][j] == '#';
    };

    int ans = 0;
    while (!q.empty()){
        auto [i, j] = q.front(); q.pop();
        if (grid[i][j] == '#') continue;
        grid[i][j] = '#';
        ans++;
        for (auto [di, dj]:dir){
            if (invalid(i+di, j+dj)) continue;
            q.push({i+di, j+dj});
        }
    }
    cout << ans << '\n';
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int q = 1; 
    //cin >> q;
    while (q--){
        solve();
    }
}