Submission #1148890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148890		phuonglinhn09	T-Covering (eJOI19_covering)	C++20	15 / 100	1 ms	328 KiB

covering

/**
 *   author:   phuonglinhn09
 *   created:  11.02.2025
 */

#include <bits/stdc++.h>
#define fi first
#define se second

using namespace std;

typedef long long ll;

int n, m, k;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};

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

    int a[n + 5][m + 5];
    int tplt[n + 5][m + 5];
    memset (a, 0, sizeof(a));
    memset (tplt, 0, sizeof(tplt));

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }

    cin >> k;
    int x, y;
    while (k--) {
        cin >> x >> y;
        x++, y++;

        tplt[x][y] = 2;
        int row, col;
        for (int i = 0; i < 4; i++) {
            row = x + dx[i], col = y + dy[i];
            if (row >= 1 && row <= n && col >= 1 && col <= m) {
                tplt[row][col] = 1;
            }
        }
    }

    bool vis[n + 5][m + 5];
    memset (vis, 0, sizeof(vis));

    queue<pair<int, int>> q;
    int sum, mi, cnt1, cnt2;

    int ans = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (tplt[i][j] != 0 && !vis[i][j]) {
                sum = cnt1 = cnt2 = 0;
                mi = 1e9 + 1;

                q.emplace(i, j);
                while (!q.empty()) {
                    auto [row, col] = q.front();
                    q.pop();
                    for (int i = 0; i < 4; i++) {
                        x = row + dx[i], y = col + dy[i];
                        if (x >= 1 && x <= n && y >= 1 && y <= m && tplt[x][y] != 0 && !vis[x][y]) {
                            mi = min (mi, a[x][y]);
                            sum += a[x][y];
                            cnt1 += tplt[x][y] == 1;
                            cnt2 += tplt[x][y] == 2;
                            
                            vis[x][y] = 1;
                            q.emplace(x, y);
                        }
                    }
                }

                if (cnt1 < cnt2 * 3) {
                    cout << "No";
                    return 0;
                } else if (cnt1 == cnt2 * 3) {
                    ans += sum;
                } else {
                    ans += sum - mi;
                }
            }
        }
    }

    cout << ans;
    return 0;
}

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