在建图的时候脑抽把正在考虑能否夺冠的球队也放进去了
在本题中加深了理解,节点编号什么的怎么简单怎么来,不需要按层次顺序编号
//K-League
#include<iostream>
#include<queue>
#include<cstring>
#include<stdio.h>
using namespace std;
const int MAXN = 1000;
const int INF=0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow;
Edge(){}
Edge(int f,int t,int c,int fl):from(f),to(t),cap(c),flow(fl){}
bool operator < (const Edge& e) const
{
return from < e.from || (from == e.from && to < e.to);
}
};
struct dinic
{
int n,m,s,t;
vector<Edge>edges;
vector<int>G[MAXN];
bool vis[MAXN];
int d[MAXN];
int cur[MAXN];
void init(int n)
{
this->n=n;
edges.clear();
for(int i=0;i<MAXN;++i)
G[i].clear();
}
void AddEdge(int u,int v,int cap)
{
edges.push_back(Edge(u,v,cap,0));
edges.push_back(Edge(v,u,0,0));
m=edges.size();
G[u].push_back(m-2);
G[v].push_back(m-1);
}
bool bfs()
{
memset(vis, 0, sizeof(vis));
queue<int> Q;
Q.push(s);
d[s] = 0;
vis[s] = 1;
while(!Q.empty()){
int x = Q.front(); Q.pop();
for(int i = 0; i < G[x].size(); i++){
Edge& e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow){
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int dfs(int x,int a)
{
if(x==t||!a) return a;
int flow=0,f=0;
for(int& i=cur[x];i<G[x].size();++i)
{
Edge &e= edges[G[x][i]];
if(d[e.to]==d[x]+1&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
{
e.flow+=f;
edges[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if(!a) break;
}
}
return flow;
}
int MaxFlow(int s,int t)
{
this->s=s;
this->t=t;
int flow=0;
while(bfs())
{
memset(cur,0,sizeof(cur));
flow+=dfs(s,INF);
}
return flow;
}
int check()
{
int flag=1;
for(int i=0;i<G[0].size();++i)
{
Edge &e=edges[G[0][i]];
if(e.cap>e.flow)
{
flag=0;
break;
}
}
return flag;
}
}dc;
int win[30],lose[30],total[30];
int play[30][30];
vector<int>ans;
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
memset(win,0,sizeof(win));
memset(total,0,sizeof(total));
ans.clear();
for(int i=1;i<=n;++i)
{
scanf("%d%d",&win[i],&lose[i]);
total[i]+=win[i];
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
scanf("%d",&play[i][j]);
total[i]+=play[i][j];
}
}
//思路错误,所有球队k涉及的比赛我已经设置为k赢了,我这个时候就不应该把它放进图中
//如果是我可能会把那些队给空出来,但事实上我可以开一个量来记录边数
for(int k=1;k<=n;++k)
{
int flag=1;
for(int i=1;i<=n;++i)
if(total[k]<win[i])
{
flag=0;
break;
}
if(!flag) continue;
dc.init(n*n+n+2);
int cnt=n;
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j) //
{
if(play[i][j]&&i!=k&&j!=k)
{
dc.AddEdge(0,++cnt,play[i][j]);
dc.AddEdge(cnt,i,INF);
dc.AddEdge(cnt,j,INF);
}
}
++cnt;
for(int i=1;i<=n;++i).
if(i!=k) dc.AddEdge(i,cnt,total[k]-win[i]);
dc.MaxFlow(0,cnt);
if(dc.check())
{
ans.push_back(k);
}
}
for(int i=0;i<ans.size();++i)
{
if(!i) printf("%d",ans[i]);
else printf(" %d",ans[i]);
}
printf("\n");
// for(int k=1;k<=n;++k)
// {
// int flag=1;
// for(int i=1;i<=n;++i)
// if(total[k]<win[i])
// {
// flag=0;
// break;
// }
// if(!flag) continue;
// dc.init(n*n+n+2);
// for(int i=1;i<=n;++i)
// for(int j=1;j<=n;++j)
// {
// dc.AddEdge(0,(i-1)*n+j,play[i][j]);
// dc.AddEdge((i-1)*n+j,n*n+i,INF);
// dc.AddEdge((i-1)*n+j,n*n+j,INF);
// }
// for(int i=1;i<=n;++i)
// dc.AddEdge(n*n+i,n*n+n+1,total[k]-win[i]);
// int flow=dc.MaxFlow(0,n*n+n+1);
// }
}
return 0;
}
有没有好心人教教我 二分的时候输出啥啊
//LA 3231 Fair Share 还是很迷二分什么时候应该输出啥
#include<stdio.h>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
const int MAXN = 20010;
const int INF=0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow;
Edge(){}
Edge(int f,int t,int c,int fl):from(f),to(t),cap(c),flow(fl){}
bool operator < (const Edge& e) const
{
return from < e.from || (from == e.from && to < e.to);
}
};
int a[MAXN],b[MAXN];
struct dinic
{
int n,m,s,t;
vector<Edge>edges;
vector<int>G[MAXN];
bool vis[MAXN];
int d[MAXN];
int cur[MAXN];
void init(int n)
{
this->n=n;
edges.clear();
for(int i=0;i<MAXN;++i)
G[i].clear();
}
void AddEdge(int u,int v,int cap)
{
edges.push_back(Edge(u,v,cap,0));
edges.push_back(Edge(v,u,0,0));
m=edges.size();
G[u].push_back(m-2);
G[v].push_back(m-1);
}
bool bfs()
{
memset(vis, 0, sizeof(vis));
queue<int> Q;
Q.push(s);
d[s] = 0;
vis[s] = 1;
while(!Q.empty()){
int x = Q.front(); Q.pop();
for(int i = 0; i < G[x].size(); i++){
Edge& e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow){
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int dfs(int x,int a)
{
if(x==t||!a) return a;
int flow=0,f=0;
for(int& i=cur[x];i<G[x].size();++i)
{
Edge &e= edges[G[x][i]];
if(d[e.to]==d[x]+1&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
{
e.flow+=f;
edges[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if(!a) break;
}
}
return flow;
}
int MaxFlow(int s,int t)
{
this->s=s;
this->t=t;
int flow=0;
while(bfs())
{
memset(cur,0,sizeof(cur));
flow+=dfs(s,INF);
}
return flow;
}
}dc;
int main()
{
//freopen("a.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--)
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;++i) //missions 1~m
{
scanf("%d%d",&a[i],&b[i]); //processors m+a m+1~m+n
}
int l=0,r=m+1;
int s=0,t=n+m+1;
int mid;
int flow=0;
int ans=0;
while(l<r) //输出l和mid都会wa
{
mid=(l+r)>>1;
dc.init(m+n+2);
for(int i=1;i<=m;++i) //missions 1~m
{
dc.AddEdge(0,i,1);
}
for(int i=1;i<=m;++i)
{
dc.AddEdge(i,m+a[i],1);
dc.AddEdge(i,m+b[i],1);
}
for(int i=1;i<=n;++i)
dc.AddEdge(m+i,m+n+1,mid);
flow=dc.MaxFlow(s,t);
if(flow>=m)
{
r=mid;
ans=mid;
}
else l=mid+1;
}
printf("%d\n",r);
}
return 0;
}
UVALive3268 Jamie's Contact Groups和Fair Share一模一样
特殊点在于读入 还是stringstream好用,虽然慢了点
getchar(); //忘记读回车了
for(int i=1;i<=n;++i)
{
group[i].clear();
char name[30];
int num;
string s;
getline(cin,s);
stringstream ss(s);
ss>>name;
while(ss>>num)
{
group[i].push_back(num);
}
}