제출 #448797

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

covering

#include <bits/stdc++.h>
#define int long long

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int m, n;
    cin >> m >> n;
    
    vector<vector<int>> grid(m+2, vector<int>(n+2, 0));
    for (int y=0; y<m; y++) {
        for (int x=0; x<n; x++) {
            cin >> grid[y+1][x+1];
        }
    }

    int k;
    cin >> k;

    vector<vector<bool>> sp_grid(m+2, vector<bool>(n+2, false));
    vector<pair<int, int>> sp_cells(k);
    for (int i=0; i<n; i++) {
        int ri, ci;
        cin >> ri >> ci;

        sp_grid[ri+1][ci+1] = true;
        sp_cells.emplace_back(ri, ci);
    }

    int sum = 0;
    for (auto [ri, ci] : sp_cells) {
        sum += grid[ri+1][ci] + grid[ri+1][ci+2] + grid[ri][ci+1] + grid[ri+2][ci+1] - \
                min(min(grid[ri+1][ci], grid[ri+1][ci+2]), min(grid[ri][ci+1], grid[ri+2][ci+1]));
    }

}

• 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