oj.uz

Submission #660247

# Submission time Handle Problem Language Result Execution time Memory
660247 2022-11-21T10:05:43 Z berr Zemljište (COCI22_zemljiste) C++17
30 / 70
 2000 ms 8648 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int val[505][505], pr[505][505], pc[505][505];


int calc(int x, int y, int depth, int length)
{

    return pc[x+length-1][y+depth-1]-pc[x-1][y+depth-1]-pc[x+length-1][y-1]+pc[x-1][y-1];

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

    int n, m, a, b; cin>>n>>m>>a>>b;

    int ans=2e18;


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

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            pr[i][j]=pr[i][j-1]+val[i][j];
        }
    }

    for(int j=1; j<=m; j++)
    {
        for(int i=1; i<=n; i++)
        {
            pc[i][j]+=pc[i-1][j]+pr[i][j];
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int l=1; l<=m; l++)
        {
            for(int length=1; length+l-1<=m; length++)
            {
                int s=0;
                for(int j=8; j>=0; j--)
                {
                    int tmp=s+(1<<j);
                    if(tmp+i-1>n) continue;
                    if(calc(i, l, length, tmp)<=b) s=tmp;    
                }

                int d=calc(i, l, length, s);
                ans=min(ans, abs(b-d)+abs(a-d));
                s=n-i+1;
                for(int j=8; j>=0; j--)
                {
                    int tmp=s-(1<<j);
                    if(tmp<1) continue;
                    if(calc(i, l, length, tmp)>=a) s=tmp;
                }
                d=calc(i, l, length, s);
                ans=min(ans, abs(b-d)+abs(a-d));
            }

        }    
    }
    cout<<ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 12 ms 1196 KB Output is correct
11 Correct 33 ms 1620 KB Output is correct
12 Correct 33 ms 1608 KB Output is correct
13 Correct 32 ms 1620 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 32 ms 1624 KB Output is correct
16 Correct 32 ms 1492 KB Output is correct
17 Correct 34 ms 1492 KB Output is correct
18 Correct 32 ms 1472 KB Output is correct
19 Correct 32 ms 1492 KB Output is correct
20 Correct 32 ms 1488 KB Output is correct
21 Correct 32 ms 1564 KB Output is correct
22 Correct 34 ms 1492 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 12 ms 1196 KB Output is correct
11 Correct 33 ms 1620 KB Output is correct
12 Correct 33 ms 1608 KB Output is correct
13 Correct 32 ms 1620 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 32 ms 1624 KB Output is correct
16 Correct 32 ms 1492 KB Output is correct
17 Correct 34 ms 1492 KB Output is correct
18 Correct 32 ms 1472 KB Output is correct
19 Correct 32 ms 1492 KB Output is correct
20 Correct 32 ms 1488 KB Output is correct
21 Correct 32 ms 1564 KB Output is correct
22 Correct 34 ms 1492 KB Output is correct
23 Execution timed out 2045 ms 8648 KB Time limit exceeded
24 Halted 0 ms 0 KB -