結果
問題 | No.957 植林 |
ユーザー |
![]() |
提出日時 | 2019-12-19 22:09:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 7,589 bytes |
コンパイル時間 | 1,812 ms |
コンパイル使用メモリ | 187,132 KB |
実行使用メモリ | 30,604 KB |
最終ジャッジ日時 | 2024-07-07 01:52:19 |
合計ジャッジ時間 | 6,562 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,756 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 84 ms
22,248 KB |
testcase_04 | AC | 69 ms
22,116 KB |
testcase_05 | AC | 76 ms
22,964 KB |
testcase_06 | AC | 82 ms
24,220 KB |
testcase_07 | AC | 84 ms
21,576 KB |
testcase_08 | AC | 46 ms
22,848 KB |
testcase_09 | AC | 43 ms
23,380 KB |
testcase_10 | AC | 51 ms
23,608 KB |
testcase_11 | AC | 50 ms
23,024 KB |
testcase_12 | AC | 53 ms
22,696 KB |
testcase_13 | AC | 38 ms
19,724 KB |
testcase_14 | AC | 48 ms
25,104 KB |
testcase_15 | AC | 46 ms
23,380 KB |
testcase_16 | AC | 38 ms
20,220 KB |
testcase_17 | AC | 42 ms
21,244 KB |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long int; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); } template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; } ///// This part below is only for debug, not used ///// template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; ///// END ///// /* #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/tag_and_trait.hpp> using namespace __gnu_pbds; // find_by_order(), order_of_key() template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>; */ template<typename T> class Maxflow { struct edge { int to; T cap; int rev; }; std::vector<std::vector<edge> > edges; std::vector<int> level; std::vector<int> iter; std::vector<int> used; void bfs(int s) { level = std::vector<int>(edges.size(), -1); std::queue<int> q; level[s] = 0; q.push(s); while (!q.empty()) { int v = q.front(); q.pop(); for (edge &e : edges[v]) { if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[v] + 1; q.push(e.to); } } } } T dfs_d(int v, int goal, T f) { if (v == goal) return f; for (int &i = iter[v]; i < (int)edges[v].size(); i++) { edge &e = edges[v][i]; if (e.cap > 0 && level[v] < level[e.to]) { T d = dfs_d(e.to, goal, std::min(f, e.cap)); if (d > 0) { e.cap -= d; edges[e.to][e.rev].cap += d; return d; } } } return 0; } T dfs_ff(int v, int goal, T f) { if (v == goal) return f; used[v] = true; for (int i = 0; i < (int)edges[v].size(); i++) { edge &e = edges[v][i]; if (e.cap > 0 && !used[e.to]) { T d = dfs_ff(e.to, goal, std::min(f, e.cap)); if (d > 0) { e.cap -= d; edges[e.to][e.rev].cap += d; return d; } } } return 0; } public: Maxflow(int N) { edges.resize(N); } void add_edge(int from, int to, T capacity) { edges[from].push_back(edge{to, capacity, (int)edges[to].size()}); edges[to].push_back(edge{from, (T)0, (int)edges[from].size() - 1}); } T Dinic(int s, int t) { constexpr T INF = std::numeric_limits<T>::max(); T flow = 0; while (true) { bfs(s); if (level[t] < 0) return flow; iter = std::vector<int>(edges.size(), 0); T f; while ((f = dfs_d(s, t, INF)) > 0) flow += f; } } T FF(int s, int t) { constexpr T INF = std::numeric_limits<T>::max(); T flow = 0; while (true) { used = std::vector<int>(edges.size(), 0); T f = dfs_ff(s, t, INF); if (f == 0) return flow; flow += f; } } void back_flow(int s, int t, int s_e, int t_e, T capacity_reduce) { int i; for (i=0; edges[s_e][i].to != t_e; ) i++; edge &e = edges[s_e][i]; if (capacity_reduce <= e.cap) { e.cap -= capacity_reduce; } else { T flow = capacity_reduce - e.cap; e.cap = 0; edges[e.to][e.rev].cap -= flow; T f_sum = 0; while (f_sum != flow) { used = std::vector<int>(edges.size(), 0); f_sum += dfs_ff(t, t_e, flow - f_sum); } f_sum = 0; while (f_sum != flow) { used = std::vector<int>(edges.size(), 0); f_sum += dfs_ff(s_e, s, flow - f_sum); } } } }; int main() { int H, W; cin >> H >> W; vector<vector<lint>> G(H, vector<lint>(W)); cin >> G; vector<lint> R(H), C(W); cin >> R >> C; int Z = 1 + H + W + H * W; Maxflow<lint> g(Z + 1); REP(i, H) g.add_edge(0, i + 1,R[i]); REP(i, W) g.add_edge(0, H + 1 + i, C[i]); REP(i, H) REP(j, W) { int b = H + W + 1 + i * W + j; g.add_edge(i + 1, b, 1e10); g.add_edge(H + 1 + j, b, 1e10); g.add_edge(b, Z, G[i][j]); } lint f = g.Dinic(0, Z); cout << accumulate(ALL(R), 0LL) + accumulate(ALL(C), 0LL) - f << endl; }