제출 #1214394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1214394		badge881	T-Covering (eJOI19_covering)	C++20	70 / 100	52 ms	4680 KiB

covering

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define se second
#define fi first

const int ar = 1e3 + 5;

int m, n;
int k;
int x[ar], y[ar];
vector<vector<int>> a;
vector<vector<bool>> check;
vector<vector<bool>> t;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
queue<tuple<int, int, int>> qu;
int ans = 0;
int cnt1 = 0, cnt2 = 0;
void bfs()
{
    cnt1 = 0;
    cnt2 = 0;
    int mi = 1e9;
    while (qu.size())
    {
        auto [u, v, type] = qu.front();
        ans += a[u][v];
        if (type)
            cnt1++;
        else
            cnt2++, mi = min(mi, a[u][v]);
        qu.pop();
        for (int i = 0; i <= 3; i++)
        {
            int x = u + dx[i];
            int y = v + dy[i];
            if (x < 0 || x >= m || y < 0 || y >= n)
                continue;
            if (check[x][y])
                continue;
            if (!type && !t[x][y])
                continue;
            check[x][y] = true;
            qu.push({x, y, t[x][y]});
        }
    }
    if (cnt2 < 3 * cnt1)
    {
        printf("No\n");
        exit(0);
    }
    if (cnt2 == 3 * cnt1 + 1)
        ans -= mi;
}
int main()
{
    scanf("%d %d", &m, &n);
    a.resize(m);
    check.resize(m);
    t.resize(m);
    for (int i = 0; i < m; i++)
        a[i].resize(n), check[i].resize(n), t[i].resize(n);
    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            scanf("%d", &a[i][j]);
    scanf("%d", &k);
    for (int i = 1; i <= k; i++)
    {
        scanf("%d %d", &x[i], &y[i]);
        t[x[i]][y[i]] = true;
    }
    for (int i = 1; i <= k; i++)
    {
        if (!check[x[i]][y[i]])
        {
            check[x[i]][y[i]] = true;
            qu.push({x[i], y[i], 1});
            bfs();
        }
    }
    printf("%d\n", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

covering.cpp: In function 'int main()':
covering.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     scanf("%d %d", &m, &n);
      |     ~~~~~^~~~~~~~~~~~~~~~~
covering.cpp:66:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |             scanf("%d", &a[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~
covering.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
covering.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%d %d", &x[i], &y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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