제출 #439137

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

covering

#include <iostream>
#include <vector>
#include <algorithm>
#define chkmin(a, b) a = min(a, b)
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

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;
    int ans = 0;
    while (k--) {
        int x, y;
        cin >> x >> y;
        int sum = 0, min_val = infinity, bad = 4;
        if (x) {
            sum += board[x - 1][y];
            bad--;
            chkmin(min_val, board[x - 1][y]);
        }
        if (x < n - 1) {
            sum += board[x + 1][y];
            bad--;
            chkmin(min_val, board[x + 1][y]);
        }
        if (y) {
            sum += board[x][y - 1];
            bad--;
            chkmin(min_val, board[x][y - 1]);
        }
        if (y < m - 1) {
            sum += board[x][y + 1];
            bad--;
            chkmin(min_val, board[x][y + 1]);
        }
        ans += sum - min_val + board[x][y];
        if (bad > 1) {
            cout << "No";
            return 0;
        }
    }
    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