procon

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub mugen1337/procon

:heavy_check_mark: test/AOJ_2313.test.cpp

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2313"

#include "../template.hpp"

#include "../Flow/Dinic.hpp"


signed main(){
    int n,m,q;cin>>n>>m>>q;
    Dinic<int> flow(n);
    set<pair<int,int>> st;
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        flow.add_edge(u,v,1);
        flow.add_edge(v,u,1);
        st.insert({u,v});
        st.insert({v,u});
    }

    using T=tuple<int,int,int>;
    vector<T> qs;
    rep(i,q){
        int m,a,b;cin>>m>>a>>b;a--,b--;
        qs.push_back({m,a,b});
        if(st.count({a,b})) continue;
        flow.add_edge(a,b,0);
        flow.add_edge(b,a,0);
    }

    int res=flow.max_flow(0,n-1);
    for(auto [m,a,b]:qs){
        if(m==1){
            res+=flow.add(0,n-1,a,b,1);
            res+=flow.add(0,n-1,b,a,1);
        }else{
            res-=flow.cut(0,n-1,a,b);
            res-=flow.cut(0,n-1,b,a);
        }
        cout<<res<<endl;
    }
    return 0;
}
#line 1 "test/AOJ_2313.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2313"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 4 "test/AOJ_2313.test.cpp"

#line 1 "Flow/Dinic.hpp"
template<typename T>
struct Dinic{
    private:
    vector<int> lv,iter;
    // 増加道
    bool bfs(int s,int t){
        lv.assign(g.size(),-1);
        queue<int> que;
        lv[s]=0;
        que.push(s);
        while(!que.empty() and lv[t]==-1){
            int p=que.front();que.pop();
            for(auto &e:g[p]){
                if(e.cap>0 and lv[e.to]==-1){
                    lv[e.to]=lv[p]+1;
                    que.push(e.to);
                }
            }
        }
        return lv[t]!=-1;
    }
    T dfs(int cur,int t,T flow){
        if(cur==t) return flow;
        for(int &i=iter[cur];i<(int)g[cur].size();i++){
            edge &e=g[cur][i];
            if(e.cap>0 and lv[cur]<lv[e.to]){
                T d=dfs(e.to,t,min(flow,e.cap));
                if(d>0){
                    e.cap-=d;
                    g[e.to][e.rev].cap+=d;
                    return d;
                }
            }
        }
        return 0;
    }

    public:
    const T inf;
    struct edge{
        int to;
        T cap;
        int rev;
        bool isrev;
        int idx;
        edge(int to,T cap,int rev,bool isrev,int idx)
        :to(to),cap(cap),rev(rev),isrev(isrev),idx(idx){}
        edge(){}
    };
    vector<vector<edge>> g;

    Dinic(int V):inf(numeric_limits<T>::max()/2),g(V){}

    void add_edge(int from,int to,T cap,int idx=-1){
        g[from].emplace_back(to,cap,(int)g[to].size(),false,idx);
        g[to].emplace_back(from,0,(int)g[from].size()-1,true,idx);
    }

    T max_flow(int s,int t,T lim){
        T ret=0;
        while(lim>0 and bfs(s,t)){
            iter.assign(g.size(),0);
            while(true){
                T f=dfs(s,t,lim);
                if(f==0) break;
                ret+=f;
                lim-=f;
            }
        }
        return ret;
    }
    T max_flow(int s,int t){
        return max_flow(s,t,inf);
    }

    // g[u][u_idx]を切る
    // idx>=0 ならindex指定して切る．
    // idx<0  なら全部切る
    T cut(int s,int t,int u,int v,int idx=-1){
        T cr=0;
        for(auto &e:g[u])if(e.to==v and !e.isrev){
            if(idx<0 or idx==e.idx){
                cr+=g[v][e.rev].cap;
                e.cap=0;
                g[v][e.rev].cap=0;
            }
        }
        if(cr==0) return 0;
        // 迂回して流しなおす
        T cap=cr-max_flow(u,v,cr);
        // 流せなかった分を補正する
        if(u!=s and cap!=0) max_flow(u,s,cap);
        if(v!=t and cap!=0) max_flow(t,v,cap);
        return cap;
    }
    // u -> vの容量をfだけ増やす
    T add(int s,int t,int u,int v,T f,int idx=-1){
        add_edge(u,v,f,idx);
        return max_flow(s,t,f);
    }
};
#line 6 "test/AOJ_2313.test.cpp"


signed main(){
    int n,m,q;cin>>n>>m>>q;
    Dinic<int> flow(n);
    set<pair<int,int>> st;
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        flow.add_edge(u,v,1);
        flow.add_edge(v,u,1);
        st.insert({u,v});
        st.insert({v,u});
    }

    using T=tuple<int,int,int>;
    vector<T> qs;
    rep(i,q){
        int m,a,b;cin>>m>>a>>b;a--,b--;
        qs.push_back({m,a,b});
        if(st.count({a,b})) continue;
        flow.add_edge(a,b,0);
        flow.add_edge(b,a,0);
    }

    int res=flow.max_flow(0,n-1);
    for(auto [m,a,b]:qs){
        if(m==1){
            res+=flow.add(0,n-1,a,b,1);
            res+=flow.add(0,n-1,b,a,1);
        }else{
            res-=flow.cut(0,n-1,a,b);
            res-=flow.cut(0,n-1,b,a);
        }
        cout<<res<<endl;
    }
    return 0;
}
Back to top page