oj.uz

Submission #58890

# Submission time Handle Problem Language Result Execution time Memory
58890 2018-07-19T18:41:35 Z Benq Orchard (NOI14_orchard) C++14
25 / 25
 163 ms 15860 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,m,num,ans;
vector<vi> cum;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    cum.resize(n+1);
    F0R(i,n+1) cum[i].resize(m+1);
    FOR(i,1,n+1) {
        FOR(j,1,m+1) {
            char c; cin >> c;
            cum[i][j] = cum[i-1][j]+cum[i][j-1]-cum[i-1][j-1];
            if (c == '1') {
                num ++;
                cum[i][j] --;
            } else {
                cum[i][j] ++;
            }
        }
    }
    FOR(i,1,n+1) F0R(I,i) {
        int mx = 0;
        F0R(j,m+1) {
            ans = min(ans,cum[i][j]-cum[I][j]-mx);
            mx = max(mx,cum[i][j]-cum[I][j]);
        }
    }
    cout << ans+num;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10640 KB Output is correct
2 Correct 49 ms 12852 KB Output is correct
3 Correct 53 ms 14856 KB Output is correct

Subtask #4
3.0 / 3.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 14856 KB Output is correct
2 Correct 163 ms 14856 KB Output is correct
3 Correct 162 ms 15860 KB Output is correct