結果

問題 No.459 C-VS for yukicoder
コンテスト
ユーザー miscalc
提出日時 2023-05-04 02:49:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 82 ms / 2,000 ms
コード長 5,442 bytes
コンパイル時間 4,902 ms
コンパイル使用メモリ 272,952 KB
最終ジャッジ日時 2025-02-12 16:44:56
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 58
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

// https://atcoder.jp/contests/abc285/editorial/5500
template<class Cap>
struct MaxFlowLowerLimit
{
public:
  struct edge
  {
    int from, to;
    Cap cap_l, cap_r, flow;
    edge(int from, int to, Cap cap_l, Cap cap_r, Cap flow) : from(from), to(to), cap_l(cap_l), cap_r(cap_r), flow(flow) {}
    edge() {}
  };

private:
  int N;
  vector<edge> internal_edges;
  vector<int> idxs;

public:
  mf_graph<Cap> G;
  MaxFlowLowerLimit(int n)
  {
    N = n;
    G = mf_graph<Cap>(N + 2);
  }
  void add_edge(int from, int to, Cap cap_l, Cap cap_r)
  {
    assert(from < N && to < N);
    int idx = G.add_edge(from, to, cap_r - cap_l);
    if (cap_l != 0)
    {
      G.add_edge(N, to, cap_l);
      G.add_edge(from, N + 1, cap_l);
    }
    internal_edges.emplace_back(edge(from, to, cap_l, cap_r, 0));
    idxs.emplace_back(idx);
  }
  Cap flow(int s, int t) // 存在しなければ -1
  {
    assert(s < N && t < N && s != t);
    G.flow(N, N + 1);
    G.flow(s, N + 1);
    G.flow(N, t);
    G.flow(s, t);

    auto es = G.edges();
    Cap res = 0;
    for (auto e : es)
    {
      if (e.to == N + 1 && e.flow != e.cap)
        return -1;
      if (e.from == N && e.flow != e.cap)
        return -1;
      if (e.to == t)
        res += e.flow;
    }
    return res;
  }
  bool flow_exists(int s, int t)
  {
    assert(s < N && t < N && s != t);
    G.add_edge(t, s, numeric_limits<Cap>::max());
    G.flow(N, N + 1);

    auto es = G.edges();
    for (auto e : es)
    {
      if (e.to == N + 1 && e.flow != e.cap)
        return false;
      if (e.from == N && e.flow != e.cap)
        return false;
    }
    return true;
  }
  edge get_edge(int i)
  {
    assert(0 <= i && i < (int)internal_edges.size());
    edge e = internal_edges[i];
    e.flow = e.cap_l + G.get_edge(idxs[i]).flow;
    return e;
  }
  vector<edge> edges()
  {
    vector<edge> res(internal_edges.size());
    for (int i = 0; i < (int)internal_edges.size(); i++)
      res[i] = get_edge(i);
    return res;
  }
};

int main()
{
  ll H, W, N;
  cin >> H >> W >> N;
  vector<string> S(H);
  for (ll i = 0; i < H; i++)
  {
    cin >> S.at(i);
  }
  vector<ll> C(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> C.at(i);
  }

  vector<ll> A(W, 0);
  for (ll i = 0; i < H; i++)
  {
    for (ll j = 0; j < W; j++)
    {
      if (S.at(i).at(j) == '#')
        A.at(j)++;
    }
  }

  MaxFlowLowerLimit<ll> G(1 + N + W + 1);
  for (ll i = 0; i < N; i++)
  {
    G.add_edge(0, 1 + i, 1, 9);
    for (ll j = 0; j < 3; j++)
    {
      G.add_edge(1 + i, 1 + N + C.at(i) + j, 0, 3);
    }
  }
  for (ll i = 0; i < W; i++)
  {
    G.add_edge(1 + N + i, 1 + N + W, A.at(i), A.at(i));
  }
  G.flow(0, 1 + N + W);

  vector res(N, vector(3, 0LL));
  auto es = G.edges();
  for (auto e : es)
  {
    ll i = e.from - 1, j = e.to - 1 - N;
    if (!(0 <= i && i < N) || !(0 <= j && j < W))
      continue;
    res.at(i).at(j - C.at(i)) = e.flow;
  }

  for (ll i = 0; i < N; i++)
  {
    vector<string> ans(3, string(3, '.'));
    for (ll j = 0; j < 3; j++)
    {
      for (ll k = 0; k < res.at(i).at(j); k++)
      {
        ans.at(k).at(j) = '#';
      }
    }
    printvect(ans);
  }
}
0