結果

問題 No.1123 Afforestation
ユーザー satashunsatashun
提出日時 2020-07-22 23:29:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,041 bytes
コンパイル時間 2,981 ms
コンパイル使用メモリ 244,512 KB
実行使用メモリ 7,424 KB
最終ジャッジ日時 2024-06-23 01:23:14
合計ジャッジ時間 24,686 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 6 ms
5,376 KB
testcase_05 AC 48 ms
5,376 KB
testcase_06 AC 224 ms
7,296 KB
testcase_07 WA -
testcase_08 AC 2 ms
5,376 KB
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 AC 3 ms
5,376 KB
testcase_15 WA -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 AC 231 ms
7,424 KB
testcase_25 AC 225 ms
7,424 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 3 ms
5,376 KB
testcase_29 AC 3 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 WA -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 WA -
testcase_49 WA -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 RE -
testcase_71 RE -
testcase_72 WA -
testcase_73 AC 2 ms
5,376 KB
testcase_74 AC 2 ms
5,376 KB
testcase_75 AC 2 ms
5,376 KB
testcase_76 AC 2 ms
5,376 KB
testcase_77 AC 2 ms
5,376 KB
testcase_78 AC 2 ms
5,376 KB
testcase_79 AC 1 ms
5,376 KB
testcase_80 AC 2 ms
5,376 KB
testcase_81 AC 1 ms
5,376 KB
testcase_82 AC 1 ms
5,376 KB
testcase_83 WA -
testcase_84 AC 301 ms
7,296 KB
testcase_85 RE -
testcase_86 AC 2 ms
5,376 KB
testcase_87 AC 2 ms
5,376 KB
testcase_88 AC 9 ms
7,296 KB
testcase_89 RE -
testcase_90 AC 2 ms
5,376 KB
testcase_91 AC 2 ms
5,376 KB
testcase_92 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

// O(V^2 E)
struct Dinic {
    using F = ll;
    static constexpr F INF = numeric_limits<F>::max();

    struct Edge {
        int to, rev;
        F cap, gen;
        Edge(int to, F cap, int rev) : to(to), cap(cap), gen(cap), rev(rev){};
    };

    using E = Edge;

    VV<E> g;
    V<int> level, iter;

    Dinic() {}
    Dinic(int n) : g(n), level(n), iter(n) {}

    void add_edge(int from, int to, F cap) {
        g[from].emplace_back(to, cap, (int)g[to].size());
        g[to].emplace_back(from, 0, (int)g[from].size() - 1);
    }

    void bfs(int s) {
        fill(ALL(level), -1);
        queue<int> que;
        level[s] = 0;
        que.push(s);

        while (!que.empty()) {
            int v = que.front();
            que.pop();
            for (auto& e : g[v]) {
                if (e.cap > 0 && level[e.to] < 0) {
                    level[e.to] = level[v] + 1;
                    que.push(e.to);
                }
            }
        }
    }

    F dfs(int v, int t, F f) {
        if (v == t) return f;
        for (int& i = iter[v]; i < g[v].size(); i++) {
            auto& e = g[v][i];
            if (e.cap > 0 && level[v] < level[e.to]) {
                F 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;
    }

    F max_flow(int s, int t) {
        F flow = 0;
        while (true) {
            bfs(s);
            if (level[t] < 0) return flow;
            fill(ALL(iter), 0);
            F f;
            while ((f = dfs(s, t, INF)) > 0) flow += f;
        }
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int H, W;
    cin >> H >> W;
    V<ll> A(H), B(W);
    rep(i, H) cin >> A[i];
    rep(i, W) cin >> B[i];
    int K;
    cin >> K;

    V<int> xs, ys;
    V<pii> ng;
    set<pii> ngs;
    rep(i, K) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        ng.eb(x, y);
        ngs.insert(mp(x, y));
        xs.pb(x), ys.pb(y);
    }

    ll s1 = 0, s2 = 0;
    rep(i, H) s1 += A[i];
    rep(i, W) s2 += B[i];
    if (s1 != s2) {
        cout << ":(" << endl;
        return 0;
    }

    sort(ALL(xs));
    xs.erase(unique(ALL(xs)), xs.end());
    sort(ALL(ys));
    ys.erase(unique(ALL(ys)), ys.end());

    V<int> hid(H, -1), wid(W, -1);
    rep(i, xs.size()) hid[xs[i]] = i;
    rep(i, ys.size()) wid[ys[i]] = i;

    int node_cnt = xs.size() + ys.size() + 4;
    int s = node_cnt - 2, t = node_cnt - 1;

    ll rema = 0, remb = 0;
    rep(i, H) if (hid[i] == -1) rema += A[i];
    rep(i, W) if (wid[i] == -1) remb += B[i];
    debug(xs, ys, rema, remb);

    Dinic flow(node_cnt);
    flow.add_edge(xs.size(), xs.size() + ys.size() + 1,
                  (H - xs.size()) * (W - ys.size()));
    flow.add_edge(s, xs.size(), rema);
    flow.add_edge(xs.size() + ys.size() + 1, t, remb);

    rep(i, xs.size()) {
        int x = xs[i];
        debug(i, x);
        flow.add_edge(s, i, A[x]);
        int rem = W;
        rep(j, ys.size()) {
            pii pt(xs[i], ys[j]);
            if (!ngs.count(pt)) {
                flow.add_edge(x, xs.size() + 1 + j, 1);
            } else {
                rem--;
            }
        }
        if (rem) {
            flow.add_edge(i, xs.size() + ys.size() + 1, rem);
        }
    }
    rep(j, ys.size()) {
        int y = ys[j];
        debug(j, y);
        flow.add_edge(xs.size() + 1 + j, t, B[y]);
        int rem = H;
        rep(i, xs.size()) {
            pii pt(xs[i], ys[j]);
            if (ngs.count(pt)) rem--;
        }
        if (rem) {
            flow.add_edge(xs.size(), xs.size() + 1 + j, rem);
        }
    }

    auto fl = flow.max_flow(s, t);

    VV<int> cands(node_cnt);

    rep(i, H) {
        if (hid[i] == -1)
            cands[xs.size()].pb(i);
        else
            cands[hid[i]].pb(i);
    }
    rep(j, W) {
        if (wid[j] == -1)
            cands[xs.size() + ys.size() + 1].pb(j);
        else
            cands[xs.size() + 1 + wid[j]].pb(j);
    }
    /*
        rep(i, H) {
            rep(j, W) {
                int a = (hid[i] == -1 ? xs.size() : hid[i]);
                int b = (wid[j] == -1 ? xs.size() + 1 + ys.size()
                                      : xs.size() + 1 + wid[j]);
                cands[a][b].eb(i, j);
            }
        }*/
    debug(fl, s1);

    if (fl != s1) {
        cout << ":(" << endl;
        return 0;
    }
    cout << "Yay!" << endl;

    V<string> ans(H, string(W, '.'));
    for (auto p : ngs) {
        ans[p.fi][p.se] = 'x';
    }

    rep(i, xs.size() + 1) {
        V<pii> es;
        for (auto e : flow.g[i]) {
            if (e.to >= xs.size() + 1 && e.to <= xs.size() + ys.size() + 1) {
                int cnt = e.gen - e.cap;
                es.eb(e.to, cnt);
            }
        }
        sort(ALL(es));
        for (auto e : es) {
            int to = e.fi, cnt = e.se;
            debug(cnt);

            if (i != xs.size()) {
                priority_queue<pii> yque;
                for (int y : cands[to]) {
                    yque.push(mp(B[y], y));
                }

                debug(cands[i], cands[to]);

                for (int x : cands[i]) {
                    V<pii> nx;
                    while (A[x] > 0 && cnt > 0) {
                        cnt--;
                        A[x]--;
                        pii py = yque.top();
                        yque.pop();
                        py.fi--;
                        B[py.se]--;
                        nx.eb(py);
                        ans[x][py.se] = 'o';
                    }
                    for (auto p : nx) yque.push(p);
                }
            } else {
                priority_queue<pii> xque;
                for (int x : cands[i]) {
                    xque.push(mp(A[x], x));
                }

                debug(cands[i], cands[to]);

                for (int y : cands[to]) {
                    V<pii> nx;
                    while (B[y] > 0 && cnt > 0) {
                        cnt--;
                        B[y]--;
                        pii px = xque.top();
                        xque.pop();
                        px.fi--;
                        A[px.se]--;
                        nx.eb(px);
                        ans[px.se][y] = 'o';
                    }
                    for (auto p : nx) xque.push(p);
                }
            }
        }
    }

    rep(i, H) cout << ans[i] << '\n';

    return 0;
}
0