oj.uz

Submission #276835

# Submission time Handle Problem Language Result Execution time Memory
276835 2020-08-20T17:06:58 Z FlashGamezzz Raisins (IOI09_raisins) C++17
100 / 100
 345 ms 33828 KB 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
using namespace std;

int choc[50][50];
long psum[51][51] = {};
long long dp[50][50][50][50];
long sum(int r1, int c1, int r2, int c2){ //r2 > r1, c2 > c1;
	r2++;
	c2++;
	return psum[r2][c2]-psum[r2][c1]-psum[r1][c2]+psum[r1][c1];
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			cin >> choc[i][j];
		}
	}
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			psum[i][j] = choc[i-1][j-1] + psum[i-1][j] + psum[i][j-1] - psum[i-1][j-1];
		}
	}
	for (int r1 = 0; r1 < n; r1++){
		for (int c1 = 0; c1 < m; c1++){
			for (int r2 = r1; r2 >= 0; r2--){
				for (int c2 = c1; c2 >= 0; c2--){
					if (r1 == r2 && c1 == c2){
						dp[r2][c2][r1][c1] = 0;
						continue;
					}
					dp[r2][c2][r1][c1] = 1000000000000000;
					for (int i = c1-1; i >= c2; i--){
						dp[r2][c2][r1][c1] = min(dp[r2][c2][r1][c1], dp[r2][c2][r1][i]+dp[r2][i+1][r1][c1]);
					}
					for (int i = r1-1; i >= r2; i--){
						dp[r2][c2][r1][c1] = min(dp[r2][c2][r1][c1], dp[r2][c2][i][c1]+dp[i+1][c2][r1][c1]);
					}
					dp[r2][c2][r1][c1] += sum(r2, c2, r1, c1);
				}
			}
		}
	}
	cout << dp[0][0][n-1][m-1] << endl;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 2 ms 1152 KB Output is correct
8 Correct 4 ms 3584 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 9 ms 5888 KB Output is correct
11 Correct 6 ms 4864 KB Output is correct
12 Correct 27 ms 10616 KB Output is correct
13 Correct 45 ms 13688 KB Output is correct
14 Correct 10 ms 6144 KB Output is correct
15 Correct 57 ms 15352 KB Output is correct
16 Correct 6 ms 5376 KB Output is correct
17 Correct 23 ms 11136 KB Output is correct
18 Correct 183 ms 25468 KB Output is correct
19 Correct 295 ms 31224 KB Output is correct
20 Correct 345 ms 33828 KB Output is correct