洛谷 3254 圆桌问题

真的这题要用优化，register优化，当前弧优化，delta为真优化。

#include<cstdio>

#include<iostream>
#include<cstring>


#define RG register


using namespace std;


const int N = 6000001;
const int M = 3000001;
int s,t,tot = 1,n,m;
int head[N + M],tov[N + M],next[N + M],f[N + M],dis[N + M],q[N + M];
bool vis[M + N];
int a[N],c[M],hh[N + M];


inline void read( int&x ) {
    int f=1;x=0;char c=getchar();
    while(c>'9'||c<'0') {if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') x=10*x+c-48,c=getchar();
    x=x*f;
}
void add(int u,int v,int val){
tot++;
tov[tot] = v;
next[tot] = head[u];
f[tot] = val;
head[u] = tot;
tot++;
tov[tot] = u;
next[tot] = head[v];
f[tot] = 0;
head[v] = tot;
}


bool bfs(){
memset(dis,0,sizeof(int) * (n+m+2));
memset(vis,false,sizeof(int) * (n+m+2));
memset(q,0,sizeof(q));
int h = 0,ta = 1;
vis[s] = true;
dis[s] = 1;
q[ta] = s;
while (h != ta){
int u = q[++h];
for (RG int i = head[u];i;i = next[i]){
  int v = tov[i];
  if (f[i] && !vis[v]){
  q[++ta] = v;
  vis[v] = true;
  dis[v] = dis[u] + 1;
  }
}
}
return vis[t];
}


int dfs(int u,int delta){
if (u == t)
return delta;
int res = 0;
for (RG int i = hh[u];i && delta ;i = next[i]){
int v = tov[i];
if (f[i] && dis[v] == dis[u] + 1){
  int dd = dfs(v,min(delta,f[i]));
  f[i] -= dd;
  f[i^1] +=dd;
  delta -= dd;
  res += dd;
  hh[u]=i;
}
}
return res;
}
inline void write(int x){
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
int main(){
read(m);read(n);
t = n + m + 1;
for (RG int i = 1;i <= m;i++)
read(a[i]);
for (RG int i = m + 1;i <= m + n;i++)
read(c[i]);
for (RG int i = 1;i <= m;i++)
add(s,i,a[i]);
for (RG int i = 1;i <= m;i++)
for (RG int j = m + 1;j <= n + m;j++)
    add(i,j,1);
for (RG int i = m + 1;i <= m + n;i++)
add(i,t,c[i]);
while (bfs()){
int maxn = 1e9 + 7;
for(int i=0;i<=n+m+2;i++)
  hh[i]=head[i];
dfs(s,maxn);
}
int flag = 0;
for (RG int i = head[s];i;i = next[i])
if (f[i])
flag = 1;
if (flag) printf("0\n");
if (!flag){
printf("1\n");
for(RG int i=1;i<=m;i++){
for(RG int j=head[i];j;j=next[j]){
if(!f[j]){
      write(tov[j]-m);
      printf(" ");
  }
  }
  printf("\n");
}
}
return 0;
}