# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242745 | 2020-06-29T08:38:56 Z | SamAnd | Orchard (NOI14_orchard) | C++17 | 425 ms | 29776 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 1000006, INF = 1000000009; int n, m; int** a; int u[N]; void solv() { scanf("%d%d", &n, &m); a = new int*[n + 5]; for (int i = 0; i < n + 5; ++i) { a[i] = new int[m + 5]; for (int j = 0; j < m + 5; ++j) a[i][j] = 0; } int q1 = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scanf("%d", &a[i][j]); if (a[i][j] == 1) ++q1; } } int ans = INF; for (int l = 1; l <= n; ++l) { for (int j = 1; j <= m; ++j) u[j] = 0; for (int r = l; r <= n; ++r) { int p = 0; int maxu = 0; for (int j = 1; j <= m; ++j) { if (a[r][j] == 0) ++u[j]; else --u[j]; p += u[j]; maxu = max(maxu, p); ans = min(ans, p - maxu); } } } ans += q1; printf("%d\n", ans); } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 768 KB | Output is correct |
2 | Correct | 6 ms | 896 KB | Output is correct |
3 | Correct | 6 ms | 768 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 118 ms | 27768 KB | Output is correct |
2 | Correct | 120 ms | 29648 KB | Output is correct |
3 | Correct | 120 ms | 29776 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 3456 KB | Output is correct |
2 | Correct | 27 ms | 3840 KB | Output is correct |
3 | Correct | 26 ms | 3840 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 384 KB | Output is correct |
2 | Correct | 15 ms | 512 KB | Output is correct |
3 | Correct | 14 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 425 ms | 3448 KB | Output is correct |
2 | Correct | 423 ms | 4856 KB | Output is correct |
3 | Correct | 422 ms | 4856 KB | Output is correct |