結果
| 問題 | No.421 しろくろチョコレート |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-09-07 21:25:18 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 5 ms / 2,000 ms |
| コード長 | 8,886 bytes |
| コンパイル時間 | 1,193 ms |
| コンパイル使用メモリ | 117,924 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-09-23 07:04:07 |
| 合計ジャッジ時間 | 2,789 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 3 ms
6,940 KB |
| testcase_02 | AC | 3 ms
6,944 KB |
| testcase_03 | AC | 2 ms
6,944 KB |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | AC | 3 ms
6,944 KB |
| testcase_06 | AC | 2 ms
6,940 KB |
| testcase_07 | AC | 2 ms
6,944 KB |
| testcase_08 | AC | 2 ms
6,940 KB |
| testcase_09 | AC | 2 ms
6,944 KB |
| testcase_10 | AC | 2 ms
6,944 KB |
| testcase_11 | AC | 3 ms
6,940 KB |
| testcase_12 | AC | 2 ms
6,944 KB |
| testcase_13 | AC | 2 ms
6,944 KB |
| testcase_14 | AC | 2 ms
6,944 KB |
| testcase_15 | AC | 2 ms
6,944 KB |
| testcase_16 | AC | 4 ms
6,940 KB |
| testcase_17 | AC | 4 ms
6,940 KB |
| testcase_18 | AC | 4 ms
6,944 KB |
| testcase_19 | AC | 2 ms
6,940 KB |
| testcase_20 | AC | 3 ms
6,940 KB |
| testcase_21 | AC | 3 ms
6,944 KB |
| testcase_22 | AC | 2 ms
6,944 KB |
| testcase_23 | AC | 2 ms
6,940 KB |
| testcase_24 | AC | 2 ms
6,944 KB |
| testcase_25 | AC | 2 ms
6,944 KB |
| testcase_26 | AC | 2 ms
6,940 KB |
| testcase_27 | AC | 2 ms
6,940 KB |
| testcase_28 | AC | 3 ms
6,940 KB |
| testcase_29 | AC | 2 ms
6,940 KB |
| testcase_30 | AC | 3 ms
6,944 KB |
| testcase_31 | AC | 3 ms
6,940 KB |
| testcase_32 | AC | 3 ms
6,944 KB |
| testcase_33 | AC | 3 ms
6,944 KB |
| testcase_34 | AC | 2 ms
6,944 KB |
| testcase_35 | AC | 2 ms
6,940 KB |
| testcase_36 | AC | 2 ms
6,944 KB |
| testcase_37 | AC | 4 ms
6,944 KB |
| testcase_38 | AC | 5 ms
6,948 KB |
| testcase_39 | AC | 2 ms
6,940 KB |
| testcase_40 | AC | 3 ms
6,944 KB |
| testcase_41 | AC | 2 ms
6,944 KB |
| testcase_42 | AC | 2 ms
6,940 KB |
| testcase_43 | AC | 2 ms
6,944 KB |
| testcase_44 | AC | 3 ms
6,944 KB |
| testcase_45 | AC | 2 ms
6,940 KB |
| testcase_46 | AC | 2 ms
6,940 KB |
| testcase_47 | AC | 2 ms
6,940 KB |
| testcase_48 | AC | 3 ms
6,944 KB |
| testcase_49 | AC | 3 ms
6,944 KB |
| testcase_50 | AC | 2 ms
6,944 KB |
| testcase_51 | AC | 3 ms
6,940 KB |
| testcase_52 | AC | 2 ms
6,944 KB |
| testcase_53 | AC | 2 ms
6,944 KB |
| testcase_54 | AC | 2 ms
6,944 KB |
| testcase_55 | AC | 2 ms
6,940 KB |
| testcase_56 | AC | 2 ms
6,940 KB |
| testcase_57 | AC | 2 ms
6,940 KB |
| testcase_58 | AC | 3 ms
6,940 KB |
| testcase_59 | AC | 2 ms
6,940 KB |
| testcase_60 | AC | 5 ms
6,944 KB |
| testcase_61 | AC | 5 ms
6,944 KB |
| testcase_62 | AC | 2 ms
6,940 KB |
| testcase_63 | AC | 2 ms
6,940 KB |
| testcase_64 | AC | 2 ms
6,940 KB |
ソースコード
/*
### #
############# #
#######################
################################
#########################################
##############################################
# ##################################### #
###### ############################ ######
########### ################### # ##########
################ ######### ###############
#################### # ####################
####### ############## ########################
######## ######### ########################
########### ####### ########################
############## # ####### ########################
######################## ########################
######################## ########################
######################## ########################
###################### #######################
################### ###################
############## ###############
########## ##########
###### ######
## ##
# #
# # #
# # # # # # #### #### #### #### ####
# # # # # ## # # # # # # #____# ##
# #/ # # ## # # # # # # # #^^^^ #
## ###/# # # # #### #### ###/# #### #
#
##
*/
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;
namespace {
using Integer = long long; //__int128;
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}
template<class H> void print(const H& head){ cout << head; }
template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }
template<class H> void eprint(const H& head){ cerr << head; }
template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }
class range{
long long start_, end_, step_;
public:
struct range_iterator{
long long val, step_;
range_iterator(long long v, long long step) : val(v), step_(step) {}
long long operator * (){return val;}
void operator ++ (){val += step_;}
bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
};
range(long long len) : start_(0), end_(len), step_(1) {}
range(long long start, long long end) : start_(start), end_(end), step_(1) {}
range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
range_iterator begin(){ return range_iterator(start_, step_); }
range_iterator end(){ return range_iterator( end_, step_); }
};
string operator "" _s (const char* str, size_t size){ return move(string(str)); }
constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }
inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed
mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());
template<class T> string join(const vector<T>& v, const string& sep){
stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
}
string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;
typedef struct{
int to;
int cap;
int rev;
}edge;
// node v : distance from s => level[v]
void bfs(vector<vector<edge> > &G, vector<int> &level, int s){
fill(level.begin(), level.end(), -1);
queue<int> q;
q.push(s);
level[s] = 0;
while(!q.empty()){
int e=q.front(); q.pop();
for(int i=0; i<G[e].size(); i++){
if(G[e][i].cap > 0 && level[G[e][i].to] < 0){
level[G[e][i].to] = level[e] + 1;
q.push(G[e][i].to);
}
}
}
}
int dfs(vector<vector<edge> > &G, vector<int> &level, vector<bool> &used, vector<int> &iter, int s, int f, int t){
if(s==t) return f;
else{
//iter[e] : done searching from v[0] to v[ iter[e]-1 ]
for(int &i=iter[s]; i<G[s].size(); i++){
//distance from s to v[e][i].to must be longer than dist from s to v
if(G[s][i].cap > 0 && level[s] < level[ G[s][i].to ]){
int d = dfs(G, level, used, iter, G[s][i].to, min(f, G[s][i].cap), t);
if(d>0){
G[s][i].cap -= d;
G[ G[s][i].to ][ G[s][i].rev ].cap += d;
return d;
}
}
}
return 0;
}
}
int dinic_maxflow(vector<vector<edge> > &G, int s, int t){
const int INF = 100000000;
int flow=0;
while(true){
vector<int> level(G.size(), -1);
vector<int> iter(G.size(), 0);
vector<bool> used(G.size(), false);
bfs(G, level, s);
if(level[t] < 0) return flow; //unable to achieve to t
while(true){
int f = dfs(G, level, used, iter, s, INF, t);
if(f==0) break;
else flow += f;
}
}
}
void add_edge(vector<vector<edge> > &G, 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});
}
int dx[] = {0, 0, 1,-1, 1, 1,-1,-1};
int dy[] = {1,-1, 0, 0, 1,-1, 1,-1};
int main(){
int h,w;
cin >> h,w;
vector<string> s(h);
cin >> s;
vector<vector<edge>> G(h*w + 2);
int source = h*w;
int sink = h*w + 1;
int cnt_b = 0, cnt_w = 0;
for(auto y : range(h) ){
for(auto x : range(w) ){
if(s[y][x] == '.') continue;
if(s[y][x] == 'b'){
cnt_b++;
add_edge(G, y*w + x, sink, 1);
}else{
cnt_w++;
add_edge(G, source, y*w + x, 1);
for(int k__=0; k__<4; k__++){
int new_x = x + dx[k__];
int new_y = y + dy[k__];
if(new_x < 0 || new_x >= w || new_y < 0 || new_y >= h) continue;
if(s[new_y][new_x] == '.') continue;
add_edge(G, y*w + x, new_y*w + new_x, 1);
}
}
}
}
int f = dinic_maxflow(G, source, sink);
int ans = f*100;
cnt_b -= f;
cnt_w -= f;
ans += min(cnt_b, cnt_w) * 10;
ans += max(cnt_b, cnt_w) - min(cnt_b, cnt_w);
println(ans);
return 0;
}