test/yuki957_project_selection_problem.test.cpp

• View this file on GitHub
• Last update: 2026-03-22 13:47:31+09:00
• Problem: https://yukicoder.me/problems/no/957

Depends on

• Dinic法(Dinic) (flow/dinic.cpp)
• Project Selection Problem (flow/project_selection_problem.cpp)
• 高速入出力(Fast IO) (util/fastio.cpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/957"

#include <algorithm>
#include <limits>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;

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

#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>

#include "../util/fastio.cpp"
#include "../flow/project_selection_problem.cpp"

int main() {
    Scanner in;
    Printer out;

    int h, w;
    in.read(h, w);

    vector<vector<ll>> g(h, vector<ll>(w));
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            in.read(g[i][j]);
        }
    }
    vector<ll> row(h), col(w);
    for (int i = 0; i < h; ++i) in.read(row[i]);
    for (int j = 0; j < w; ++j) in.read(col[j]);

    ProjectSelectionProblem<ll> psp(h + w);
    for (int i = 0; i < h; ++i) {
        ll sum = 0;
        for (int j = 0; j < w; ++j) {
            sum += g[i][j];
            psp.add_penalty(h + j, i, g[i][j]);
        }
        psp.add_true_profit(i, row[i] - sum);
    }
    for (int j = 0; j < w; ++j) {
        psp.add_true_profit(h + j, col[j]);
    }

    out.println(psp.solve());
    return 0;
}

#line 1 "test/yuki957_project_selection_problem.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/957"

#include <algorithm>
#include <limits>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;

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

#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>

#line 1 "util/fastio.cpp"
using namespace std;

extern "C" int fileno(FILE *);
extern "C" int isatty(int);

template<class T, class = void>
struct is_fastio_range : false_type {};

template<class T>
struct is_fastio_range<T, void_t<decltype(declval<T &>().begin()), decltype(declval<T &>().end())>> : true_type {};

template<class T, class = void>
struct has_fastio_value : false_type {};

template<class T>
struct has_fastio_value<T, void_t<decltype(declval<const T &>().value())>> : true_type {};

struct FastIoDigitTable {
    char num[40000];

    constexpr FastIoDigitTable() : num() {
        for (int i = 0; i < 10000; ++i) {
            int x = i;
            for (int j = 3; j >= 0; --j) {
                num[i * 4 + j] = char('0' + x % 10);
                x /= 10;
            }
        }
    }
};

struct Scanner {
    static constexpr int BUFSIZE = 1 << 17;
    static constexpr int OFFSET = 64;
    char buf[BUFSIZE + 1];
    int idx, size;
    bool interactive;

    Scanner() : idx(0), size(0), interactive(isatty(fileno(stdin))) {}

    inline void load() {
        int len = size - idx;
        memmove(buf, buf + idx, len);
        if (interactive) {
            if (fgets(buf + len, BUFSIZE + 1 - len, stdin)) size = len + (int)strlen(buf + len);
            else size = len;
        } else {
            size = len + (int)fread(buf + len, 1, BUFSIZE - len, stdin);
        }
        idx = 0;
        buf[size] = 0;
    }

    inline void ensure() {
        if (idx + OFFSET > size) load();
    }

    inline void ensure_interactive() {
        if (idx == size) load();
    }

    inline char skip() {
        if (interactive) {
            ensure_interactive();
            while (buf[idx] && buf[idx] <= ' ') {
                ++idx;
                ensure_interactive();
            }
            return buf[idx++];
        }
        ensure();
        while (buf[idx] && buf[idx] <= ' ') {
            ++idx;
            ensure();
        }
        return buf[idx++];
    }

    template<class T, typename enable_if<is_integral<T>::value, int>::type = 0>
    void read(T &x) {
        if (interactive) {
            char c = skip();
            bool neg = false;
            if constexpr (is_signed<T>::value) {
                if (c == '-') {
                    neg = true;
                    ensure_interactive();
                    c = buf[idx++];
                }
            }
            x = 0;
            while (c >= '0') {
                x = x * 10 + (c & 15);
                ensure_interactive();
                c = buf[idx++];
            }
            if constexpr (is_signed<T>::value) {
                if (neg) x = -x;
            }
            return;
        }
        char c = skip();
        bool neg = false;
        if constexpr (is_signed<T>::value) {
            if (c == '-') {
                neg = true;
                c = buf[idx++];
            }
        }
        x = 0;
        while (c >= '0') {
            x = x * 10 + (c & 15);
            c = buf[idx++];
        }
        if constexpr (is_signed<T>::value) {
            if (neg) x = -x;
        }
    }

