oj.uz

Submission #81609

# Submission time Handle Problem Language Result Execution time Memory
81609 2018-10-25T15:01:51 Z tjdgus4384 None (KOI18_watertank) C++14
45 / 100
 3000 ms 57272 KB 
#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;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        water[i][1] = min(water[i][1], vp[i][0]);
        water[i][m] = min(water[i][m], vp[i][m]);
    }
    for(int i = 1;i <= m;i++)
    {
        water[1][i] = min(water[1][i], hp[0][i]);
        water[n][i] = min(water[n][i], hp[n][i]);
    }
    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

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.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 464 KB Output is correct
5 Correct 2 ms 464 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 636 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 2 ms 636 KB Output is correct
5 Correct 2 ms 636 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 636 KB Output is correct
12 Correct 2 ms 636 KB Output is correct
13 Correct 2 ms 636 KB Output is correct
14 Correct 2 ms 636 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 2 ms 636 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 12372 KB Output is correct
2 Correct 2 ms 12372 KB Output is correct
3 Correct 221 ms 12372 KB Output is correct
4 Correct 294 ms 12372 KB Output is correct
5 Correct 2 ms 12372 KB Output is correct
6 Execution timed out 3040 ms 17276 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17276 KB Output is correct
2 Correct 2 ms 17276 KB Output is correct
3 Correct 2 ms 17276 KB Output is correct
4 Correct 2 ms 17276 KB Output is correct
5 Correct 2 ms 17276 KB Output is correct
6 Correct 2 ms 17276 KB Output is correct
7 Correct 3 ms 17276 KB Output is correct
8 Correct 5 ms 17276 KB Output is correct
9 Correct 2 ms 17276 KB Output is correct
10 Correct 4 ms 17276 KB Output is correct
11 Correct 3 ms 17276 KB Output is correct
12 Correct 2 ms 17276 KB Output is correct
13 Correct 3 ms 17276 KB Output is correct
14 Correct 2 ms 17276 KB Output is correct
15 Correct 2 ms 17276 KB Output is correct
16 Correct 5 ms 17276 KB Output is correct
17 Correct 3 ms 17276 KB Output is correct
18 Correct 4 ms 17276 KB Output is correct
19 Correct 2 ms 17276 KB Output is correct

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17276 KB Output is correct
2 Correct 2 ms 17276 KB Output is correct
3 Correct 2 ms 17276 KB Output is correct
4 Correct 2 ms 17276 KB Output is correct
5 Correct 2 ms 17276 KB Output is correct
6 Correct 230 ms 23440 KB Output is correct
7 Correct 2 ms 23440 KB Output is correct
8 Correct 2 ms 23440 KB Output is correct
9 Correct 244 ms 28536 KB Output is correct
10 Correct 2 ms 28536 KB Output is correct
11 Correct 2 ms 28536 KB Output is correct
12 Correct 265 ms 34464 KB Output is correct
13 Correct 210 ms 38428 KB Output is correct
14 Correct 2 ms 38428 KB Output is correct
15 Correct 458 ms 43616 KB Output is correct
16 Correct 2 ms 43616 KB Output is correct
17 Correct 3 ms 43616 KB Output is correct
18 Correct 2 ms 43616 KB Output is correct
19 Correct 265 ms 48724 KB Output is correct
20 Correct 3 ms 48724 KB Output is correct
21 Execution timed out 3038 ms 57272 KB Time limit exceeded
22 Halted 0 ms 0 KB -