| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 553979 |
2022-04-27T12:59:48 Z |
shmad |
Orchard (NOI14_orchard) |
C++17 |
|
0 ms |
0 KB |
#pragma GCC optimize("O3", "unroll-loops") // "Ofast"#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") #include <bits/stdc++.h>#define int long long#define vt vector#define pb push_back#define all(x) (x).begin(), (x).end()#define sz(x) (int)(x).size()#define ff first#define ss second#define dbg(x) cerr << #x << " = " << x << '\n'#define bit(x, i) (x >> i & 1)using namespace std;using ll = long long;using pii = pair<int, int>;using vvt = vt< vt<int> >;const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);const double eps = 1e-6;int n, m, p[200][5005], v[5005];int get (int l, int r) { int mn = 0, ans = inf; int len = r - l + 1; for (int i = 1; i <= m; i++) { mn = min(mn, v[i] * 2 - (i * len)); ans = min(ans, (i * len) - v[i] * 2 + mn); } return ans;}void solve () { cin >> n >> m; bool a[n + 1][m + 1]; int cnt = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; cnt += a[i][j]; p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + a[i][j]; } } int ans = inf; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { for (int k = 1; k <= m; k++) v[k] = p[j][k] - p[i - 1][k]; ans = min(ans, get(i, j)); } } cout << cnt + ans; cout << '\n';}bool testcases = 0;signed main() {#ifndef ONLINE_JUDGE freopen(".in", "r", stdin); freopen(".out", "w", stdout);#endif cin.tie(0) -> sync_with_stdio(0); int test = 1; if (testcases) cin >> test; for (int cs = 1; cs <= test; cs++) { solve(); }}
Compilation message
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/10/../../../x86_64-linux-gnu/crt1.o: in function `_start':
(.text+0x24): undefined reference to `main'
collect2: error: ld returned 1 exit status