    template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
    void read(T &x) {
        long long v;
        read(v);
        x = T(v);
    }

    template<class Head, class Next, class... Tail>
    void read(Head &head, Next &next, Tail &...tail) {
        read(head);
        read(next, tail...);
    }

    template<class T, class U>
    void read(pair<T, U> &p) {
        read(p.first, p.second);
    }

    template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
    void read(T &a) {
        for (auto &x : a) read(x);
    }

    void read(char &c) {
        c = skip();
    }

    void read(string &s) {
        s.clear();
        if (interactive) {
            ensure_interactive();
            while (buf[idx] && buf[idx] <= ' ') {
                ++idx;
                ensure_interactive();
            }
            while (true) {
                int start = idx;
                while (idx < size && buf[idx] > ' ') ++idx;
                s.append(buf + start, idx - start);
                if (idx < size) break;
                load();
                if (size == 0) break;
            }
            if (idx < size) ++idx;
            return;
        }
        ensure();
        while (buf[idx] && buf[idx] <= ' ') {
            ++idx;
            ensure();
        }
        while (true) {
            int start = idx;
            while (idx < size && buf[idx] > ' ') ++idx;
            s.append(buf + start, idx - start);
            if (idx < size) break;
            load();
        }
        if (idx < size) ++idx;
    }
};

struct Printer {
    static constexpr int BUFSIZE = 1 << 17;
    static constexpr int OFFSET = 64;
    char buf[BUFSIZE];
    int idx;
    bool interactive;
    inline static constexpr FastIoDigitTable table{};

    Printer() : idx(0), interactive(isatty(fileno(stdout))) {}
    ~Printer() { flush(); }

    inline void flush() {
        if (idx) {
            fwrite(buf, 1, idx, stdout);
            idx = 0;
        }
    }

    inline void pc(char c) {
        if (idx > BUFSIZE - OFFSET) flush();
        buf[idx++] = c;
        if (interactive && c == '\n') flush();
    }

    inline void print_range(const char *s, size_t n) {
        size_t pos = 0;
        while (pos < n) {
            if (idx == BUFSIZE) flush();
            size_t chunk = min(n - pos, (size_t)(BUFSIZE - idx));
            memcpy(buf + idx, s + pos, chunk);
            idx += (int)chunk;
            pos += chunk;
        }
    }

    void print(const char *s) {
        print_range(s, strlen(s));
    }

    void print(const string &s) {
        print_range(s.data(), s.size());
    }

    void print(char c) {
        pc(c);
    }

    void print(bool b) {
        pc(char('0' + (b ? 1 : 0)));
    }

    template<class T, typename enable_if<is_integral<T>::value && !is_same<T, bool>::value, int>::type = 0>
    void print(T x) {
        if (idx > BUFSIZE - 100) flush();
        using U = typename make_unsigned<T>::type;
        U y;
        if constexpr (is_signed<T>::value) {
            if (x < 0) {
                buf[idx++] = '-';
                y = U(0) - static_cast<U>(x);
            } else {
                y = static_cast<U>(x);
            }
        } else {
            y = x;
        }
        if (y == 0) {
            buf[idx++] = '0';
            return;
        }
        static constexpr int TMP_SIZE = sizeof(U) * 10 / 4;
        char tmp[TMP_SIZE];
        int pos = TMP_SIZE;
        while (y >= 10000) {
            pos -= 4;
            memcpy(tmp + pos, table.num + (y % 10000) * 4, 4);
            y /= 10000;
        }
        if (y >= 1000) {
            memcpy(buf + idx, table.num + (y << 2), 4);
            idx += 4;
        } else if (y >= 100) {
            memcpy(buf + idx, table.num + (y << 2) + 1, 3);
            idx += 3;
        } else if (y >= 10) {
            unsigned q = (unsigned(y) * 205) >> 11;
            buf[idx] = char('0' + q);
            buf[idx + 1] = char('0' + (unsigned(y) - q * 10));
            idx += 2;
        } else {
            buf[idx++] = char('0' + y);
        }
        memcpy(buf + idx, tmp + pos, TMP_SIZE - pos);
        idx += TMP_SIZE - pos;
    }

