oj.uz

Submission #1104505

# Submission time Handle Problem Language Result Execution time Memory
1104505 2024-10-24T01:34:45 Z Whisper Orchard (NOI14_orchard) C++17
25 / 25
 121 ms 104124 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numRow, numCol, all = 0;

void process(void){
    cin >> numRow >> numCol;
    vector<vector<int>> A(numRow + 5, vector<int>(numCol + 5));
    vector<vector<int>> pref(numRow + 5, vector<int>(numCol + 5));

    FOR(i, 1, numRow) FOR(j, 1, numCol){
        cin >> A[i][j];
        all += A[i][j];
        if(!A[i][j]) A[i][j] = -1;
    }

    FOR(j, 1, numCol) FOR(i, 1, numRow){
        pref[i][j] = pref[i - 1][j] + A[i][j];
    }
    int res = 0;
    FOR(l, 1, numRow) FOR(r, l, numRow){
        int len = (r - l + 1);
        int sum = 0;

        for (int i = 1; i <= numCol; ++i){
            sum += pref[r][i] - pref[l - 1][i];
            maximize(res, sum);
            if(sum < 0) sum = 0;
        }
    }
    cout << all - res;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Compilation message

orchard.cpp: In function 'void process()':
orchard.cpp:56:13: warning: unused variable 'len' [-Wunused-variable]
   56 |         int len = (r - l + 1);
      |             ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 103948 KB Output is correct
2 Correct 73 ms 104124 KB Output is correct
3 Correct 74 ms 104016 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 12608 KB Output is correct
2 Correct 16 ms 12608 KB Output is correct
3 Correct 18 ms 12592 KB Output is correct

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 13896 KB Output is correct
2 Correct 113 ms 14112 KB Output is correct
3 Correct 111 ms 13912 KB Output is correct