glassices<\/a>\u795e\u725b\u624d\u77e5\u9053\u600e\u4e48\u505a\u3002\u3002\u795e\u725b\u771f\u662f\u592a\u5f3a\u5927\u4e86\uff01\uff01
Orz\uff01\uff01\uff01\uff01\uff01
\u6069\u3002\u3002\u6211\u4e00\u770b\u5230\u8fd9\u4e2a\u9898\u76ee\u3002\u3002\u7b2c\u4e00\u53cd\u5e94\u5c31\u662f\u7f51\u7edc\u6d41\u3002\u3002\u7136\u540e\u7acb\u9a6c\u611f\u89c9\u5230Li\u548cCi\u5c31\u662f\u6240\u8c13\u7684\u4e0b\u5c4a\uff0c
\u7136\u540e\u60f3\u5230\u4e0a\u4e0b\u754c\u7f51\u7edc\u6700\u5c0f\u6d41\u56e7\u3002\u3002\u3002
\u611f\u89c9\u975e\u5e38\u7e41\u7410\u554a\u3002\u3002\u7136\u540e\u795e\u725b\u544a\u8bc9\u6211\u8bf4\u8981\u8f6c\u5316\u4e00\u4e0b\u3002\u3002
\u5148\u628a\u68cb\u76d8\u653e\u6ee1\uff0c\u5982\u679c\u4e0d\u80fd\u6ee1\u8db3\u5c31\u56e7\u4e86\u3002\u3002
\u7136\u540e\u53ef\u4ee5\u53d1\u73b0\u6bcf\u4e2a\u884c\u548c\u5217\u80fd\u62ff\u6389\u7684\u6700\u5927\u503c\u5c31\u77e5\u9053\u4e86\u3002\u3002
\u7136\u540e\u6700\u5c11\u6570=\u5168\u90e8\u6570-\u6700\u591a\u80fd\u62ff\u6389\u51e0\u4e2a\u3002\u3002
\u5c31\u6210\u6700\u5927\u6d41\u4e86\u56e7\u3002\u3002
Code\uff1a
#include <vector>
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <set>
#include <map>
#include <cstring>
#include <time.h>
#define rep(i,n) for(int i=0;i<n;i++)
const int inf=~0U>>1,maxv=200+10,maxn=100;
using namespace std;
int vs,vt,n,m,k,v,ans=0;
struct Edge
{
int t,c;
Edge*next,*op;
Edge(int _t,int _c,Edge*_n):t(_t),c(_c),next(_n){}
}*E[maxv]={};
void AddEdge(int s,int t,int c)
{
E[s]=new Edge(t,c,E[s]);
E[t]=new Edge(s,0,E[t]);
E[s]->op=E[t];E[t]->op=E[s];
}
bool M[maxn][maxn]={};
int L[maxn],C[maxn];
void Fail()
{
puts("JIONG!");
exit(0);
}
void Init()
{
cin>>n>>m>>k;v=n+m;vs=v++;vt=v++;
rep(i,n)cin>>L[i];
rep(i,m)cin>>C[i];
int x,y;
rep(i,k)
{
scanf("%d%d",&x,&y);–x;–y;
M[x][y]=true;
}
rep(i,n)rep(j,m)if(!M[i][j])L[i]–,C[j]–,ans++;
rep(i,n)if(L[i]>0)Fail();
rep(i,m)if(C[i]>0)Fail();
}
void BuildGraph()
{
rep(i,n)AddEdge(vs,i,-L[i]);
rep(j,m)AddEdge(j+n,vt,-C[j]);
rep(i,n)rep(j,m)if(!M[i][j])
AddEdge(i,j+n,1);
}
bool vis[maxv]={};
int dfs(int no,int m)
{
if(no==vt)return m;
vis[no]=true;
for(Edge*e=E[no];e;e=e->next)if(!vis[e->t]&&e->c)
if(int d=dfs(e->t,min(m,e->c)))
return e->c-=d,e->op->c+=d,d;
return 0;
}
int CalFlow()
{
int flow=0;
do
{
memset(vis,0,sizeof vis);
int d=dfs(vs,inf);
if(d)flow+=d;
else break;
}while(1);
return flow;
}
int main()
{
\/\/freopen("in","r",stdin);
Init();
BuildGraph();
cout<<ans-CalFlow()<<endl;
} <\/p>\n","protected":false},"excerpt":{"rendered":"\u58eb\u5175\u5360\u9886 Time Limit:10000MS Memory Limit:65536KTotal Submit:48 Accepted:32 Case Time Limit:1000MS Description \u6709\u4e00\u4e2aM * N\u7684\u68cb\u76d8\uff0c\u6709\u7684\u683c\u5b50\u662f\u969c\u788d\u3002\u73b0\u5728\u4f60\u8981\u9009\u62e9\u4e00\u4e9b\u683c\u5b50\u6765\u653e\u7f6e\u4e00\u4e9b\u58eb\u5175\uff0c\u4e00\u4e2a\u683c\u5b50\u91cc\u6700\u591a\u53ef\u4ee5\u653e\u7f6e\u4e00\u4e2a\u58eb\u5175\uff0c\u969c\u788d\u683c\u91cc\u4e0d\u80fd\u653e\u7f6e\u58eb\u5175\u3002\u6211\u4eec\u79f0\u8fd9\u4e9b\u58eb\u5175\u5360\u9886\u4e86\u6574\u4e2a\u68cb\u76d8 \u5f53\u6ee1\u8db3\u7b2ci\u884c\u81f3\u5c11\u653e\u7f6e\u4e86Li\u4e2a\u58eb\u5175, \u7b2cj\u5217\u81f3\u5c11\u653e\u7f6e\u4e86Cj\u4e2a\u58eb\u5175\u3002\u73b0\u5728\u4f60\u7684\u4efb\u52a1\u662f\u8981\u6c42\u4f7f\u7528\u6700\u5c11\u4e2a\u6570\u7684\u58eb\u5175\u6765\u5360\u9886\u6574\u4e2a\u68cb\u76d8\u3002 Input \u7b2c\u4e00\u884c\u4e24\u4e2a\u6570M, N, K\u5206\u522b\u8868\u793a\u68cb\u76d8\u7684\u884c\u6570\uff0c\u5217\u6570\u4ee5\u53ca\u58eb\u5175\u7684\u4e2a\u6570\u3002 \u7b2c\u4e8c\u884c\u6709M\u4e2a\u6570\u8868\u793aLi\u3002 \u7b2c\u4e09\u884c\u6709N\u4e2a\u6570\u8868\u793aCi\u3002 \u63a5\u4e0b\u6765\u6709K\u884c\uff0c\u6bcf\u884c\u4e24\u4e2a\u6570X, Y\u8868\u793a(X, Y)\u8fd9\u4e2a\u683c\u5b50\u662f\u969c\u788d\u3002 Output \u8f93\u51fa\u4e00\u4e2a\u6570\u8868\u793a\u6700\u5c11\u9700\u8981\u4f7f\u7528\u7684\u58eb\u5175\u4e2a\u6570\u3002\u5982\u679c\u65e0\u8bba\u653e\u7f6e\u591a\u5c11\u4e2a\u58eb\u5175\u90fd\u6ca1\u6709\u529e\u6cd5\u5360\u9886\u6574\u4e2a\u68cb\u76d8\uff0c\u8f93\u51fa\u201dJIONG!\u201d (\u4e0d\u542b\u5f15\u53f7) Sample Input 4 4 41 1 1 10 1 0 31 42 23 34 3 Sample Output 4\u6570\u636e\u8303\u56f4M, N <= 100, 0 <= K <= M * […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/358"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=358"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/358\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=358"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=358"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}