Submission #60531645

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
int h, w, d;
set<pair<int, int>> s;
char arr[1500][1500];
bool visited[1500][1500] = {0};
int direction[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> h >> w >> d;
    for (int i = 0; i <= h + 1; i++)
    {
        for (int j = 0; j <= w + 1; j++)
        {
            if (i == 0 || i == h + 1 || j == 0 || j == w + 1)
            {
                arr[i][j] = '#';
            }
            else
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
int h, w, d;
set<pair<int, int>> s;
char arr[1500][1500];
bool visited[1500][1500] = {0};
int direction[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> h >> w >> d;
    for (int i = 0; i <= h + 1; i++)
    {
        for (int j = 0; j <= w + 1; j++)
        {
            if (i == 0 || i == h + 1 || j == 0 || j == w + 1)
            {
                arr[i][j] = '#';
            }
            else
            {
                cin >> arr[i][j];
            }
        }
    }
    priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
    for (int i = 1; i <= h; i++)
    {
        for (int j = 1; j <= w; j++)
        {
            if (arr[i][j] == 'H')
            {
                pq.push({0,{i,j}});
            }
        }
    }
    int ans=0;
    while (pq.empty() == false)
    {
        int step = pq.top().first;
        pair<int, int> coord = pq.top().second;
        pq.pop();
        // cout<<coord.first<<" "<<coord.second<<"\n";
        if(visited[coord.first][coord.second]){
            // cout<<"!!!!";
            continue;
        }
        visited[coord.first][coord.second]=true;
        ans++;
        // cout<<"?";
        if(step+1>d){
            continue;
        }
        // cout<<"/";
        for (int d = 0; d < 4; d++)
        {
            int nextx = coord.first + direction[d][0];
            int nexty = coord.second + direction[d][1];
            if(arr[nextx][nexty]=='.'){
                // cout<<" hi ";
                pq.push({step+1,{nextx,nexty}});
            }
        }
    }
    cout << ans;
}

Submission Info

Compile Error

./Main.cpp:6:29: warning: suggest braces around initialization of subobject [-Wmissing-braces]
bool visited[1500][1500] = {0};
                            ^
                            {}
1 warning generated.

Judge Result