# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
126048 |
2019-07-06T21:04:15 Z |
streifi |
Orchard (NOI14_orchard) |
C++14 |
|
165 ms |
16044 KB |
#include <iostream>
#include <vector>
using namespace std;
//const int INF = 0x3f3f3f3f;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M, cnt = 0;
cin >> N >> M;
vector<vector<int>> v(N, vector<int>(M)), cum(N+1, vector<int>(M+1, 0));
for (int n = 0; n < N; ++n) {
for (int m = 0; m < M; ++m) {
cin >> v[n][m];
if (v[n][m] == 0)
v[n][m] = -1;
else
++cnt;
cum[n+1][m+1] = cum[n+1][m]+cum[n][m+1]-cum[n][m]+v[n][m];
//cout << cum[m+1] << endl;
}
}
/*for (int n = 1; n <= N; ++n) {
for (int m = 1; m <= M; ++m) {
cout << cum[n][m] << " ";
}
cout << endl;
}*/
int best = 0;
for (int i = 0; i < N; ++i) {
for (int j = i; j < N; ++j) {
int mxpos = M-1;
for (int m = M-1; m >= 0; --m) {
if (cum[j+1][m+1] > cum[j+1][mxpos+1]) mxpos = m;
best = max(best, cum[j+1][mxpos+1]-cum[j+1][m]-cum[i][mxpos+1]+cum[i][m]);
}
}
}
cout << (cnt-best) << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
632 KB |
Output is correct |
3 |
Correct |
3 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
96 ms |
16044 KB |
Output is correct |
2 |
Correct |
96 ms |
16044 KB |
Output is correct |
3 |
Correct |
96 ms |
16044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
2672 KB |
Output is correct |
2 |
Incorrect |
20 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
7 ms |
504 KB |
Output is correct |
3 |
Correct |
7 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
165 ms |
6264 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |