#include using namespace std; using int128 = __int128_t; using int64 = long long; #define ALL(obj) (obj).begin(),(obj).end() /* * @title FastIO * @docs md/util/FastIO.md */ class FastIO{ private: inline static constexpr int ch_0='0'; inline static constexpr int ch_9='9'; inline static constexpr int ch_n='-'; inline static constexpr int ch_s=' '; inline static constexpr int ch_l='\n'; inline static void endline_skip(char& ch) { while(ch==ch_l) ch=getchar(); } template inline static void read_integer(T &x) { int neg=0; char ch; x=0; ch=getchar(); endline_skip(ch); if(ch==ch_n) neg=1,ch=getchar(); for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0); if(neg) x*=-1; } template inline static void read_unsigned_integer(T &x) { char ch; x=0; ch=getchar(); endline_skip(ch); for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0); } inline static void read_string(string &x) { char ch; x=""; ch=getchar(); endline_skip(ch); for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch); } inline static char ar[40]; inline static char *ch_ar; template inline static void write_integer(T x) { ch_ar=ar; if(x< 0) putchar(ch_n), x=-x; if(x==0) putchar(ch_0); for(;x;x/=10) *ch_ar++=(ch_0+x%10); while(ch_ar--!=ar) putchar(*ch_ar); } public: inline static void read(int &x) {read_integer(x);} inline static void read(long long &x) {read_integer(x);} inline static void read(unsigned int &x) {read_unsigned_integer(x);} inline static void read(unsigned long long &x) {read_unsigned_integer(x);} inline static void read(string &x) {read_string(x);} inline static void read(__int128_t &x) {read_integer<__int128_t>(x);} inline static void write(__int128_t x) {write_integer<__int128_t>(x);} inline static void write(char x) {putchar(x);} }; #define read(arg) FastIO::read(arg) #define write(arg) FastIO::write(arg) template using priority_queue_reverse = priority_queue,greater>; constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL; constexpr int64 LOWINF = 1'000'000'000'000'000LL; //' constexpr long double PI = 3.1415926535897932384626433L; template vector multivector(size_t N,T init){return vector(N,init);} template auto multivector(size_t N,T... t){return vector(N,multivector(t...));} template void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template ostream &operator<<(ostream &o, const map&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template ostream &operator<<(ostream &o, const set&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template ostream &operator<<(ostream &o, const multiset&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template ostream &operator<<(ostream &o, const vector&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template ostream &operator<<(ostream &o, const deque&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template ostream &operator<<(ostream &o, const pair&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} void print(void) {cout << endl;} template void print(Head&& head) {cout << head;print();} template void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward(tail)...);} template void chmax(T& a, const T b){a=max(a,b);} template void chmin(T& a, const T b){a=min(a,b);} vector split(const string &str, const char delemiter) {vector res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;} inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b) void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} /* * @title DinicMaxFlow - Dinic法の最大流 * @docs md/graph/DinicMaxFlow.md */ template class DinicMaxFlow { struct Edge { size_t to, rev; TypeFlow cap; }; vector> edge; vector level, iter; TypeFlow max_flow=1e16; inline void bfs(int start) { for (int i = 0; i < level.size(); ++i) level[i] = -1; queue q; level[start] = 0; q.push(start); while (q.size()) { size_t from = q.front(); q.pop(); for (auto& e : edge[from]) { if (e.cap > 0 && level[e.to] < 0) { level[e.to] = level[from] + 1; q.push(e.to); } } } } inline TypeFlow dfs(int from, int goal, TypeFlow flow) { if (from == goal) return flow; for (auto& e: edge[from]) { if (e.cap <= 0 || level[from] >= level[e.to]) continue; TypeFlow dflow = dfs(e.to, goal, min(flow, e.cap)); if (dflow <= 0) continue; e.cap -= dflow; edge[e.to][e.rev].cap += dflow; return dflow; } return 0; } public: DinicMaxFlow(const size_t N) : edge(N), level(N), iter(N) { // do nothing } inline void make_edge(const size_t from, const size_t to, const TypeFlow cap) { edge[from].push_back({ to, edge[to].size(), cap }); edge[to].push_back({ from, edge[from].size() - 1, 0 }); // max_flow += cap; } inline TypeFlow flow(int start, int goal) { TypeFlow sum_flow = 0; while (1) { bfs(start); if (level[goal] < 0) return sum_flow; for (size_t i = 0; i < iter.size(); ++i) iter[i] = 0; TypeFlow dflow; while ((dflow = dfs(start, goal, max_flow))>0) sum_flow += dflow; } } }; //verify https://atcoder.jp/contests/arc085/tasks/arc085_c /** * @url * @est */ int main() { cin.tie(0);ios::sync_with_stdio(false); int H,W; read(H),read(W); vector> grid(H,vector(W)); for(int i=0;i R(H),C(W); for(int i=0;i di(H+W+2); int S = H+W, G = H+W+1; int64 ans = 0; for(int i=0;i= 0) ans += R[i]-cost; //差分が負のとき→ iが0のとき|cost-R[i]|失う else di.make_edge(i,G,abs(R[i]-cost)); } for(int j=0;j