結果
| 問題 | No.957 植林 |
| コンテスト | |
| ユーザー |
 Pachicobue
|
| 提出日時 | 2019-12-20 02:52:27 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.89.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,074 bytes |
| 記録 | |
| コンパイル時間 | 3,365 ms |
| コンパイル使用メモリ | 210,992 KB |
| 最終ジャッジ日時 | 2025-01-08 13:17:54 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 WA * 1 |
| other | AC * 12 WA * 10 TLE * 23 |
ソースコード
#include <bits/stdc++.h>
// created [2019/12/20] 02:30:02
#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); }
template<typename Cap>
struct flow
{
using capacity_type = Cap;
flow(const usize v) : sz(v), edges(v) {}
void add_edge(const usize from, const usize to, const capacity_type cap) { edges[from].push_back({to, edges[to].size(), cap, false}), edges[to].push_back({from, edges[from].size() - 1, 0, true}); }
struct edge
{
usize to, rev;
capacity_type cap;
const bool is_rev;
};
const std::vector<edge>& operator[](const usize i) const { return edges[i]; }
std::vector<edge>& operator[](const usize i) { return edges[i]; }
friend std::ostream& operator<<(std::ostream& os, const flow& f)
{
os << "[\n";
for (usize i = 0; i < f.size(); i++) {
for (const auto& e : f[i]) {
if (not e.is_rev) { os << i << "->" << e.to << ":"
<< e.cap << "\n"; }
}
}
return (os << "]\n");
}
usize size() const { return sz; }
private:
const usize sz;
std::vector<std::vector<edge>> edges;
};
template<typename Cap>
Cap dinic(flow<Cap>& flow, const usize s, const usize t, const Cap max_cap = inf_v<Cap>)
{
const usize sz = flow.size();
std::vector<usize> level(sz, sz), iter(sz, 0);
auto bfs = [&, sz](const Cap base) {
std::fill(level.begin(), level.end(), sz);
std::queue<usize> q;
q.push(s), level[s] = 0;
while (not q.empty()) {
const usize s = q.front();
q.pop();
for (const auto& e : flow[s]) {
if (e.cap < base or level[e.to] != sz) { continue; }
level[e.to] = level[s] + 1, q.push(e.to);
}
}
};
auto dfs = [&, sz](auto&& self, const usize s, const Cap base, const Cap f) -> Cap {
if (s == t) { return f; }
Cap ans = 0;
for (usize& i = iter[s]; i < flow[s].size(); i++) {
auto& e = flow[s][i];
if (e.cap < base or level[e.to] == sz or level[s] >= level[e.to]) { continue; }
const Cap d = self(self, e.to, base, std::min(f - ans, e.cap));
if (d == 0) { continue; }
e.cap -= d, flow[e.to][e.rev].cap += d, ans += d;
if (f - ans < base) { break; }
}
return ans;
};
Cap f = 0;
for (Cap base = floor2(max_cap); base >= 1;) {
bfs(base);
if (level[t] == sz) {
base >>= 1;
continue;
}
std::fill(iter.begin(), iter.end(), 0);
const Cap df = dfs(dfs, s, base, inf_v<Cap>);
f += df;
}
return f;
}
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);
flow<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];
// f.add_edge(S, i, 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];
// f.add_edge(S, H + j, 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); }
if (R[i] < 0 or C[j] < 0) {
ans += G[i][j];
}
f.add_edge(S, v, G[i][j]);
}
}
SHOW(ans);
outln(ans - dinic(f, S, T, inf));
return 0;
}