oj.uz

Submission #492619

# Submission time Handle Problem Language Result Execution time Memory
492619 2021-12-08T07:14:08 Z Biaz Orchard (NOI14_orchard) C++17
12 / 25
 1000 ms 55028 KB 
#include <bits/stdc++.h>
#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=1000005;
const int M=1000005;
const int MOD=1000000007;//998244353;
const int INF=1000000000000000000;//2147483647;

int n,m,tot;
vector<vector<int>> a;
int get(int i,int j,int x,int y){
    return a[x][y]-a[i-1][y]-a[x][j-1]+a[i-1][j-1];
}
int calc(int x,int y){
    int res=INF,mn=0;
    for (int i=1;i<=m;i++)
        for (int j=i;j<=m;j++){
            res=min(res,tot-get(x,i,y,j)+(j-i+1)*(y-x+1)-get(x,i,y,j));
    }
    return res;
}
inline void sol(){
    cin >>n>>m;
    a.resize(n+5,vector<int>(m+5,0));
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            cin >>a[i][j];
            a[i][j]=a[i][j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
        }
    }
    int ans=INF;
    tot=a[n][m];
    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++){
            //cout <<i<<' '<<j<<' '<<calc(i,j)<<'\n';
            ans=min(ans,calc(i,j));
    }
    cout <<ans<<'\n';
}
/*
5 7
0 0 1 0 0 1 0
0 1 1 1 1 1 0
0 1 1 0 0 1 0
0 1 1 1 1 1 0
0 0 1 0 0 1 0
*/
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

Compilation message

orchard.cpp: In function 'long long int calc(long long int, long long int)':
orchard.cpp:31:17: warning: unused variable 'mn' [-Wunused-variable]
   31 |     int res=INF,mn=0;
      |                 ^~

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 1112 KB Output is correct
2 Correct 175 ms 1100 KB Output is correct
3 Correct 166 ms 1116 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 55028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 6476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 332 KB Output is correct
2 Correct 195 ms 528 KB Output is correct
3 Correct 199 ms 528 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 6348 KB Time limit exceeded
2 Halted 0 ms 0 KB -