#include // created [2019/12/05] 22:06:52 #pragma GCC diagnostic ignored "-Wsign-compare" #pragma GCC diagnostic ignored "-Wsign-conversion" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; using uint = unsigned int; using usize = std::size_t; using ll = long long; using ull = unsigned long long; using ld = long double; template constexpr T popcount(const T u) { return u ? static_cast(__builtin_popcountll(static_cast(u))) : static_cast(0); } template constexpr T log2p1(const T u) { return u ? static_cast(64 - __builtin_clzll(static_cast(u))) : static_cast(0); } template constexpr T msbp1(const T u) { return log2p1(u); } template constexpr T lsbp1(const T u) { return __builtin_ffsll(u); } template constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast(u); } template constexpr bool ispow2(const T u) { return u and (static_cast(u) & static_cast(u - 1)) == 0; } template constexpr T ceil2(const T u) { return static_cast(1) << clog(u); } template constexpr T floor2(const T u) { return u == 0 ? static_cast(0) : static_cast(1) << (log2p1(u) - 1); } template constexpr bool btest(const T mask, const usize ind) { return static_cast((static_cast(mask) >> ind) & static_cast(1)); } template void bset(T& mask, const usize ind) { mask |= (static_cast(1) << ind); } template void breset(T& mask, const usize ind) { mask &= ~(static_cast(1) << ind); } template void bflip(T& mask, const usize ind) { mask ^= (static_cast(1) << ind); } template void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); } template constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast(0) : static_cast((static_cast(mask) << (64 - ind)) >> (64 - ind)); } template bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); } template bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); } constexpr unsigned int mod = 1000000007; template constexpr T inf_v = std::numeric_limits::max() / 4; template constexpr Real pi_v = Real{3.141592653589793238462643383279502884}; template T read() { T v; return std::cin >> v, v; } template auto read(const usize size, Args... args) { std::vector(args...))> ans(size); for (usize i = 0; i < size; i++) { ans[i] = read(args...); } return ans; } template auto reads() { return std::tuple...>{read()...}; } # define SHOW(...) static_cast(0) constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; } template std::vector make_v(const usize size, const T v) { return std::vector(size, v); } template auto make_v(const usize size, Args... args) { return std::vector(size, make_v(args...)); } template class base_graph { public: using cost_type = Cost; base_graph(const usize sz) : sz{sz}, edges(sz), rev_edges(sz) {} void add_edge(const usize from, const usize to, const Cost cost, const bool bi = false) { assert(from < sz), assert(to < sz); edges[from].push_back(edge{from, to, cost}), rev_edges[to].push_back(edge(to, from, cost)); if (bi) { add_edge(to, from, cost, false); } } struct edge { edge(const usize from, const usize to, const Cost cost) : from{from}, to{to}, cost{cost} {} usize from, to; Cost cost; bool operator<(const edge& e) const { return cost != e.cost ? cost < e.cost : to < e.to; } }; std::vector& operator[](const usize i) { return assert(i < sz), edges[i]; } const std::vector& operator[](const usize i) const { return assert(i < sz), edges[i]; } const std::vector>& rev_edge() const { return rev_edges; } std::vector>& rev_edge() { return rev_edges; } friend std::ostream& operator<<(std::ostream& os, const base_graph& g) { os << "[\n"; for (usize i = 0; i < g.sz; i++) { for (const auto& e : g.edges[i]) { os << i << "->" << e.to << ":" << e.cost << "\n"; } } return (os << "]\n"); } static usize to(const edge& e) { return e.to; } usize size() const { return sz; } private: usize sz; std::vector> edges, rev_edges; }; template<> class base_graph { public: base_graph(const usize sz) : sz{sz}, edges(sz), rev_edges(sz) {} void add_edge(const usize from, const usize to, const bool bi = false) { assert(from < sz), assert(to < sz); edges[from].push_back(to), rev_edges[to].push_back(from); if (bi) { add_edge(to, from, false); } } std::vector& operator[](const usize i) { return assert(i < sz), edges[i]; } const std::vector& operator[](const usize i) const { return assert(i < sz), edges[i]; } const std::vector>& rev_edge() const { return rev_edges; } std::vector>& rev_edge() { return rev_edges; } friend std::ostream& operator<<(std::ostream& os, const base_graph& g) { os << "[\n"; for (usize i = 0; i < g.sz; i++) { for (const usize to : g.edges[i]) { os << i << "->" << to << "\n"; } } return (os << "]\n"); } static usize to(const usize e) { return e; } usize size() const { return sz; } private: usize sz; std::vector> edges, rev_edges; }; using graph = base_graph; using tree = graph; template using cost_graph = base_graph; template using cost_tree = cost_graph; int main() { const int N = read(); const auto X = read(N, N); const auto A = read(N); const int M = 1 << N; std::vector used(N, 0); int ans = inf_v; for (int m = 0; m < M; m++) { int s = 0; for (int i = 0; i < N; i++) { if (btest(m, i)) { s += A[i]; } } auto dfs = [&](auto&& self, const int s) -> bool { if (used[s] == 1) { return false; } else if (used[s] == 0) { used[s] = 1; for (int to = 0; to < N; to++) { if (X[to][s] == 0) { continue; } if (btest(m, to)) { continue; } if (not self(self, to)) { return false; } } used[s] = 2; } return true; }; bool dag = true; for (int i = 0; i < N and dag; i++) { if (not btest(m, i) and not dfs(dfs, i)) { dag = false; } } if (dag) { chmin(ans, s); } std::fill(used.begin(), used.end(), 0); } std::cout << ans << std::endl; return 0; }