oj.uz

Submission #522063

# Submission time Handle Problem Language Result Execution time Memory
522063 2022-02-03T17:30:17 Z Carmel_Ab1 Orchard (NOI14_orchard) C++17
8 / 25
 1000 ms 23752 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
void solve() {
    ll n,m;
    cin >> n >> m;
    vvl a(n,vl(m));
    for(int i=0; i<n;i ++)
        read(a[i]);

    ll S=0;
    vvl pref(n,vl(m));

    for(int i=0; i<n;i ++)
        for(int j=0; j<m; j++){
            S+=a[i][j];
            pref[i][j]+=a[i][j];
            if(i)pref[i][j]+=pref[i-1][j];
            if(j)pref[i][j]+=pref[i][j-1];
            if(i && j)pref[i][j]-=pref[i-1][j-1];
        }
    auto sum=[&](int i1,int j1,int i2,int j2)->ll{
        ll ans=pref[i2][j2];
        if(i1)ans-=pref[i1-1][j2];
        if(j1)ans-=pref[i2][j1-1];
        if(i1 && j1)ans-=pref[i1-1][j1-1];
        return ans;
    };


    ll ans=1e18;
    for(int i1=0; i1<n; i1++)
        for(int j1=0; j1<m; j1++)
            for(int i2=i1; i2<n; i2++)
                for(int j2=j1; j2<m; j2++){
                    ll cur=S;
                    ll h=i2-i1+1,w=j2-j1+1,in=sum(i1,j1,i2,j2);
                    cur+=h*w-2*in;
                    if(cur<ans)
                        ans=min(ans,cur);
                }

    out(ans)
}
/*
 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
 */

Compilation message

orchard.cpp: In function 'void usaco(std::string)':
orchard.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
orchard.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 316 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 159 ms 648 KB Output is correct
2 Correct 137 ms 672 KB Output is correct
3 Correct 140 ms 672 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 23752 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 1079 ms 4156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 460 KB Output is correct
2 Correct 211 ms 704 KB Output is correct
3 Incorrect 240 ms 712 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

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