제출 #439157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439157		elazarkoren	T-Covering (eJOI19_covering)	C++17	0 / 100	3 ms	336 KiB

covering

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define x first
#define y second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;

const int infinity = 1e9;

int main() {
    int n, m;
    cin >> n >> m;
    vvi board(n, vi(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> board[i][j];
        }
    }
    int k;
    cin >> k;
    vii special(k);
    vvb visited(n, vb(m));
    for (int i = 0; i < k; i++) {
        cin >> special[i].x >> special[i].y;
        visited[special[i].x][special[i].y] = true;
    }
    sort(all(special));
    int ans = 0;
    vb put(k);
    while (true) {
        bool is_new = false;
        for (int i = 0; i < k; i++) {
            int x = special[i].x, y = special[i].y;
            int sum = board[x][y], min_val = infinity, bad = 4;
            if (x && !visited[x - 1][y]) {
                sum += board[x - 1][y];
                bad--;
                chkmin(min_val, board[x - 1][y]);
            }
            if (x < n - 1 && !visited[x + 1][y]) {
                sum += board[x + 1][y];
                bad--;
                chkmin(min_val, board[x + 1][y]);
            }
            if (y && !visited[x][y - 1]) {
                sum += board[x][y - 1];
                bad--;
                chkmin(min_val, board[x][y - 1]);
            }
            if (y < m - 1 && !visited[x][y + 1]) {
                sum += board[x][y + 1];
                bad--;
                chkmin(min_val, board[x][y + 1]);
            }
            if (bad == 1) {
                ans += sum;
                visited[x][y - 1] = true;
                visited[x][y + 1] = true;
                is_new = true;
                put[i] = true;
            } else if (bad > 1) {
                cout << "No";
                return 0;
            }
        }
        if (!is_new) break;
    }
    vi curr;
    for (int i = 0; i < k; i++) {
        if (put[i]) continue;
        curr.push_back(i);
        if (i < k - 1 && special[i + 1].y == special[i].y + 2 && !put[i + 1]) continue;
        int sum = 0;
        int min_val = infinity;
        for (int j : curr) {
            int x = special[j].x, y = special[j].y;
            chkmin(min_val, board[x - 1][y]);
            chkmin(min_val, board[x + 1][y]);
            chkmin(min_val, board[x][y - 1]);
            sum += board[x - 1][y] + board[x + 1][y] + board[x][y - 1] + board[x][y];
        }
        chkmin(min_val, board[special.back().x][special.back().y + 1]);
        sum += board[special[curr.back()].x][special[curr.back()].y + 1];
        ans += sum - min_val;
        curr.clear();
    }
    cout << ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 30