Submission #67350250

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int H, W, K;
    cin >> H >> W >> K;
    vector<vector<int>> value(H + 2, vector<int>(W + 2));
    vector<vector<int>> vis(H + 2, vector<int>(W + 2));
    priority_queue<pair<int, pair<int, int>>,
        vector<pair<int, pair<int, int>>>,
        greater<pair<int, pair<int, int>>>> pq;
    vector<vector<int>> cnt(H + 2, vector<int>(W + 2));

    for (int k = 0; k < K; k++) {
        int x, y;
        cin >> x >> y;
        pq.push(make_pair(0, make_pair(x, y)));
        vis[x][y] = true;
    }
    while(pq.size()) {
        auto p = pq.top();
        pq.pop();
        int x = p.second.first;
        int y = p.second.second;
        for (int dx = -1; dx <= 1; dx++) {
            for (int dy = -1; dy <= 1; dy++) {
                if (dx == 0 || dy == 0) {
                    if (x + dx >= 1 && x + dx <= H && y + dy >= 1 && y + dy <= W) {
                        int nx = x + dx;
                        int ny = y + dy;
                        if (vis[nx][ny]) {
                            continue;
                        }
                        cnt[nx][ny]++;
                        if (cnt[nx][ny] == 2) {
                            vis[nx][ny] = true;
                            value[nx][ny] = value[x][y] + 1;
                            pq.push(make_pair(value[nx][ny], make_pair(nx, ny)));
                        }
                    }
                }
            }
        }
    }
    long long sum = 0;
    for (int i = 1; i <= H; i++) {
        for (int j = 1; j <= W; j++) {
            sum += value[i][j];
        }
    }
    cout << sum << "\n";
}

Submission Info

Judge Result