oj.uz

Submission #698144

# Submission time Handle Problem Language Result Execution time Memory
698144 2023-02-12T13:29:54 Z europium Raisins (IOI09_raisins) C++17
25 / 100
 5000 ms 340 KB 
// - 12/2/23
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <iterator>
#include <set>
#include <map>
#include <math.h>
#include <iomanip>
#include <unordered_set>
#include <queue>
#include <climits>
using namespace std;
// clang++ -std=c++17 IOI09_Raisins.cpp && ./a.out

using ll = long long;
int n, m;
vector<vector<int>> grid, pref;

int sum(int x1, int y1, int x2, int y2){
    x2++;
    y2++;
    return pref[x2][y2] - pref[x2][y1] - pref[x1][y2] + pref[x1][y1];
}

int get(int x1, int y1, int x2, int y2){
    if (x1 == x2 && y1 == y2) return 0;

    int res = INT_MAX;

    // horizontal cuts
    for (int i = x1; i < x2; i++){
        res = min(res, get(x1, y1, i, y2) + get(i + 1, y1, x2, y2) + sum(x1, y1, i, y2) + sum(i + 1, y1, x2, y2));
    }

    // vertical cuts
    for (int j = y1; j < y2; j++){
        res = min(res, get(x1, y1, x2, j) + get(x1, j + 1, x2, y2) + sum(x1, y1, x2, j) + sum(x1, j + 1, x2, y2));
    }

    // cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << ' ' << res << '\n';
    return res;
}

void solve(){
    cin >> n >> m;

    grid.resize(n, vector<int> (m));
    pref.resize(n + 1, vector<int> (m + 1));

    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++) cin >> grid[i][j];
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            pref[i][j] = grid[i-1][j-1] + pref[i-1][j] + pref[i][j-1] - pref[i-1][j-1];
        }
    }

    // for (int i = 0; i <= n; i++){
    //     for (int j = 0; j <= m; j++) cout << pref[i][j] << ' ';
    //     cout << '\n';
    // }

    cout << get(0, 0, n - 1, m - 1);
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen("input.txt", "r", stdin);
    solve();

    return 0;
}

Subtask #1
25.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 50 ms 300 KB Output is correct
6 Execution timed out 5053 ms 212 KB Time limit exceeded
7 Execution timed out 5053 ms 212 KB Time limit exceeded
8 Execution timed out 5076 ms 212 KB Time limit exceeded
9 Execution timed out 5062 ms 212 KB Time limit exceeded
10 Execution timed out 5082 ms 212 KB Time limit exceeded
11 Execution timed out 5042 ms 212 KB Time limit exceeded
12 Execution timed out 5084 ms 212 KB Time limit exceeded
13 Execution timed out 5077 ms 324 KB Time limit exceeded
14 Execution timed out 5043 ms 212 KB Time limit exceeded
15 Execution timed out 5059 ms 212 KB Time limit exceeded
16 Execution timed out 5079 ms 212 KB Time limit exceeded
17 Execution timed out 5069 ms 212 KB Time limit exceeded
18 Execution timed out 5049 ms 340 KB Time limit exceeded
19 Execution timed out 5063 ms 340 KB Time limit exceeded
20 Execution timed out 5077 ms 340 KB Time limit exceeded