結果
| 問題 | No.2473 Fraises dans une boîte |
| ユーザー |
👑  rin204
|
| 提出日時 | 2023-07-30 15:31:04 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,600 bytes |
| コンパイル時間 | 3,767 ms |
| コンパイル使用メモリ | 259,412 KB |
| 実行使用メモリ | 10,496 KB |
| 最終ジャッジ日時 | 2024-11-07 08:42:26 |
| 合計ジャッジ時間 | 27,593 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 45 TLE * 2 -- * 18 |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;template <class T>using pq = priority_queue<T>;template <class T>using qp = priority_queue<T, vector<T>, greater<T>>;#define vec(T, A, ...) vector<T> A(__VA_ARGS__);#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));#ifndef RIN__LOCAL#define endl "\n"#endif#define spa ' '#define len(A) A.size()#define all(A) begin(A), end(A)#define fori1(a) for (ll _ = 0; _ < (a); _++)#define fori2(i, a) for (ll i = 0; i < (a); i++)#define fori3(i, a, b) for (ll i = (a); i < (b); i++)#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))#define overload4(a, b, c, d, e, ...) e#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)vector<char> stoc(string &S) {int n = S.size();vector<char> ret(n);for (int i = 0; i < n; i++) ret[i] = S[i];return ret;}#define INT(...)\int __VA_ARGS__;\inp(__VA_ARGS__);#define LL(...)\ll __VA_ARGS__;\inp(__VA_ARGS__);#define STRING(...)\string __VA_ARGS__;\inp(__VA_ARGS__);#define CHAR(...)\char __VA_ARGS__;\inp(__VA_ARGS__);#define VEC(T, A, n)\vector<T> A(n);\inp(A);#define VVEC(T, A, n, m)\vector<vector<T>> A(n, vector<T>(m));\inp(A);const ll MOD1 = 1000000007;const ll MOD9 = 998244353;template <class T>auto min(const T &a) {return *min_element(all(a));}template <class T>auto max(const T &a) {return *max_element(all(a));}template <class T, class S>auto clamp(T &a, const S &l, const S &r) {return (a > r ? r : a < l ? l : a);}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}template <class T, class S>inline bool chclamp(T &a, const S &l, const S &r) {auto b = clamp(a, l, r);return (a != b ? a = b, 1 : 0);}void FLUSH() {cout << flush;}void print() {cout << endl;}template <class Head, class... Tail>void print(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail)) cout << spa;print(forward<Tail>(tail)...);}template <typename T>void print(vector<T> &A) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << ' ';}cout << endl;}template <typename T>void print(vector<vector<T>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void print(pair<T, S> &A) {cout << A.first << spa << A.second << endl;}template <typename T, typename S>void print(vector<pair<T, S>> &A) {for (auto &row : A) print(row);}template <typename T, typename S>void prisep(vector<T> &A, S sep) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << sep;}cout << endl;}template <typename T, typename S>void priend(T A, S end) {cout << A << end;}template <typename T>void priend(T A) {priend(A, spa);}template <typename T, typename S>bool printif(bool f, T A, S B) {if (f)print(A);elseprint(B);return f;}template <class... T>void inp(T &...a) {(cin >> ... >> a);}template <typename T>void inp(vector<T> &A) {for (auto &a : A) cin >> a;}template <typename T>void inp(vector<vector<T>> &A) {for (auto &row : A) inp(row);}template <typename T, typename S>void inp(pair<T, S> &A) {inp(A.first, A.second);}template <typename T, typename S>void inp(vector<pair<T, S>> &A) {for (auto &row : A) inp(row.first, row.second);}template <typename T>T sum(vector<T> &A) {T tot = 0;for (auto a : A) tot += a;return tot;}template <typename T>vector<T> compression(vector<T> X) {sort(all(X));X.erase(unique(all(X)), X.end());return X;}vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<int>> edges(n, vector<int>());for (int i = 0; i < m; i++) {INT(u, v);u -= indexed;v -= indexed;edges[u].push_back(v);if (!direct) edges[v].push_back(u);}return edges;}vector<vector<int>> read_tree(int n, int indexed = 1) {return read_edges(n, n - 1, false, indexed);}template <typename T>vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());for (int i = 0; i < m; i++) {INT(u, v);T w;inp(w);u -= indexed;v -= indexed;edges[u].push_back({v, w});if (!direct) edges[v].push_back({u, w});}return edges;}template <typename T>vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {return read_wedges<T>(n, n - 1, false, indexed);}inline bool yes(bool f = true) {cout << (f ? "yes" : "no") << endl;return f;}inline bool Yes(bool f = true) {cout << (f ? "Yes" : "No") << endl;return f;}inline bool YES(bool f = true) {cout << (f ? "YES" : "NO") << endl;return f;}inline bool no(bool f = true) {cout << (!f ? "yes" : "no") << endl;return f;}inline bool No(bool f = true) {cout << (!f ? "Yes" : "No") << endl;return f;}inline bool NO(bool f = true) {cout << (!f ? "YES" : "NO") << endl;return f;}void solve() {INT(h, w);VVEC(int, S, h, w);vvec(int, A, 0, 0);vec(int, row, h, 0);vec(int, col, w, 0);fori(i, h) fori(j, w) {row[i] += S[i][j];col[j] += S[i][j];}fori(i, h) {if (row[i] == 0) continue;vec(int, tmp, 0);fori(j, w) {if (col[j]) tmp.push_back(S[i][j]);}A.push_back(tmp);}// swap(A, S);h = S.size();if (h == 0) {print(0);return;}w = S[0].size();vvec(int, dp, h + 1, w + 1, 1 << 30);vvec(int, cum, h + 1, w + 1, 0);fori(i, h) fori(j, w) {cum[i + 1][j + 1] = cum[i + 1][j] + cum[i][j + 1] - cum[i][j] + S[i][j];}auto f = [&](int i0, int i1, int j0, int j1) { return cum[i1][j1] - cum[i0][j1] - cum[i1][j0] + cum[i0][j0]; };dp[h][w] = 0;fori(i, h, -1, -1) fori(j, w, -1, -1) {if (i != h && f(i, i + 1, j, w) == 0) chmin(dp[i][j], dp[i + 1][j]);if (j != w && f(i, h, j, j + 1) == 0) chmin(dp[i][j], dp[i][j + 1]);vec(int, row, h + 1, 0);vec(int, col, w + 1, 0);fori(i, h) row[i + 1] = row[i] + (f(i, i + 1, j, w) > 0 ? 1 : 0);fori(j, w) col[j + 1] = col[j] + (f(i, h, j, j + 1) > 0 ? 1 : 0);fori(i2, i, h + 1) fori(j2, j, w + 1) {if (f(i2, h, j2, w) == 0) {int tmp = dp[i2][j] + dp[i][j2] + (row[i2] - row[i]) * (col[j2] - col[j]) - f(i, i2, j, j2);chmin(dp[i][j], tmp);}}}print(dp[0][0]);}int main() {cin.tie(0)->sync_with_stdio(0);// cout << fixed << setprecision(12);int t;t = 1;// cin >> t;while (t--) solve();return 0;}