algorithm.cpp

#include <limits>
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/cycle_canceling.hpp>
#include <boost/graph/push_relabel_max_flow.hpp>
#include <boost/graph/successive_shortest_path_nonnegative_weights.hpp>
#include <boost/graph/find_flow_cost.hpp>

typedef boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS> traits;
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property,
    boost::property<boost::edge_capacity_t, long,
        boost::property<boost::edge_residual_capacity_t, long,
            boost::property<boost::edge_reverse_t, traits::edge_descriptor,
                boost::property <boost::edge_weight_t, long> > > > > graph; // new! weightmap corresponds to costs

typedef boost::graph_traits<graph>::edge_descriptor             edge_desc;
typedef boost::graph_traits<graph>::out_edge_iterator           out_edge_it; // Iterator

class edge_adder {
	graph &G;

	public:
	explicit edge_adder(graph &G) : G(G) {}
	void add_edge(int from, int to, long capacity, long cost) {
		auto c_map = boost::get(boost::edge_capacity, G);
		auto r_map = boost::get(boost::edge_reverse, G);
		auto w_map = boost::get(boost::edge_weight, G);
		const edge_desc e = boost::add_edge(from, to, G).first;
		const edge_desc rev_e = boost::add_edge(to, from, G).first;
		c_map[e] = capacity;
		c_map[rev_e] = 0;
		r_map[e] = rev_e;
		r_map[rev_e] = e;
		w_map[e] = cost;
		w_map[rev_e] = -cost;
	}
};

void testcase() {
	int n, m, s; std::cin >> n >> m >> s;
	int lands = n, states = lands + m, src = states + s, dst = src + 1;
	graph g(dst + 1);
	edge_adder adder(g);
	auto c_map = boost::get(boost::edge_capacity, g);
    auto rc_map = boost::get(boost::edge_residual_capacity, g);

	for (int i = 0; i < s; i++) {
		int l; std::cin >> l;
		adder.add_edge(states + i, dst, l, 0);
	}

	for (int i = 0; i < m; i++) {
		int j; std::cin >> j;
		adder.add_edge(lands + i, states + j - 1, 1, 0);
	}

	for (int i = 0; i < n; i++) {
		adder.add_edge(src, i, 1, 0);
		for (int j = 0; j < m; j++) {
			int b; std::cin >> b;
			adder.add_edge(i, lands + j, 1, 100 - b);
		}
	}

	boost::successive_shortest_path_nonnegative_weights(g, src, dst);
	int cost = boost::find_flow_cost(g);

	int sold = 0;
	out_edge_it e, eend;
	for(boost::tie(e, eend) = boost::out_edges(boost::vertex(dst, g), g); e != eend; ++e)
		sold += rc_map[*e] - c_map[*e];  

	int revenue = 100 * sold - cost;
	std::cout << sold << " " << revenue << std::endl;
}

int main() {
	std::ios_base::sync_with_stdio(false);

	int t;
	std::cin >> t;
	for (int i = 0; i < t; ++i)
		testcase();
}