// LLP driver for the least mincut satisfying a lattice-linear side
// predicate.  The hooks Bcheck, forbiddenForB, and nextMincut are
// problem-specific; the driver here is illustrative only.

#include <iostream>
#include <vector>

bool Bcheck(const std::vector<bool>& /*C*/) { return true; }
bool forbiddenForB(int /*j*/, const std::vector<bool>& /*C*/) { return false; }
std::vector<bool> nextMincut(const std::vector<bool>& C) { return C; }

std::vector<bool> llpMincut(std::vector<bool> C) {
    int n = (int)C.size();
    bool done = false;
    while (!done) {
        bool changed = true;
        while (changed) {
            changed = false;
            for (int j = 0; j < n; ++j) {
                if (forbiddenForB(j, C)) {
                    if (C[j]) return {};
                    C[j] = true;
                    changed = true;
                }
            }
        }
        if (Bcheck(C)) { done = true; }
        else {
            auto next = nextMincut(C);
            if (next.empty()) return {};
            C = next;
        }
    }
    return C;
}

int main() {
    std::vector<bool> C(4, false);
    auto out = llpMincut(C);
    std::cout << "C:";
    for (bool b : out) std::cout << ' ' << (b ? 1 : 0);
    std::cout << '\n';
    return 0;
}