test/aoj0396.test.cpp

• View this file on GitHub
• Last update: 2021-06-21 15:24:20+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0396

Depends on

• flow/dinic.cpp

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0396"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

#include "../flow/dinic.cpp"
int main() {
    int w, h;
    cin >> w >> h;
    vector<int> a(h), b(w);
    int S = 0, T = 0;
    for (auto &&i : b) scanf("%d", &i), T += i;
    for (auto &&i : a) scanf("%d", &i), S += i;
    if(S != T) {
        puts("0");
        return 0;
    }
    Dinic<int, true> G(h+w+2);
    for (int i = 0; i < h; ++i) {
        G.add_edge(0, i+1, a[i]);
    }
    for (int i = 0; i < w; ++i) {
        G.add_edge(h+i+1, h+w+1, b[i]);
    }
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            G.add_edge(i+1, h+j+1, 1);
        }
    }
    if(S != G.flow(0, h+w+1)) puts("0");
    else puts("1");
    return 0;
}

#line 1 "test/aoj0396.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0396"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

#line 1 "flow/dinic.cpp"
template<class T, bool directed>
class Dinic {
    void bfs(int s){
        fill(level.begin(),level.end(), -1);
        queue<int> Q;
        level[s] = 0;
        Q.emplace(s);
        while(!Q.empty()){
            int v = Q.front(); Q.pop();
            for (auto &&e : G[v]){
                if(e.cap > 0 && level[e.to] < 0){
                    level[e.to] = level[v] + 1;
                    Q.emplace(e.to);
                }
            }
        }
    }
 
    T dfs(int v, int t, T f){
        if(v == t) return f;
        for(int &i = iter[v]; i < G[v].size(); i++){
            edge &e = G[v][i];
            if(e.cap > 0 && level[v] < level[e.to]){
                T d = dfs(e.to, t, min(f,  e.cap));
                if(d == 0) continue;
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
        return 0;
    }
public:
    struct edge {
        int to{}; T cap; int rev{};
        edge() = default;
        edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}
    };
 
    vector<vector<edge>> G;
    vector<int> level, iter;
    Dinic() = default;
    explicit Dinic(int n) : G(n), level(n), iter(n) {}
 
    void add_edge(int from, int to, T cap){
        G[from].emplace_back(to, cap, G[to].size());
        G[to].emplace_back(from, directed ? 0 : cap,  G[from].size()-1);
    }
 
 
    T flow(int s, int t, T lim = INF<T>){
        T ret = 0;
        while(true) {
            bfs(s);
            if(level[t] < 0 || lim == 0) break;
            fill(iter.begin(),iter.end(), 0);
            while(true){
                T f = dfs(s, t, lim);
                if(f == 0) break;
                ret += f;
                lim -= f;
            }
        }
        return ret;
    }
};
#line 21 "test/aoj0396.test.cpp"
int main() {
    int w, h;
    cin >> w >> h;
    vector<int> a(h), b(w);
    int S = 0, T = 0;
    for (auto &&i : b) scanf("%d", &i), T += i;
    for (auto &&i : a) scanf("%d", &i), S += i;
    if(S != T) {
        puts("0");
        return 0;
    }
    Dinic<int, true> G(h+w+2);
    for (int i = 0; i < h; ++i) {
        G.add_edge(0, i+1, a[i]);
    }
    for (int i = 0; i < w; ++i) {
        G.add_edge(h+i+1, h+w+1, b[i]);
    }
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            G.add_edge(i+1, h+j+1, 1);
        }
    }
    if(S != G.flow(0, h+w+1)) puts("0");
    else puts("1");
    return 0;
}

Back to top page