제출 #464586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464586		Itamar	T-Covering (eJOI19_covering)	C++14	0 / 100	29 ms	1988 KiB

covering

#include <iostream>
using namespace std;
#include <vector>

int n, m, k;


long long sum;
int s;
vector<vector<int>> num;
vector<vector<int>> pain;

void put(int i, int j, int p) {
    sum += num[i][j];
    sum += num[i + 1][j];
    sum += num[i -1][j];
    sum += num[i][j + 1];
    sum += num[i][j - 1];
    if (p == 3) {
        sum -= num[i + 1][j];
    }
    if (p == 2) {
        sum -= num[i - 1][j];
    }
    if (p == 1) {
        sum -= num[i][j + 1];
    }
    if (p == 0) {
        sum -= num[i][j - 1];
    }
}
int main()
{
    cin >> m;
    cin >> n;
    pain.resize(m+1);
    num.resize(m+1);
    sum = 0;
    s = 1;
    for (int i = 0; i < m; i++) {
        //pain[i].resize(n+1);
        for (int j = 0; j < n; j++) {
            int x;
            cin >> x;
            num[i].push_back(x);
            pain[i].push_back(0);
        }
        num[i].push_back(0);
    }
    for (int i = 0; i < n + 1; i++) {
        num[m].push_back(0);
    }
    cin >> k;
    for (int i = 0; i < k; i++) {
        int a, b;
        cin >> a;
        cin >> b;
        pain[a][b] = 1;
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (pain[i][j] == 1) {
                int min = 1001;
                if (pain[i - 1][j] == 1) {
                    if (i == m - 1 || j == n - 1) {
                        s = 0;
                    }
                    put(i, j, 2);
                    continue;
                }
                if (pain[i + 1][j] == 1) {
                    if (i == m - 1 || j == n - 1) {
                        s = 0;
                    }
                    put(i, j, 3);
                    continue;
                }
                if (pain[i][j+1] == 1) {
                    if (i == m - 1 || j == n - 1) {
                        s = 0;
                    }
                    put(i, j, 1);
                    continue;
                }
                if (pain[i][j - 1] == 1) {
                    if (i == m - 1 || j == n - 1) {
                        s = 0;
                    }
                    put(i, j, 0);
                    continue;
                }
                if (min > num[i + 1][j]) {
                    min = num[i + 1][j];
                }
                if (min > num[i - 1][j]) {
                    min = num[i - 1][j];
                }
                if (min > num[i][j+1]) {
                    min = num[i][j+1];
                }
                if (min > num[i ][j-1]) {
                    min = num[i][j-1];
                }
                sum += num[i][j];
                sum += num[i + 1][j];
                sum += num[i - 1][j];
                sum += num[i][j + 1];
                sum += num[i][j - 1];
                sum -= min;
            }
        }
    }
    if (s == 0) {
        cout << "NO";
    }
    else {
        cout << sum;
    }
}

• 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