Submission #242381

#	Time	Username	Problem	Language	Result	Execution time	Memory
242381		valerikk	T-Covering (eJOI19_covering)	C++17	5 / 100	78 ms	12024 KiB

covering

#include<bits/stdc++.h>
using namespace std;

#define ll long long

#define x first
#define y second
#define pb push_back
#define mp make_pair

#define all(a) (a).begin(), (a).end()

const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const ll oo = 2e18;

int n, m;
ll **a;

bool ok(int i, int j) {
    return i >= 0 && i < n && j >= 0 && j < m;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    a = new ll*[n];
    for (int i = 0; i < n; ++i) {
        a[i] = new ll[m];
        for (int j = 0; j < m; ++j) cin >> a[i][j];
    }
    ll ans = 0;
    int k;
    cin >> k;
    while (k--) {
        int r, c;
        cin >> r >> c;
        ll mx = -oo;
        for (int i = 0; i < 4; ++i) {
            bool OK = 1;
            for (int j = 0; j < 4; ++j) {
                if (j != i) OK &= ok(r + dx[j], c + dy[j]);
            }
            if (OK) {
                ll q = a[r][c];
                for (int j = 0; j < 4; ++j) {
                    if (j != i) q += a[r + dx[j]][c + dy[j]];
                }
                mx = max(mx, q);
            }
        }
        ans += mx;
    }
    cout << ans;
    return 0;
}

• Subtask 1: 5 / 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