洛谷P2319 [HNOI2006]超级英雄

一开始是用二分图匹配（网络流）+二分做的，后来发现直接用匈牙利更简单

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define pii pair<int,int>
#define X first
#define Y second
#define INF 0x7f7f7f7f
#define MAXN 1000+10
using namespace std;
struct Edge{
    int from,to,cap,flow;
    Edge(int u=,int v=,int c=,int f=){
        from=u,to=v,cap=c,flow=f;
    }
};
struct Dinic{
    int n,m,s,t;
    vector<Edge> edges;
    vector<int> G[MAXN<<];
    int d[MAXN<<];
    int b[MAXN<<];
    int cur[MAXN<<];
    void init(int n,int s,int t){
        this->n=n;
        this->s=s,this->t=t;
        edges.clear();
        for(int i=;i<=n;i++){
            G[i].clear();
        }
    }
    void AddEdge(int x,int y,int cap){
        edges.push_back(Edge(x,y,cap,));
        edges.push_back(Edge(y,x,,));
        m=edges.size();
        G[x].push_back(m-);
        G[y].push_back(m-);
    }
    bool BFS(){
        memset(b,,sizeof(b));
        queue<int> q;
        d[s]=;
        q.push(s);
        b[s]=;
        while(!q.empty()){
            int x=q.front();q.pop();
            for(int i=;i<G[x].size();i++){
                Edge &e=edges[G[x][i]];
                if(e.cap>e.flow&&!b[e.to]){
                    q.push(e.to);
                    b[e.to]=;
                    d[e.to]=d[x]+;
                }
            }
        }
        return b[t];
    }
    int dfs(int x,int a){
        if(x==t||!a)return a;
        int flow=,f;
        for(int &i=cur[x];i<G[x].size();i++){
            Edge &e=edges[G[x][i]];
            if(d[e.to]==d[x]+&&(f=dfs(e.to,min(a,e.cap-e.flow)))>){
                edges[G[x][i]].flow+=f;
                edges[G[x][i]^].flow-=f;
                flow+=f;
                a-=f;
                if(!a){
                    break;
                }
            }
        }
        return flow;
    }
    int Maxflow(){
        int flow=;
        while(BFS()){
            memset(cur,,sizeof(cur));
            flow+=dfs(s,INF);
        }
        return flow;
    }
}D;
int n,m;
pii a[MAXN];
int s[MAXN];
void print(int x){
    for(int i=;i<D.edges.size();i++){
        Edge &e=D.edges[i];
        if(e.flow>=&&n+<=e.to&&e.to<=n+x){
            s[e.to-n]=e.from;
        }
    }
    for(int i=;i<=x;i++){
        printf("%d\n",s[i]-);
    }
}
void init(){
    scanf("%d%d",&n,&m);
    for(int i=;i<=m;i++){
        scanf("%d%d",&a[i].X,&a[i].Y);
        a[i].X++,a[i].Y++;
    }
}
int check(int x){
    D.init(n+x+,,n+x+);
    for(int i=;i<=n;i++){
        D.AddEdge(,i,);
    }
    for(int i=;i<=x;i++){
        D.AddEdge(a[i].X,n+i,);
        D.AddEdge(a[i].Y,n+i,);
        D.AddEdge(n+i,n+x+,);
    }
    int ans=D.Maxflow();
    return (ans==x);
}
void solve(){
    int L=,R=m;
    while(R-L>){
        int mid=(L+R)/;
        if(check(mid)){
            L=mid;
        }
        else{
            R=mid;
        }
    }
    if(check(R)){
        printf("%d\n",R);
        print(R);
    }
    else if(check(L)){
        printf("%d\n",L);
        print(L);
    }
}
int main()
{
    //freopen("data.in","r",stdin);
    init();
    solve();
    return ;
}

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define pii pair<int,int>
#define X first
#define Y second
#define INF 0x7f7f7f7f
#define MAXN 1000+10
using namespace std;
int n,m;
int girl[MAXN],boy[MAXN];
int used[MAXN];
int a[MAXN][];
bool find(int x){
    for(int i=;i<=;i++){
        int y=a[x][i];
        if(!used[y]){
            used[y]=;
            if(!girl[y]||find(girl[y])){
                girl[y]=x;
                boy[x]=y;
                return ;
            }
        }
    }
    return ;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=;i<=m;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        x++,y++;
        a[i][]=x,a[i][]=y;
    }
    int ans=;
    for(int i=;i<=m;i++){
        memset(used,,sizeof(used));
        if(find(i))
            ans++;
        else
            break;
    }
    printf("%d\n",ans);
    for(int i=;i<=ans;i++){
        printf("%d\n",boy[i]-);
    }
    return ;
}