//Place your snippets for cpp here. Each snippet is defined under a snippet name and has a prefix, body and 
// description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. Placeholders with the 
// same ids are connected.
// prefix 的格式要求是 acm-[一级标题编号].[二级标题编号][该代码片段的英文简称]
// description 的格式要求是 "插入 [该代码片段的中文名]"

{
    "孤岛营救问题  (EK)": {
        "prefix": "acm-3.5MCMF",
        "body": [
            "#include<algorithm>",
            "#include<cstdio>",
            "#include<vector>",
            "#include<queue>",
            "#define LL long long",
            "#define Re register int",
            "using namespace std;",
            "const int N=2e5,M=2e6+5,inf=2e9;",
            "int T,x,y,z,w,G,o=1,p,n,m,h,t,st,ed,maxp,cyf[N],pan[N],pre[N],dis[N],head[N],Map[11][11][11][11];LL mincost,maxflow; ",
            "struct QAQ{int w,to,next,flow;}a[M<<1];queue<int>Q;vector<int>key[11][11];",
            "inline void in(Re &x){",
            "    int f=0;x=0;char c=getchar();",
            "    while(c<'0'||c>'9')f|=c=='-',c=getchar();",
            "    while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();",
            "    x=f?-x:x;",
            "}",
            "inline void add(Re x,Re y,Re z,Re w){a[++o].flow=z,a[o].w=w,a[o].to=y,a[o].next=head[x],head[x]=o;}",
            "inline void add_(Re a,Re b,Re flow,Re w){add(a,b,flow,w),add(b,a,0,-w);}",
            "inline int SPFA(Re st,Re ed){",
            "\tfor(Re i=0;i<=ed;++i)dis[i]=inf,pan[i]=0;",
            "\tQ.push(st),pan[st]=1,dis[st]=0,cyf[st]=inf;",
            "\twhile(!Q.empty()){",
            "\t\tRe x=Q.front();Q.pop();pan[x]=0;",
            "\t\tfor(Re i=head[x],to;i;i=a[i].next)",
            "\t\t\tif(a[i].flow&&dis[to=a[i].to]>dis[x]+a[i].w){",
            "\t\t\t\tdis[to]=dis[x]+a[i].w,pre[to]=i;",
            "\t\t\t\tcyf[to]=min(cyf[x],a[i].flow);",
            "\t\t\t\tif(!pan[to])pan[to]=1,Q.push(to);",
            "\t\t\t}",
            "\t}",
            "\treturn dis[ed]!=inf;",
            "}",
            "inline void EK(Re st,Re ed){",
            "\twhile(SPFA(st,ed)){",
            "\t\tRe x=ed;maxflow+=cyf[ed],mincost+=(LL)cyf[ed]*dis[ed];",
            "\t\twhile(x!=st){",
            "\t\t\tRe i=pre[x];",
            "\t\t\ta[i].flow-=cyf[ed];",
            "\t\t\ta[i^1].flow+=cyf[ed];",
            "\t\t\tx=a[i^1].to;",
            "\t\t}",
            "\t}",
            "}",
            "inline int P(Re x,Re y,Re k){return (x-1)*m+y+k*n*m;}",
            "int main(){",
            "\tin(n),in(m),in(p),maxp=(1<<p)-1;st=(maxp+1)*n*m+1,ed=st+1;",
            "\tin(T);while(T--)in(x),in(y),in(z),in(w),in(G),Map[x][y][z][w]=Map[z][w][x][y]=G?G:-1;",
            "\tin(T);while(T--)in(x),in(y),in(G),key[x][y].push_back(G);",
            "\tadd_(st,P(1,1,0),1,0);",
            "\tfor(Re k=0;k<=maxp;++k)add_(P(n,m,k),ed,1,0);",
            "\tfor(Re i=1;i<=n;++i)",
            "\t\tfor(Re j=1;j<=m;++j)",
            "\t\t\tif(!key[i][j].empty())",
            "\t\t\t\tfor(Re O=0;O<key[i][j].size();++O){",
            "\t\t\t\t\tRe KEY=key[i][j][O];",
            "\t\t\t\t\tfor(Re k=0;k<=maxp;++k){",
            "\t\t\t\t\t\tif(!((k>>KEY-1)&1))add_(P(i,j,k),P(i,j,k|(1<<KEY-1)),inf,0);",
            "\t\t\t\t\t\telse{",
            "\t\t\t\t\t\t\tif(i<n&&Map[i][j][i+1][j]!=-1){",
            "\t\t\t\t\t\t\t\tif(!Map[i][j][i+1][j])add_(P(i,j,k),P(i+1,j,k),inf,1);",
            "\t\t\t\t\t\t\t\telse if((k>>Map[i][j][i+1][j]-1)&1)add_(P(i,j,k),P(i+1,j,k),inf,1);",
            "\t\t\t\t\t\t\t}",
            "\t\t\t\t\t\t\tif(j<m&&Map[i][j][i][j+1]!=-1){",
            "\t\t\t\t\t\t\t\tif(!Map[i][j][i][j+1])add_(P(i,j,k),P(i,j+1,k),inf,1);",
            "\t\t\t\t\t\t\t\telse if((k>>Map[i][j][i][j+1]-1)&1)add_(P(i,j,k),P(i,j+1,k),inf,1);",
            "\t\t\t\t\t\t\t}",
            "\t\t\t\t\t\t\tif(i>1&&Map[i][j][i-1][j]!=-1){",
            "\t\t\t\t\t\t\t\tif(!Map[i][j][i-1][j])add_(P(i,j,k),P(i-1,j,k),inf,1);",
            "\t\t\t\t\t\t\t\telse if((k>>Map[i][j][i-1][j]-1)&1)add_(P(i,j,k),P(i-1,j,k),inf,1);",
            "\t\t\t\t\t\t\t}",
            "\t\t\t\t\t\t\tif(j>1&&Map[i][j][i][j-1]!=-1){",
            "\t\t\t\t\t\t\t\tif(!Map[i][j][i][j-1])add_(P(i,j,k),P(i,j-1,k),inf,1);",
            "\t\t\t\t\t\t\t\telse if((k>>Map[i][j][i][j-1]-1)&1)add_(P(i,j,k),P(i,j-1,k),inf,1);",
            "\t\t\t\t\t\t\t}",
            "\t\t\t\t\t\t}",
            "\t\t\t\t\t}",
            "\t\t\t\t}",
            "\t\t\telse",
            "\t\t\t\tfor(Re k=0;k<=maxp;++k){",
            "\t\t\t\t\tif(i<n&&Map[i][j][i+1][j]!=-1){",
            "\t\t\t\t\t\tif(!Map[i][j][i+1][j])add_(P(i,j,k),P(i+1,j,k),inf,1);",
            "\t\t\t\t\t\telse if((k>>Map[i][j][i+1][j]-1)&1)add_(P(i,j,k),P(i+1,j,k),inf,1);",
            "\t\t\t\t\t}",
            "\t\t\t\t\tif(j<m&&Map[i][j][i][j+1]!=-1){",
            "\t\t\t\t\t\tif(!Map[i][j][i][j+1])add_(P(i,j,k),P(i,j+1,k),inf,1);",
            "\t\t\t\t\t\telse if((k>>Map[i][j][i][j+1]-1)&1)add_(P(i,j,k),P(i,j+1,k),inf,1);",
            "\t\t\t\t\t}",
            "\t\t\t\t\tif(i>1&&Map[i][j][i-1][j]!=-1){",
            "\t\t\t\t\t\tif(!Map[i][j][i-1][j])add_(P(i,j,k),P(i-1,j,k),inf,1);",
            "\t\t\t\t\t\telse if((k>>Map[i][j][i-1][j]-1)&1)add_(P(i,j,k),P(i-1,j,k),inf,1);",
            "\t\t\t\t\t}",
            "\t\t\t\t\tif(j>1&&Map[i][j][i][j-1]!=-1){",
            "\t\t\t\t\t\tif(!Map[i][j][i][j-1])add_(P(i,j,k),P(i,j-1,k),inf,1);",
            "\t\t\t\t\t\telse if((k>>Map[i][j][i][j-1]-1)&1)add_(P(i,j,k),P(i,j-1,k),inf,1);",
            "\t\t\t\t\t}",
            "\t\t\t\t}",
            "\tEK(st,ed);",
            "\tif(maxflow)printf(\"%lld\",mincost);",
            "\telse printf(\"-1\");",
            "}",
            ""
        ],
        "description": "插入 孤岛营救问题  (EK)"
    }
}