結果

問題 No.421 しろくろチョコレート
ユーザー daleksprinterdaleksprinter
提出日時 2019-04-04 06:45:03
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,459 bytes
コンパイル時間 1,562 ms
コンパイル使用メモリ 172,728 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-06 18:37:15
合計ジャッジ時間 3,496 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 2 ms
5,376 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 1 ms
5,376 KB
testcase_15 AC 1 ms
5,376 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 4 ms
5,376 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 1 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 WA -
testcase_28 AC 3 ms
5,376 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 5 ms
5,376 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 15 ms
5,376 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 AC 4 ms
5,376 KB
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 AC 14 ms
5,376 KB
testcase_61 WA -
testcase_62 AC 2 ms
5,376 KB
testcase_63 WA -
testcase_64 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define isin(a, b, c) (b <= a && a <= c)
#define println cout << "\n";
#define sz(v) (int)v.size()
#define bin(x) static_cast<bitset<16> >(x)


/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tuple<int, int, int> ti;
typedef map<int, int> mi;
typedef set<int> si;


/* constant */
const int inf = 1LL << 62;
const int mod = 1e9 + 7;
const int dx[8]={1,0,-1,0,-1,1,-1,1};
const int dy[8]={0,1,0,-1,-1,-1,1,1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";

/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}
template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}


/* math_method */
int ceil(int a, int b){return a / b + (a % b > 0);}


/* main */

int n, m;
char field[50][50];
int source, sink;
int black = 0, white = 0;
struct edge{int to, cap, rev;};
vec<vec<edge>> edges(2550);
int pos_to_v(int y, int x){
    return y * m + x;
}
void in(){
    cin >> n >> m;
    rep(i,0,n){
        rep(j,0,m){
            cin >> field[i][j];
        }
    }
    source = n * m + 10;
    sink = source + 1;

    rep(i,0,n){
        rep(j,0,m){
            if(field[i][j] == '.') continue;

            int f = pos_to_v(i, j);

            // black to sink
            if(field[i][j] == 'b'){
                black++;
                edges[f].push_back((edge){sink, 1, sz(edges[sink])});
                edges[sink].push_back((edge){f, 0, sz(edges[f]) - 1});
                continue;
            }
            white++;
            //source to white    
            edges[source].push_back((edge){f, 1, sz(edges[f])});
            edges[f].push_back((edge){source, 0, sz(edges[source]) - 1});

            //white to black
            rep(k,0,4){
                int ty = i + dy[k];
                int tx = j + dx[k];
                if(!isin(ty,0,n-1) or !isin(tx,0,m-1) or field[ty][tx] == '.') continue;
                int t = pos_to_v(ty, tx);
                edges[f].push_back((edge){t, 1, sz(edges[t])});
                edges[t].push_back((edge){f, 0, sz(edges[f]) - 1});
            }
        }
    }
}
bool visited[2550];
int dfs(int v, int t, int f){

    if(v == t) return f;
    visited[v] = true;

    rep(i,0,sz(edges[v])){
        edge e = edges[v][i];
        if(!visited[e.to] && e.cap > 0){
            int d = dfs(e.to, t, min(f, e.cap));
            if(d > 0){
                edges[v][i].cap -= d;
                edges[e.to][e.rev].cap += d;
                return d;
            }
        }
    }

    return 0;
}


void solve(){

    int flow = 0;
    while(true){
        memset(visited, false, sizeof(visited));
        int f = dfs(source, sink, inf);
        if(f) flow += f;
        else break;
    }

    int ans = flow * 100;
    ans += (min(white, black) - flow) * 10;
    ans += (white + black) % 2 == 1;

    print(ans);



}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    in();
    solve();
    
}
0