    template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
    void print(const T &x) {
        print(x.value());
    }

    template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
    void print(const T &a) {
        bool first = true;
        for (auto &&x : a) {
            if (!first) pc(' ');
            first = false;
            print(x);
        }
    }

    template<class T>
    void println(const T &x) {
        print(x);
        pc('\n');
    }

    template<class Head, class... Tail>
    void println(const Head &head, const Tail &...tail) {
        print(head);
        ((pc(' '), print(tail)), ...);
        pc('\n');
    }

    void println() {
        pc('\n');
    }
};

template<class T>
Scanner &operator>>(Scanner &in, T &x) {
    in.read(x);
    return in;
}

template<class T>
Printer &operator<<(Printer &out, const T &x) {
    out.print(x);
    return out;
}

/**
 * @brief 高速入出力(Fast IO)
 */
#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;
    }
};

/**
 * @brief Dinic法(Dinic)
 */
#line 2 "flow/project_selection_problem.cpp"

template<class T>
class ProjectSelectionProblem {
    int n;
    T base_score{};
    vector<T> weight;
    vector<tuple<int, int, T>> penalty;
    vector<int> selected;

public:
    ProjectSelectionProblem() : n(0) {}
    explicit ProjectSelectionProblem(int n) : n(n), base_score(0), weight(n, 0), selected(n, 0) {}

    int add_vertex() {
        weight.emplace_back(0);
        selected.emplace_back(0);
        return n++;
    }

    int size() const {
        return n;
    }

    void add_true_profit(int v, T x) {
        weight[v] += x;
    }

    void add_false_profit(int v, T x) {
        base_score += x;
        weight[v] -= x;
    }

    void add_penalty(int x, int y, T cost) {
        penalty.emplace_back(x, y, cost);
    }

    void add_if_then(int x, int y) {
        add_penalty(x, y, INF<T>);
    }

    void force_true(int v) {
        add_true_profit(v, INF<T>);
    }

    void force_false(int v) {
        add_false_profit(v, INF<T>);
    }

    T solve() {
        int s = n, t = n + 1;
        Dinic<T, true> mf(n + 2);
        T offset = base_score;
        for (int v = 0; v < n; ++v) {
            if (weight[v] >= 0) {
                offset += weight[v];
                mf.add_edge(s, v, weight[v]);
            } else {
                mf.add_edge(v, t, -weight[v]);
            }
        }
        for (auto&& [x, y, cost] : penalty) {
            mf.add_edge(x, y, cost);
        }
        T cut = mf.flow(s, t);

        fill(selected.begin(), selected.end(), 0);
        queue<int> q;
        q.emplace(s);
        vector<int> vis(n + 2, 0);
        vis[s] = 1;
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (auto&& e : mf.G[v]) {
                if (e.cap <= 0 || vis[e.to]) continue;
                vis[e.to] = 1;
                q.emplace(e.to);
            }
        }
        for (int v = 0; v < n; ++v) {
            selected[v] = vis[v];
        }
        return offset - cut;
    }

    const vector<int>& get_selected() const {
        return selected;
    }
};

/**
 * @brief Project Selection Problem
 */
#line 21 "test/yuki957_project_selection_problem.test.cpp"

int main() {
    Scanner in;
    Printer out;

    int h, w;
    in.read(h, w);

    vector<vector<ll>> g(h, vector<ll>(w));
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            in.read(g[i][j]);
        }
    }
    vector<ll> row(h), col(w);
    for (int i = 0; i < h; ++i) in.read(row[i]);
    for (int j = 0; j < w; ++j) in.read(col[j]);

    ProjectSelectionProblem<ll> psp(h + w);
    for (int i = 0; i < h; ++i) {
        ll sum = 0;
        for (int j = 0; j < w; ++j) {
            sum += g[i][j];
            psp.add_penalty(h + j, i, g[i][j]);
        }
        psp.add_true_profit(i, row[i] - sum);
    }
    for (int j = 0; j < w; ++j) {
        psp.add_true_profit(h + j, col[j]);
    }

    out.println(psp.solve());
    return 0;
}

Back to top page