結果
問題 | No.421 しろくろチョコレート |
ユーザー | kei |
提出日時 | 2018-12-06 00:53:49 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 3,173 bytes |
コンパイル時間 | 2,091 ms |
コンパイル使用メモリ | 180,132 KB |
実行使用メモリ | 4,348 KB |
最終ジャッジ日時 | 2023-10-24 14:56:56 |
合計ジャッジ時間 | 3,750 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 3 ms
4,348 KB |
testcase_02 | AC | 3 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 2 ms
4,348 KB |
testcase_12 | AC | 2 ms
4,348 KB |
testcase_13 | AC | 2 ms
4,348 KB |
testcase_14 | AC | 2 ms
4,348 KB |
testcase_15 | AC | 2 ms
4,348 KB |
testcase_16 | AC | 4 ms
4,348 KB |
testcase_17 | AC | 3 ms
4,348 KB |
testcase_18 | AC | 4 ms
4,348 KB |
testcase_19 | AC | 1 ms
4,348 KB |
testcase_20 | AC | 3 ms
4,348 KB |
testcase_21 | AC | 3 ms
4,348 KB |
testcase_22 | AC | 2 ms
4,348 KB |
testcase_23 | AC | 1 ms
4,348 KB |
testcase_24 | AC | 2 ms
4,348 KB |
testcase_25 | AC | 2 ms
4,348 KB |
testcase_26 | AC | 2 ms
4,348 KB |
testcase_27 | AC | 2 ms
4,348 KB |
testcase_28 | AC | 2 ms
4,348 KB |
testcase_29 | AC | 3 ms
4,348 KB |
testcase_30 | AC | 2 ms
4,348 KB |
testcase_31 | AC | 10 ms
4,348 KB |
testcase_32 | AC | 3 ms
4,348 KB |
testcase_33 | AC | 3 ms
4,348 KB |
testcase_34 | AC | 2 ms
4,348 KB |
testcase_35 | AC | 2 ms
4,348 KB |
testcase_36 | AC | 2 ms
4,348 KB |
testcase_37 | AC | 5 ms
4,348 KB |
testcase_38 | AC | 5 ms
4,348 KB |
testcase_39 | AC | 2 ms
4,348 KB |
testcase_40 | AC | 4 ms
4,348 KB |
testcase_41 | AC | 2 ms
4,348 KB |
testcase_42 | AC | 2 ms
4,348 KB |
testcase_43 | AC | 2 ms
4,348 KB |
testcase_44 | AC | 5 ms
4,348 KB |
testcase_45 | AC | 2 ms
4,348 KB |
testcase_46 | AC | 2 ms
4,348 KB |
testcase_47 | AC | 2 ms
4,348 KB |
testcase_48 | AC | 8 ms
4,348 KB |
testcase_49 | AC | 2 ms
4,348 KB |
testcase_50 | AC | 2 ms
4,348 KB |
testcase_51 | AC | 6 ms
4,348 KB |
testcase_52 | AC | 2 ms
4,348 KB |
testcase_53 | AC | 2 ms
4,348 KB |
testcase_54 | AC | 2 ms
4,348 KB |
testcase_55 | AC | 2 ms
4,348 KB |
testcase_56 | AC | 2 ms
4,348 KB |
testcase_57 | AC | 2 ms
4,348 KB |
testcase_58 | AC | 2 ms
4,348 KB |
testcase_59 | AC | 2 ms
4,348 KB |
testcase_60 | AC | 7 ms
4,348 KB |
testcase_61 | AC | 8 ms
4,348 KB |
testcase_62 | AC | 2 ms
4,348 KB |
testcase_63 | AC | 2 ms
4,348 KB |
testcase_64 | AC | 3 ms
4,348 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/421> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ ll V; vector<vector<ll>> G; vector<ll> match; vector<int> used; void add_edge(ll u, ll v) { G[u].push_back(v); G[v].push_back(u); } bool dfs(ll v) { used[v] = 1; for (int i = 0; i < G[v].size(); i++) { ll u = G[v][i], w = match[u]; if (w < 0 || ((used[w] == 0) && dfs(w))) { match[v] = u; match[u] = v; return true; } } return false; } ll bipartite_matching() { ll res = 0; for (int i = 0; i < (int)match.size();i++)match[i] = -1; for (int v = 0;v < V;v++) { if (match[v] < 0) { for (int i = 0; i < (int)used.size();i++)used[i] = 0; if (dfs(v))res++; } } return res; } ll solve(){ ll res = 0; int N,M; cin >> N >> M; vector<vector<char>> S(N+2,vector<char>(M+2,'.')); int cntb = 0,cntw = 0; for(int i = 1; i<= N;i++) for(int j = 1; j <= M;j++){ cin >> S[i][j]; cntb += S[i][j] == 'b'; cntw += S[i][j] == 'w'; } int d[4] = {1,0,-1,0}; V = (N+2)*(M+2); G.resize(V); used.resize(V); match.resize(V); for(int i = 1; i <= N;i++){ for(int j = 1; j <= M;j++){ if(S[i][j] == '.') continue; for(int k = 0; k < 4;k++){ int ni = i + d[k]; int nj = j + d[k^1]; if(S[ni][nj] == '.') continue; if(S[i][j] != S[ni][nj]){ add_edge(i*(M+2)+j,ni*(M+2)+nj); } } } } ll bm = bipartite_matching(); res += bm*100; cntw -= bm; cntb -= bm; res += 10*min(cntw,cntb); res += max(cntw,cntb) - min(cntw,cntb); return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }