FZU 1719

U 点击打开链接  连通图缩点

#include<stdio.h>
#include<string.h>
#include<stack>
#include<string>
#include<math.h>
#include<queue>
#include<set>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define LL long long
#define inf 199999999
#define N 3010
int low[N],dfn[N],belong[N],a[N],aa[N],In[N];
bool vis[N];
vector<int>edge1[N],edge2[N];
stack<int>s;
int Index,sum,cnt;
void init(int n)
{
    memset(low,0,sizeof(low));
    memset(dfn,0,sizeof(dfn));
    memset(belong,0,sizeof(belong));
    memset(vis,0,sizeof(vis));
    memset(a,127,sizeof(a));
    memset(aa,127,sizeof(aa));
    memset(In,0,sizeof(In));
    Index=sum=cnt=0;
    for(int i=1;i<=n;i++)
    {
        edge1[i].clear();
        edge2[i].clear();
    }
    while(!s.empty())s.pop();
}
void tarjan(int u)
{
    low[u]=dfn[u]=++Index;
    vis[u]=1;s.push(u);
    for(int i=0;i<edge1[u].size();i++)
    {
        int v=edge1[u][i];
        if(!dfn[v])
        {
            tarjan(v);
            low[u]=min(low[u],low[v]);
        }
        else if(vis[v])
            low[u]=min(low[u],dfn[v]);
    }
    if(low[u]==dfn[u])
    {
        cnt++;
        while(1)
        {
            int v=s.top();
            s.pop();
            vis[v]=0;
            belong[v]=cnt;
            if(v==u) break;
        }
    }
}
int main()
{
    int i,j,n,m,u,v;
    while(scanf("%d",&n)!=-1)
    {
        init(n);
        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            scanf("%d%d",&u,&v);
            a[u]=v;
        }
        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            scanf("%d%d",&u,&v);
            edge1[u].push_back(v);
        }
        for(i=1;i<=n;i++)
        {
            if(!dfn[i])
                tarjan(i);
        }
        for(i=1;i<=n;i++)
            aa[belong[i]]=min(aa[belong[i]],a[i]);
        for(u=1;u<=n;u++)
        {
            for(i=0;i<edge1[u].size();i++)
            {
                v=edge1[u][i];
                if(belong[u]!=belong[v])
                {
                    edge2[belong[u]].push_back(belong[v]);
                    In[belong[v]]++;
                }
            }
        }
        for(i=1;i<=n;i++)
        {
            if(In[belong[i]]==0)
            {
                if(aa[belong[i]]>=inf)
                    break;
            }
        }
        if(i<=n){printf("NO\n%d\n",i);continue;}
        for(i=1;i<=cnt;i++)
            if(In[i]==0)
                sum+=aa[i];
        printf("YES\n%d\n",sum);
    }
    return 0;
}