线性基的本质:装备购买
题意:给出n个m维的向量,如果一个向量可以通过若干其他向量来表示,则这个向量不用购买,给每个向量一个cost,求最小费用,使得每个向量都可以通过选择购买的向量表示,经典问题,可从线性基模板联想,只不过是把数的01异或变成了向量减法,按cost大小插入线性基中。
const int N = 505;
int n, m;
template<class T>
struct Vector {
T a[N];//向量的维度
void init() { for (int i = 0;i < m;i++)a[i] = 0; }
Vector operator+(const Vector b)const {
Vector<T> c;c.init();for (int i = 0;i <m;i++)
c.a[i] = a[i] + b.a[i];return c;
}
Vector operator-(const Vector b)const {
Vector<T> c;c.init();for (int i = 0;i < m;i++)
c.a[i] = a[i] - b.a[i];return c;
}
Vector operator*(T x)const {
Vector<T> c;c.init();for (int i = 0;i <m;i++)
c.a[i] = a[i] * x;return c;
}
};
struct l_b
{
Vector<ld> b[N];
void inti() { f(i, 0, N - 1)b[i].init(); }
bool insert(Vector<ld> c)
{
ff(i, m - 1, 0)
{
if (abs(c.a[i]) < eps)continue;
if (abs(b[i].a[i]) < eps)
{
b[i] = c;
return true;
}
else
{
ld k = c.a[i] / b[i].a[i];
c = c-b[i] * k;
}
}
return false;
}
}base;
struct node
{
Vector<ld> v;
int cost;
bool operator<(const node b)const
{
return this->cost < b.cost;
}
}e[N];
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
while (cin >> n >> m)
{
f(i, 0, n - 1)e[i].v.init();
f(i, 0, n - 1)
f(j, 0, m - 1)
{
cin >> e[i].v.a[j];
}
f(i, 0, n-1)scanf("%d", &e[i].cost);
sort(e , e + n);
int ans = 0, cost = 0;
base.inti();
f(i, 0, n-1)
{
if (base.insert(e[i].v))ans++, cost += e[i].cost;
}
cout << ans << " " << cost << endl;
}
return 0;
}