# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77035 | win11905 | Orchard (NOI14_orchard) | C++11 | 206 ms | 12592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, m, ans = 1e9;
int main() {
scanf("%d %d", &n, &m);
vector<vector<int>> dp(n+1, vector<int>(m+1));
for(int i = 1; i <= n; ++i) for(int j = 1, ret; j <= m; ++j) scanf("%d", &ret), dp[i][j] = ret + dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
for(int i = 0 ; i < n; ++i) for(int j = i+1; j <= n; ++j) {
int mn = 1e9;
for(int k = 1; k <= m; ++k) {
mn = min(mn, 2 * (dp[j][k-1] - dp[i][k-1]) + (j - i) * (k-1));
ans = min(ans, dp[n][m] - 2 * (dp[j][k] - dp[i][k]) + (j - i) * k + mn);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |