Submission #81610

#	Time	Username	Problem	Language	Result	Execution time	Memory
81610		tjdgus4384	물탱크 (KOI18_watertank)	C++14	45 / 100	3037 ms	12484 KiB

watertank

#include<cstdio>
#include<algorithm>
using namespace std;

int n, m, h;
int hp[1002][1002];
int vp[1002][1002];
int water[1002][1002];

int main()
{
    scanf("%d %d %d", &n, &m, &h);
    for(int i = 0;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            scanf("%d", &hp[i][j]);
            if(hp[i][j] == -1) hp[i][j] = h;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = 0;j <= m;j++)
        {
            scanf("%d", &vp[i][j]);
            if(vp[i][j] == -1) vp[i][j] = h;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            water[i][j] = h;
        }
    }
    bool change = true;
    while(change)
    {
        change = false;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            int a = water[i][j];
            water[i][j] = min(water[i][j], max(water[i][j - 1], vp[i][j - 1]));
            water[i][j] = min(water[i][j], max(water[i][j + 1], vp[i][j]));
            water[i][j] = min(water[i][j], max(water[i - 1][j], hp[i - 1][j]));
            water[i][j] = min(water[i][j], max(water[i + 1][j], hp[i][j]));
            if(a != water[i][j]) change = true;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = m;j > 0;j--)
        {
            int a = water[i][j];
            water[i][j] = min(water[i][j], max(water[i][j - 1], vp[i][j - 1]));
            water[i][j] = min(water[i][j], max(water[i][j + 1], vp[i][j]));
            water[i][j] = min(water[i][j], max(water[i - 1][j], hp[i - 1][j]));
            water[i][j] = min(water[i][j], max(water[i + 1][j], hp[i][j]));
            if(a != water[i][j]) change = true;
        }
    }
    for(int i = n;i > 0;i--)
    {
        for(int j = 1;j <= m;j++)
        {
            int a = water[i][j];
            water[i][j] = min(water[i][j], max(water[i][j - 1], vp[i][j - 1]));
            water[i][j] = min(water[i][j], max(water[i][j + 1], vp[i][j]));
            water[i][j] = min(water[i][j], max(water[i - 1][j], hp[i - 1][j]));
            water[i][j] = min(water[i][j], max(water[i + 1][j], hp[i][j]));
            if(a != water[i][j]) change = true;
        }
    }
    for(int i = n;i > 0;i--)
    {
        for(int j = m;j > 0;j--)
        {
            int a = water[i][j];
            water[i][j] = min(water[i][j], max(water[i][j - 1], vp[i][j - 1]));
            water[i][j] = min(water[i][j], max(water[i][j + 1], vp[i][j]));
            water[i][j] = min(water[i][j], max(water[i - 1][j], hp[i - 1][j]));
            water[i][j] = min(water[i][j], max(water[i + 1][j], hp[i][j]));
            if(a != water[i][j]) change = true;
        }
    }
    }
    int ans = 0;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            ans += water[i][j];
        }
    }
    printf("%d", ans);
    return 0;
}

Compilation message (stderr)

watertank.cpp: In function 'int main()':
watertank.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &h);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
watertank.cpp:17:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &hp[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~
watertank.cpp:25:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &vp[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 18 / 18
• Subtask 3: 0 / 15
• Subtask 4: 21 / 21
• Subtask 5: 0 / 40