제출 #1180563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180563		mishasim	T-Covering (eJOI19_covering)	C++20	0 / 100	2 ms	580 KiB

covering

#include <iostream>

using namespace std;

#define endl '\n'

long long n, m, klk, r, c, res, all, b;
long long k[1000006];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> k[i * m + j];
        }
    }

    cin >> klk;
    b = 0;
    res = 0;

    for (int i = 1; i <= klk; i++) {
        cin >> r >> c;
        if ((r == 0 && c == 0) || (r == 0 && c == m - 1) || (r == n - 1 && c == 0) || (r == n - 1 && c == m - 1)) {
            b = 1;
        } else {
            all = k[(r * m) + c] + k[((r - 1) * m) + c] + k[((r + 1) * m) + c] + k[(r * m) + (c - 1)] + k[(r * m) + (c + 1)];
            res += all - min(k[((r - 1) * m) + c], min(k[((r + 1) * m) + c], min(k[(r * m) + (c - 1)], k[(r * m) + (c + 1)])));
        }
    }

    if (b == 1) cout << "No";
    else cout << res;

    return 0;
}

• 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