HDU6767 费用流+建图

//#define LOCAL
#include 
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template
void read(T &first, Args& ... args) {read(first);read(args...);}
template
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 3e3 + 10;

int T;
int n , m ;
ll a[N] , b[N], c[N];
int head[N] , cnt;
struct node{
    int f, t, next , w;
    ll c;
}edge[1000005];

void add (int f, int t, int w, ll co)
{
    edge[cnt].f = f;
    edge[cnt].c = co;
    edge[cnt].w = w;
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int s, t;
ll dis[N], fw[N], vis[N], pre[N];
vector  price;
queue  q;
bool spfa()
{
    mem(dis,INF);
    mem(fw,INF);
    mem(vis,0);
    pre[s] = pre[t] = -1;
    q.push(s);
    vis[s] = 1;
    dis[s] = 0;
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = 0;
        for (int i = head[u] ; i != -1 ; i = edge[i].next)
        {
            int v = edge[i].t;
            ll w = edge[i].w, c = edge[i].c;
            if(edge[i].w && dis[u] + c < dis[v])
            {
                dis[v] = dis[u] + c;
                fw[v] = min(fw[u], w);
                pre[v] = i;
                if(vis[v] == 0)
                {
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }
    return pre[t] != -1;
}
void FYL()
{
    while(spfa())
    {
        price.pb(1ll * dis[t] * fw[t]);
        for (int i = pre[t] ; i != -1 ; i = pre[edge[i].f])
        {
            edge[i].w -= fw[t];
            edge[i^1].w += fw[t];
        }
    }
    return ;
}
vector  ver[N];
vector  p;
ll cal (int i , int j)
{
    return 1ll * a[i] * j * j + 1ll * b[i] * j + c[i];
}
int id (int x)
{
    return lower_bound(p.begin(), p.end(), x) - p.begin() + 1;
}
int main()
{
    read(T);
    while (T --)
    {
        mem(head,-1), cnt = 0, price.clear();
        read(n, m);
        for (int i = 1; i <= n ; i ++)
            ver[i].clear();
        p.clear();
        for (int i = 1; i <= n ; i ++)
            read (a[i] , b[i] , c[i]);
        s = 0 , t = N - 2;
        for (int i = 1; i <= n ; i ++)
        {
            add (s, i , 1, 0);
            add (i, s, 0 , 0);
            int x = -b[i] / (2 * a[i]);
            x = max (1, x);
            x = min (x, m);
            for (int j = x , tot = 0 ; j >= 1 && tot <= n; j --, tot ++) ver[i].pb(j);
            for (int j = x + 1 , tot = 0 ; j <= m && tot <= n ; j ++ , tot ++) ver[i].pb(j);
            sort (ver[i].begin() , ver[i].end() , [&](int x, int y) {
                return cal (i , x) < cal(i, y);
            });
            ver[i].erase(ver[i].begin() + n, ver[i].end());
            for (auto x : ver[i]) p.pb(x);
        }
        sort (p.begin() , p.end());
        p.erase (unique(p.begin(), p.end()), p.end());
        for (int i = 1 ; i <= p.size() ; i ++)
            add (i + n , t , 1 , 0) , add (t, i + n , 0 ,0);
        for (int i = 1 ; i <= n ; i ++)
        {
            for (auto x : ver[i])
            {
                add (i, id(x) + n, 1 , cal(i, x));
                add (id(x) + n, i , 0 , -cal(i, x));
            }
        }
        FYL();
        ll ans = 0;
        for (int i = 0 ; i < price.size() - 1; i ++) {
            ans += price[i];
            write(ans), SP;
        }
        ans += price[price.size()-1];
        write(ans);
        LF;
    }
}