oj.uz

Submission #1030800

# Submission time Handle Problem Language Result Execution time Memory
1030800 2024-07-22T10:22:10 Z Khanhcsp2 Orchard (NOI14_orchard) C++14
20 / 25
 113 ms 19728 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e5+11;
int m, n, a[151][N], pfs[151][N];
void sol()
{
    cin >> m >> n;
    for(int i=1;i<=m;i++) for(int j=1;j<=n;j++)
    {
        cin >> a[i][j];
        pfs[i][j]=pfs[i-1][j]+pfs[i][j-1]-pfs[i-1][j-1]+a[i][j];
    }
    int ans=1e18, all=pfs[m][n];
    for(int len=1;len<=m;len++)
    {
        for(int i=1;i+len-1<=m;i++)
        {
            int ma=0;
            for(int j=1;j<=n;j++)
            {
                int sl1=pfs[i+len-1][j]-pfs[i-1][j];
                ans=min(ans, all+j*len-2*sl1-ma);
                ma=max(ma, j*len-2*sl1);
            }
        }
    }
    cout << ans;

}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 5.0

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

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5724 KB Output is correct
2 Correct 9 ms 5888 KB Output is correct
3 Correct 9 ms 3932 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 5 ms 2540 KB Output is correct
3 Correct 6 ms 4444 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 14932 KB Output is correct
2 Correct 113 ms 17128 KB Output is correct
3 Correct 113 ms 16980 KB Output is correct