Submission #1113209

#TimeUsernameProblemLanguageResultExecution timeMemory
1113209votranngocvyOrchard (NOI14_orchard)C++14
8 / 25
1065 ms26704 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int N = 5e3 + 2; int a[155][N],sum[N],pre[155][N],suf[N]; int n,m,total; bool check(int mid) { for (int l = 1; l <= n; l++) for (int r = l; r <= n; r++) { sum[0] = 0; for (int i = 1; i <= m; i++) sum[i] = sum[i - 1] + pre[r][i] - pre[l - 1][i]; suf[m + 1] = 1e18; for (int i = m; i > 0; i--) suf[i] = min(suf[i + 1],2 * sum[i] - (r - l + 1) * i); for (int i = 1; i <= m; i++) if (suf[i + 1] <= mid + 2 * sum[i - 1] - total - (r - l + 1) * (i - 1)) return 1; } return 0; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; total = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { char x; cin >> x; a[i][j] = x - '0'; total += a[i][j]; pre[i][j] = pre[i - 1][j] + 1 - a[i][j]; } int l = 0,r = n * m,ans = -1; while (l <= r) { int mid = (l + r) / 2; if (check(mid)) ans = mid,r = mid - 1; else l = mid + 1; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...