oj.uz

Submission #47346

# Submission time Handle Problem Language Result Execution time Memory
47346 2018-05-01T06:53:16 Z dqhungdl Orchard (NOI14_orchard) C++17
22 / 25
 338 ms 22332 KB 
#include <bits/stdc++.h>
using namespace std;

int m,n,res=1e9,c0[1000005],c1[1000005],s[2][155][5005],s1[2][2][1000005];

int Sum(int t,int u1,int v1,int u2,int v2)
{
    return s[t][u2][v2]-s[t][u1-1][v2]-s[t][u2][v1-1]+s[t][u1-1][v1-1];
}

void Sub1()
{
    int x;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
        {
            cin>>x;
            s[0][i][j]+=s[0][i-1][j]+s[0][i][j-1]-s[0][i-1][j-1]+(x==0);
            s[1][i][j]+=s[1][i-1][j]+s[1][i][j-1]-s[1][i-1][j-1]+(x==1);
        }
    for(int i=1;i<=m;i++)
        for(int j=i;j<=m;j++)
        {
            int add=Sum(1,1,1,i-1,n)+Sum(1,j+1,1,m,n);
            for(int t=1;t<=n;t++)
            {
                c0[t]=c0[t-1]+Sum(0,i,t,j,t);
                c1[t]=c1[t-1]+Sum(1,i,t,j,t);
            }
            int minn=1e9;
            for(int t=n;t>=1;t--)
            {
                minn=min(minn,c0[t]-c1[t]);
                res=min(res,c1[t-1]+c1[n]-c0[t-1]+minn+add);
            }
        }
    cout<<res;
}

int Sum1(int t,int u1,int v1,int u2,int v2)
{
    return s1[t][u2][v2]-s1[t][u1-1][v2]-s1[t][u2][v1-1]+s1[t][u1-1][v1-1];
}

void Sub2()
{
    int x;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
        {
            cin>>x;
            s1[0][i][j]+=s1[0][i-1][j]+s1[0][i][j-1]-s1[0][i-1][j-1]+(x==0);
            s1[1][i][j]+=s1[1][i-1][j]+s1[1][i][j-1]-s1[1][i-1][j-1]+(x==1);
        }
    for(int i=1;i<=m;i++)
        for(int j=i;j<=m;j++)
        {
            int add=Sum1(1,1,1,i-1,n)+Sum1(1,j+1,1,m,n);
            for(int t=1;t<=n;t++)
            {
                c0[t]=c0[t-1]+Sum1(0,i,t,j,t);
                c1[t]=c1[t-1]+Sum1(1,i,t,j,t);
            }
            int minn=1e9;
            for(int t=n;t>=1;t--)
            {
                minn=min(minn,c0[t]-c1[t]);
                res=min(res,c1[t-1]+c1[n]-c0[t-1]+minn+add);
            }
        }
    cout<<res;
}

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>m>>n;
    if(m<=150&&n<=5000)
        Sub1();
    else
        Sub2();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 4 ms 1076 KB Output is correct
3 Correct 5 ms 1076 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 18232 KB Output is correct
2 Correct 99 ms 20312 KB Output is correct
3 Correct 99 ms 22332 KB Output is correct

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 22332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 22332 KB Output is correct
2 Correct 14 ms 22332 KB Output is correct
3 Correct 13 ms 22332 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 22332 KB Output is correct
2 Correct 330 ms 22332 KB Output is correct
3 Correct 325 ms 22332 KB Output is correct