結果
| 問題 | No.957 植林 |
| ユーザー |
 Pachicobue
|
| 提出日時 | 2019-12-20 04:04:16 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 12,128 bytes |
| コンパイル時間 | 2,069 ms |
| コンパイル使用メモリ | 221,768 KB |
| 実行使用メモリ | 31,956 KB |
| 最終ジャッジ日時 | 2024-07-07 05:47:07 |
| 合計ジャッジ時間 | 6,620 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
10,752 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 79 ms
26,272 KB |
| testcase_04 | AC | 68 ms
24,544 KB |
| testcase_05 | AC | 69 ms
27,124 KB |
| testcase_06 | AC | 82 ms
28,608 KB |
| testcase_07 | AC | 84 ms
25,556 KB |
| testcase_08 | AC | 33 ms
16,668 KB |
| testcase_09 | AC | 32 ms
16,708 KB |
| testcase_10 | AC | 34 ms
17,432 KB |
| testcase_11 | AC | 33 ms
17,844 KB |
| testcase_12 | AC | 34 ms
17,756 KB |
| testcase_13 | AC | 20 ms
11,956 KB |
| testcase_14 | AC | 25 ms
15,240 KB |
| testcase_15 | AC | 24 ms
13,712 KB |
| testcase_16 | AC | 19 ms
12,732 KB |
| testcase_17 | AC | 20 ms
12,768 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>
// created [2019/12/20] 03:56:38
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod = 1000000007;
template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };
template<typename T>
T in()
{
T v;
return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
const usize s = (usize)szs[i];
std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
io_init()
{
std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
}
void clear()
{
std::cin.tie(), std::ios::sync_with_stdio(true);
}
} io_setting;
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
for (usize i = 0; i < v.size(); i++) {
if (i > 0) { std::cout << ' '; }
out(v[i]);
}
return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
# define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
const usize s = (usize)szs[i];
return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
using namespace std;
template<typename flow_t>
struct Dinic
{
const flow_t INF;
struct edge
{
int to;
flow_t cap;
int rev;
bool isrev;
int idx;
};
vector<vector<edge>> graph;
vector<int> min_cost, iter;
Dinic(int V) : INF(inf_v<flow_t>), graph(V) {}
void add_edge(int from, int to, flow_t cap, int idx = -1)
{
graph[from].emplace_back((edge){to, cap, (int)graph[to].size(), false, idx});
graph[to].emplace_back((edge){from, 0, (int)graph[from].size() - 1, true, idx});
}
bool bfs(int s, int t)
{
min_cost.assign(graph.size(), -1);
queue<int> que;
min_cost[s] = 0;
que.push(s);
while (!que.empty() && min_cost[t] == -1) {
int p = que.front();
que.pop();
for (auto& e : graph[p]) {
if (e.cap > 0 && min_cost[e.to] == -1) {
min_cost[e.to] = min_cost[p] + 1;
que.push(e.to);
}
}
}
return min_cost[t] != -1;
}
flow_t dfs(int idx, const int t, flow_t flow)
{
if (idx == t) return flow;
for (int& i = iter[idx]; i < graph[idx].size(); i++) {
edge& e = graph[idx][i];
if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {
flow_t d = dfs(e.to, t, min(flow, e.cap));
if (d > 0) {
e.cap -= d;
graph[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
flow_t max_flow(int s, int t)
{
flow_t flow = 0;
while (bfs(s, t)) {
iter.assign(graph.size(), 0);
flow_t f = 0;
while ((f = dfs(s, t, INF)) > 0) flow += f;
}
return flow;
}
void output()
{
for (int i = 0; i < graph.size(); i++) {
for (auto& e : graph[i]) {
if (e.isrev) continue;
auto& rev_e = graph[e.to][e.rev];
cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << e.cap + rev_e.cap << ")" << endl;
}
}
}
};
template<typename flow_t>
struct PushRelabel
{
const flow_t INF;
struct edge
{
int to;
flow_t cap;
int rev;
bool isrev;
int idx;
};
vector<vector<edge>> graph;
vector<flow_t> ex;
int relabels, high;
vector<int> cnt, h;
vector<vector<int>> hs;
PushRelabel(int V) : INF(inf_v<flow_t>), graph(V), high(0), hs(V + 1) {}
void add_edge(int from, int to, flow_t cap, int idx = -1)
{
graph[from].emplace_back((edge){to, cap, (int)graph[to].size(), false, idx});
graph[to].emplace_back((edge){from, 0, (int)graph[from].size() - 1, true, idx});
}
void update_height(int idx, int nxt_height)
{
++relabels;
if (h[idx] != graph.size() + 1) {
--cnt[h[idx]];
}
h[idx] = nxt_height;
if (h[idx] != graph.size() + 1) {
high = nxt_height;
++cnt[nxt_height];
if (ex[idx] > 0) hs[nxt_height].emplace_back(idx);
}
}
void global_relabel(int idx)
{
for (int i = 0; i <= high; i++) hs[i].clear();
relabels = 0;
high = 0;
h.assign(graph.size(), graph.size() + 1);
cnt.assign(graph.size(), 0);
queue<int> que;
que.emplace(idx);
h[idx] = 0;
while (que.size()) {
int p = que.front();
que.pop();
for (auto& e : graph[p]) {
if (h[e.to] == graph.size() + 1 && graph[e.to][e.rev].cap > 0) {
que.emplace(e.to);
high = h[p] + 1;
update_height(e.to, high);
}
}
}
}
void push(int idx, edge& e)
{
if (h[e.to] == graph.size() + 1) return;
if (ex[e.to] == 0) {
hs[h[e.to]].emplace_back(e.to);
}
flow_t df = min(ex[idx], e.cap);
e.cap -= df;
graph[e.to][e.rev].cap += df;
ex[idx] -= df;
ex[e.to] += df;
}
void discharge(int idx)
{
int next_height = (int)graph.size() + 1;
for (auto&& e : graph[idx]) {
if (e.cap > 0) {
if (h[idx] == h[e.to] + 1) {
push(idx, e);
if (ex[idx] <= 0) return;
} else {
next_height = min(next_height, h[e.to] + 1);
}
}
}
if (cnt[h[idx]] > 1) {
update_height(idx, next_height);
} else {
for (; high >= h[idx]; hs[high--].clear()) {
for (int j : hs[high]) update_height(j, graph.size() + 1);
}
}
}
flow_t max_flow(int s, int t)
{
ex.assign(graph.size(), 0);
ex[s] = INF;
ex[t] = -INF;
global_relabel(t);
for (auto& e : graph[s]) push(s, e);
for (; high >= 0; high--) {
while (!hs[high].empty()) {
int idx = hs[high].back();
hs[high].pop_back();
discharge(idx);
if (relabels >= graph.size() * 4) global_relabel(t);
}
}
return ex[t] + INF;
}
void output()
{
for (int i = 0; i < graph.size(); i++) {
for (auto& e : graph[i]) {
if (e.isrev) continue;
auto& rev_e = graph[e.to][e.rev];
cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << e.cap + rev_e.cap << ")" << endl;
}
}
}
};
int main()
{
const auto [H, W] = in_t<int, int>();
const auto G = in_v<ll>({H, W});
auto R = in_v<ll>({H});
auto C = in_v<ll>({W});
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
R[i] -= G[i][j];
C[j] -= G[i][j];
}
}
constexpr ll inf = TEN(9);
// PushRelabel<ll> f(H * W + H + W + 2);
Dinic<ll> f(H * W + H + W + 2);
const int S = H * W + H + W;
const int T = H * W + H + W + 1;
ll ans = 0;
for (int i = 0; i < H; i++) {
if (R[i] < 0) {
f.add_edge(i, T, -R[i]);
} else {
ans += R[i];
}
}
for (int j = 0; j < W; j++) {
if (C[j] < 0) {
f.add_edge(H + j, T, -C[j]);
} else {
ans += C[j];
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
const int v = i * W + j + H + W;
if (R[i] < 0) { f.add_edge(v, i, inf); }
if (C[j] < 0) { f.add_edge(v, H + j, inf); }
ans += G[i][j];
if (R[i] < 0 or C[j] < 0) { f.add_edge(S, v, G[i][j]); }
}
}
SHOW(ans);
outln(ans - f.max_flow(S, T));
return 0;
}