非常好的网络流题
刚开始想所有的点放在左边,线段放在右边,然后连连边跑个费用流什么的
一方面,好像不太好连边,另一方面,即使能连,也会TLE,因为边太多
有一种很神奇的方法
把这些点依次排开,相邻的点之间连流量无限,费用为0的边,走这条边表示这里没有区间覆盖
对于每个区间,从左端点向右端点连流量为1,费用为权值的相反数的边,走这条边表示选中了这个区间
要控制一个点不被覆盖超过k次,只要控制流量<=k即可,想一想发现是对的
然后跑一个费用流就可以了
注意刚开始有负权边,第一次跑最短路用spfa
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <utility>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <queue>
#include <deque>
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define LL long long
#define Pair pair<int,int>
#define LOWBIT(x) x & (-x)
using namespace std;
const int MOD=1e9+7;
const int INF=0x7ffffff;
const int magic=348;
priority_queue<Pair> q;
queue<int> qq;
int dist[500048],h[500048];
int prevv[500048],preve[500048];
bool inq[500048];
struct node1
{
int x,y,w;
int xx,yy;
}segment[248];
struct node
{
int x;
int from;
bool f;
}a[10048];
int top;
bool cmp(node x,node y)
{
return x.x<y.x;
}
int t,tot,head[500048],nxt[1000048],to[1000048],f[1000048],w[1000048];
inline void addedge(int s,int t,int cap,int cost)
{
to[++tot]=t;nxt[tot]=head[s];head[s]=tot;f[tot]=cap;w[tot]=cost;
to[++tot]=s;nxt[tot]=head[t];head[t]=tot;f[tot]=0;w[tot]=-cost;
}
int n,k;
bool spfa()
{
int i,x,y;
for (i=0;i<=t;i++) inq[i]=false;
qq.push(0);inq[0]=true;
for (i=0;i<=t;i++) dist[i]=INF;
dist[0]=0;
while (!qq.empty())
{
x=qq.front();qq.pop();
inq[x]=false;
for (i=head[x];i;i=nxt[i])
{
y=to[i];
if (f[i] && dist[y]>dist[x]+w[i])
{
dist[y]=dist[x]+w[i];
prevv[y]=x;preve[y]=i;
if (!inq[y])
{
inq[y]=true;
qq.push(y);
}
}
}
}
//for (i=0;i<=t;i++) cout<<dist[i]<<' ';
//cout<<endl;
if (dist[t]>=INF) return false; else return true;
}
bool dijkstra()
{
int i,x,y,dd;
for (i=0;i<=t;i++) dist[i]=INF;
dist[0]=0;
q.push(mp(0,0));
while (!q.empty())
{
x=q.top().y;dd=-q.top().x;q.pop();
if (dd>dist[x]) continue;
for (i=head[x];i;i=nxt[i])
{
y=to[i];
if (f[i] && dist[y]>dist[x]+w[i]+h[x]-h[y])
{
dist[y]=dist[x]+w[i]+h[x]-h[y];
prevv[y]=x;preve[y]=i;
q.push(mp(-dist[y],y));
}
}
}
if (dist[t]>=INF) return false; else return true;
}
int min_cost_flow()
{
int i,x,y,u,minf,res=0;
for (i=0;i<=t;i++) h[i]+=dist[i];
minf=INF;
for (u=t;u;u=prevv[u])
minf=min(minf,f[preve[u]]);
res=minf*h[t];
for (u=t;u;u=prevv[u])
{
f[preve[u]]-=minf;
f[preve[u]^1]+=minf;
}
return res;
}
int main ()
{
int ca,i,j,x,y,w;
scanf("%d",&ca);
while (ca--)
{
scanf("%d%d",&n,&k);
top=0;node insert;
for (i=1;i<=n;i++)
{
scanf("%d%d%d",&segment[i].x,&segment[i].y,&segment[i].w);
insert.x=segment[i].x;insert.from=i;insert.f=false;
a[++top]=insert;
insert.x=segment[i].y;insert.f=true;
a[++top]=insert;
//t=max(t,segment[i].y);
}
sort(a+1,a+top+1,cmp);
t=1;if (a[1].f) segment[a[1].from].yy=1; else segment[a[1].from].xx=1;
for (i=2;i<=top;i++)
if (a[i].x==a[i-1].x)
{
if (a[i].f) segment[a[i].from].yy=t; else segment[a[i].from].xx=t;
}
else
{
if (a[i].f) segment[a[i].from].yy=++t; else segment[a[i].from].xx=++t;
}
tot=1;
for (i=0;i<=t;i++) head[i]=0;
for (i=0;i<=t;i++) h[i]=0;
addedge(0,1,k,0);
for (i=1;i<=t-1;i++) addedge(i,i+1,INF,0);
for (i=1;i<=n;i++) addedge(segment[i].xx,segment[i].yy,1,-segment[i].w);
if (spfa())
{
int ans=0;
do
{
ans+=min_cost_flow();
}
while (dijkstra());
printf("%d\n",-ans);
}
}
return 0;
}