結果
| 問題 | No.421 しろくろチョコレート |
| ユーザー |
 hamray
|
| 提出日時 | 2020-11-24 13:16:00 |
| 言語 | C++11 (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 5 ms / 2,000 ms |
| コード長 | 6,162 bytes |
| コンパイル時間 | 1,973 ms |
| コンパイル使用メモリ | 178,944 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-23 07:30:28 |
| 合計ジャッジ時間 | 4,013 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 65 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>//using namespace atcoder;#pragma GCC target ("avx2")#pragma GCC optimization ("O3")#pragma GCC optimization ("unroll-loops")const double pi = 3.141592653589793238462643383279;using namespace std;//typedef//------------------------------------------typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef pair<long long, long long> PLL;typedef pair<int, PII> TIII;typedef long long LL;typedef unsigned long long ULL;typedef vector<LL> VLL;typedef vector<VLL> VVLL;//container util//------------------------------------------#define ALL(a) (a).begin(), (a).endf()#define RALL(a) (a).rbegin(), (a).rend()#define PB push_back#define MP make_pair#define SZ(a) int((a).size())#define SQ(a) ((a) * (a))#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)#define EXIST(s, e) ((s).find(e) != (s).endf())#define SORT(c) sort((c).begin(), (c).endf())//repetition//------------------------------------------#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)#define REP(i, n) FOR(i, 0, n)#define MOD 1000000007#define rep(i, a, b) for (int i = a; i < (b); ++i)#define trav(a, x) for (auto &a : x)#define all(x) x.begin(), x.end()typedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;#define chmin(x, y) x = min(x, y)#define chmax(x, y) x = max(x, y)const double EPS = 1e-9, PI = acos(-1);//ここから編集typedef string::const_iterator State;template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< 1000000007 >;template< typename T >struct Combination {vector< T > _fact, _rfact, _inv;Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {_fact[0] = _rfact[sz] = _inv[0] = 1;for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;_rfact[sz] /= _fact[sz];for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];}inline T fact(int k) const { return _fact[k]; }inline T rfact(int k) const { return _rfact[k]; }inline T inv(int k) const { return _inv[k]; }T P(int n, int r) const {if(r < 0 || n < r) return 0;return fact(n) * rfact(n - r);}T C(int p, int q) const {if(q < 0 || p < q) return 0;return fact(p) * rfact(q) * rfact(p - q);}T H(int n, int r) const {if(n < 0 || r < 0) return (0);return r == 0 ? 1 : C(n + r - 1, r);}};struct max_flow {struct edge { int to, cap, rev;};int V;vector<vector<edge>> G;vector<int> itr, level;max_flow(int V): V(V) {G.assign(V, vector<edge>());}void add_edge(int from, int to, int cap) {G[from].push_back((edge) {to, cap, (int)G[to].size()});G[to].push_back((edge){from, 0, (int)G[from].size()-1});}void bfs(int s){level.assign(V, -1);queue<int> q;level[s] = 0;q.push(s);while(q.size()){int v = q.front(); q.pop();for(auto &e: G[v]){if(e.cap>0 && level[e.to] < 0){level[e.to] = level[v] + 1;q.push(e.to);}}}}int dfs(int v, int t, int f){if(v == t) return f;for(int& i=itr[v]; i<(int)G[v].size(); i++){edge& e = G[v][i];if(e.cap > 0 && level[v] < level[e.to]) {int d = dfs(e.to, t, min(f, e.cap));if(d > 0){e.cap -= d;G[e.to][e.rev].cap += d;return d;}}}return 0;}int run(int s, int t){int ret = 0, f;while(bfs(s), level[t] >= 0){itr.assign(V, 0);while((f = dfs(s, t, INT_MAX)) > 0) ret += f;}return ret;}};int dxy[5]={-1,0,1,0,-1};int main(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);int N, M; cin >> N >> M;vector<string> f(N);REP(i,N) cin >> f[i];max_flow flow(N*M+2);int s = N*M;int t = N*M+1;int b = 0, w = 0;REP(i,N){REP(j,M){if(f[i][j] == 'b'){b++;flow.add_edge(s, i*M + j, 1);for(int k=0; k<4; k++){int ni = i + dxy[k], nj = j + dxy[k+1];if(ni >= 0 && ni < N && nj >= 0 && nj < M && f[ni][nj] == 'w'){flow.add_edge(i*M+j, ni*M+nj, 1);}}}if(f[i][j] == 'w'){w++;flow.add_edge(i*M+j, t, 1);}}}int mx = flow.run(s, t);b -= mx;w -= mx;int mi = min(b, w);b -= mi;w -= mi;cout << mx * 100 + mi * 10 + b + w << endl;return 0;}