1.最显然的前缀优化。
2.线段树优化【CF 793G】Oleg and Chess
dalao博客
3.倍增优化 CF786E ALT 最小割+倍增lca
这个dalao讲的好
AC Code:(图论代码行数压不下来啊)
#include<bits/stdc++.h>
#define maxn 20005
#define mapt 2000005
#define lim 16
#define inf 0x3f3f3f3f
using namespace std;
int n,m;
int info[mapt],Prev[mapt],to[mapt],cap[mapt],cnt_e=1;
inline void Node(int u,int v,int c){ Prev[++cnt_e]=info[u],info[u]=cnt_e,to[cnt_e]=v,cap[cnt_e]=c; }
inline void Line(int u,int v,int c){ Node(u,v,c),Node(v,u,0); }
vector<int>G[maxn],id[maxn];
int f[lim][maxn],ptr[lim][maxn],dep[maxn];
int S , T , tot;
void dfs(int now,int ff)
{
dep[now] = dep[f[0][now] = ff] + 1;
for(int i=0,siz=G[now].size();i<siz;i++)
if(G[now][i]!=ff)
{
ptr[0][G[now][i]] = id[now][i];
Line(id[now][i],T,1);
dfs(G[now][i],now);
}
}
int dis[mapt];
int aug(int now,int Max)
{
if(now == T) return Max;
int st = Max;
for(int i=info[now];i && st;i=Prev[i])
if(cap[i] && dis[to[i]] == dis[now] - 1)
{
int inc = aug(to[i],min(cap[i],st));
st -= inc, cap[i] -= inc , cap[i ^ 1] += inc;
}
return Max - st;
}
inline bool BFS()
{
static queue<int>q;
memset(dis,-1,sizeof dis);
q.push(T),dis[T]=0;
for(int now;!q.empty();)
{
now = q.front(),q.pop();
for(int i=info[now];i;i=Prev[i])
if(cap[i^1] && dis[to[i]]==-1)
{
dis[to[i]] = dis[now] + 1;
q.push(to[i]);
}
}
return dis[S] != -1;
}
inline int sap()
{
int ret = 0;
for(;BFS();) ret+=aug(S,inf);
return ret;
}
bool vis[mapt];
void dfs(int now)
{
if(vis[now]) return;
vis[now] = 1;
for(int i=info[now];i;i=Prev[i])
if(cap[i]) dfs(to[i]);
}
int main()
{
scanf("%d%d",&n,&m);
tot = n + m;
S = ++tot,T=++tot;
for(int i=1,u,v;i<n;i++) scanf("%d%d",&u,&v),
G[u].push_back(v),G[v].push_back(u),
id[u].push_back(i),id[v].push_back(i);
dfs(1,0);
for(int j=1;j<lim;j++)
for(int i=1;i<=n;i++)
f[j][i] = f[j-1][f[j-1][i]],
ptr[j][i] = ++tot,
Line(ptr[j][i],ptr[j-1][i],inf),Line(ptr[j][i],ptr[j-1][f[j-1][i]],inf);
for(int i=n+1,x,y;i<=m+n;i++)
{
scanf("%d%d",&x,&y);
if(dep[x] > dep[y]) swap(x,y);
for(int j=0;dep[y]^dep[x];j++)
if(((dep[y] - dep[x])>>j) & 1)
{
Line(i,ptr[j][y],inf);
y = f[j][y];
}
if(x != y)
{
for(int j=lim-1;j>=0;j--)
if(f[j][x] != f[j][y])
{
Line(i,ptr[j][x],inf),Line(i,ptr[j][y],inf);
x = f[j][x] , y = f[j][y];
}
Line(i,ptr[0][x],inf);
Line(i,ptr[0][y],inf);
}
Line(S,i,1);
}
printf("%d\n",sap());
dfs(S);
vector<int>ans;
for(int i=n+1;i<=n+m;i++)
if(!vis[i]) ans.push_back(i-n);
printf("%d",ans.size());
for(int i=0,siz=ans.size();i<siz;i++) printf(" %d",ans[i]);
printf("\n");
ans.clear();
for(int i=1;i<n;i++)
if(vis[i]) ans.push_back(i);
printf("%d",ans.size());
for(int i=0,siz=ans.size();i<siz;i++) printf(" %d",ans[i]);
}