結果
| 問題 |
No.957 植林
|
| コンテスト | |
| ユーザー |
 emthrm
|
| 提出日時 | 2019-12-20 02:06:43 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 8,215 bytes |
| コンパイル時間 | 1,974 ms |
| コンパイル使用メモリ | 139,324 KB |
| 最終ジャッジ日時 | 2025-01-08 13:14:44 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 27 TLE * 18 |
ソースコード
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(10);
}
} iosetup;
/*-------------------------------------------------*/
// https://github.com/ei1333/library/blob/master/graph/flow/push-relabel.cpp
class Stack {
private:
const int N, H;
vector< int > node;
public:
Stack(const int N, const int H) : N(N), H(H), node(N + H) { clear(); }
inline bool empty(const int h) const { return node[N + h] == N + h; }
inline int top(const int h) const { return node[N + h]; }
inline void pop(const int h) { node[N + h] = node[node[N + h]]; }
inline void push(const int h, const int u) { node[u] = node[N + h], node[N + h] = u; }
inline void clear() { iota(node.begin() + N, node.end(), N); }
};
class List {
public:
struct node {
int prev, next;
};
const int N, H;
vector< node > dat;
List(const int N, const int H) : N(N), H(H), dat(N + H) { clear(); }
inline bool empty(const int h) const { return (dat[N + h].next == N + h); }
inline bool more_one(const int h) const { return dat[N + h].prev != dat[N + h].next; }
inline void insert(const int h, const int u) {
dat[u].prev = dat[N + h].prev, dat[u].next = N + h;
dat[dat[N + h].prev].next = u, dat[N + h].prev = u;
}
inline void erase(const int u) {
dat[dat[u].prev].next = dat[u].next, dat[dat[u].next].prev = dat[u].prev;
}
inline void clear() {
for(int i = N; i < N + H; ++i) dat[i].prev = dat[i].next = i;
}
};
template< typename flow_t >
struct PushRelabel {
struct edge {
int to;
flow_t cap;
int rev;
bool isrev;
int idx;
};
vector< vector< edge > > graph;
vector< int > potential, cur_edge;
vector< flow_t > ex;
int V, height, relabels;
List all_ver;
Stack act_ver;
PushRelabel(int V)
: V(V), height(-1), relabels(0), ex(V, flow_t(0)), potential(V, 0), cur_edge(V), all_ver(V, V), act_ver(V, V), 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});
}
int calc_active(int t) {
height = -1;
for(int i = 0; i < V; i++) {
if(potential[i] < V) {
cur_edge[i] = 0;
height = max(height, potential[i]);
all_ver.insert(potential[i], i);
if(ex[i] > 0 && i != t) act_ver.push(potential[i], i);
} else {
potential[i] = V + 1;
}
}
return height;
}
void bfs(int t) {
for(int i = 0; i < V; i++) {
potential[i] = max(potential[i], V);
}
potential[t] = 0;
queue< int > que;
que.emplace(t);
while(!que.empty()) {
int p = que.front();
que.pop();
for(auto &e : graph[p]) {
if(potential[e.to] == V && graph[e.to][e.rev].cap > 0) {
potential[e.to] = potential[p] + 1;
que.emplace(e.to);
}
}
}
}
int init(int s, int t) {
potential[s] = V + 1;
bfs(t);
for(auto &e : graph[s]) {
if(potential[e.to] < V) {
graph[e.to][e.rev].cap = e.cap;
ex[s] -= e.cap;
ex[e.to] += e.cap;
}
e.cap = 0;
}
return calc_active(t);
}
bool push(int u, int t, edge &e) {
flow_t f = min(e.cap, ex[u]);
int v = e.to;
e.cap -= f, ex[u] -= f;
graph[v][e.rev].cap += f, ex[v] += f;
if(ex[v] == f && v != t) act_ver.push(potential[v], v);
return ex[u] == 0;
}
int discharge(int u, int t) {
for(int &i = cur_edge[u]; i < graph[u].size(); i++) {
auto &e = graph[u][i];
if(potential[u] == potential[e.to] + 1 && e.cap > 0) {
if(push(u, t, e)) return potential[u];
}
}
return relabel(u);
}
int global_relabel(int t) {
bfs(t);
all_ver.clear(), act_ver.clear();
return calc_active(t);
}
void gap_relabel(const int u) {
for(int i = potential[u]; i <= height; ++i) {
for(int id = all_ver.dat[V + i].next; id < V; id = all_ver.dat[id].next) {
potential[id] = V + 1;
}
all_ver.dat[V + i].prev = all_ver.dat[V + i].next = V + i;
}
}
int relabel(const int u) {
++relabels;
int prv = potential[u], cur = V;
for(int i = 0; i < (int) graph[u].size(); ++i) {
const edge &e = graph[u][i];
if(cur > potential[e.to] + 1 && e.cap > 0) {
cur_edge[u] = i;
cur = potential[e.to] + 1;
}
}
if(all_ver.more_one(prv)) {
all_ver.erase(u);
if((potential[u] = cur) == V) return potential[u] = V + 1, prv;
act_ver.push(cur, u);
all_ver.insert(cur, u);
height = max(height, cur);
} else {
gap_relabel(u);
return height = prv - 1;
}
return cur;
}
flow_t max_flow(int s, int t) {
int level = init(s, t);
while(level >= 0) {
if(act_ver.empty(level)) {
--level;
continue;
}
int u = act_ver.top(level);
act_ver.pop(level);
level = discharge(u, t);
if(relabels * 2 >= V) {
level = global_relabel(t);
relabels = 0;
}
}
return ex[t];
}
};
template <template <typename> class C, typename T>
struct ProjectSelectionProblem {
ProjectSelectionProblem(int n, T TINF) : n(n), TINF(TINF) {}
void add_diff(int u, int v, T cost) {
assert(cost >= 0);
diff_u.emplace_back(u);
diff_v.emplace_back(v);
diff_cost.emplace_back(cost);
}
void add_same(int u, int v, int group, T cost) {
assert(cost <= 0);
cost *= -1;
res += cost;
add(n, group ^ 1, cost);
if (group == 0) {
add_diff(n, u, TINF);
add_diff(n, v, TINF);
} else if (group == 1) {
add_diff(u, n, TINF);
add_diff(v, n, TINF);
}
++n;
}
void add(int ver, int group, T cost) {
if (cost < 0) {
cost *= -1;
res += cost;
add(ver, group ^ 1, cost);
} else {
if (group == 0) {
add_diff(ver, -1, cost);
} else {
add_diff(-2, ver, cost);
}
}
}
T solve() {
C<T> flow(n + 2);
int sz = diff_u.size();
REP(i, sz) {
if (diff_u[i] < 0) diff_u[i] += n + 2;
if (diff_v[i] < 0) diff_v[i] += n + 2;
flow.add_edge(diff_u[i], diff_v[i], diff_cost[i]);
}
sz = same_u.size();
REP(i, sz) {
if (same_u[i] < 0) same_u[i] += n + 2;
if (same_v[i] < 0) same_v[i] += n + 2;
flow.add_edge(same_u[i], same_v[i], same_cost[i]);
}
return flow.max_flow(n, n + 1) - res;
// return flow.maximum_flow(n, n + 1, TINF) - res;
}
private:
int n;
T TINF, res = 0;
vector<int> diff_u, diff_v, same_u, same_v;
vector<T> diff_cost, same_cost;
};
int main() {
int h, w; cin >> h >> w;
vector<vector<int> > g(h, vector<int>(w)); REP(i, h) REP(j, w) cin >> g[i][j];
vector<int> r(h), c(w);
REP(i, h) cin >> r[i];
REP(i, w) cin >> c[i];
ProjectSelectionProblem<PushRelabel, long long> psp(h + w, LINF);
REP(i, h) {
long long cost = -r[i];
REP(j, w) cost += g[i][j];
psp.add(i, 1, cost);
}
REP(j, w) {
long long cost = -c[j];
REP(i, h) cost += g[i][j];
psp.add(h + j, 1, cost);
}
REP(i, h) REP(j, w) psp.add_same(i, h + j, 1, -g[i][j]);
cout << -psp.solve() << '\n';
return 0;
}