一本通1517：间谍网络

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int maxn = 3020;
const int mo = 1000000007;

int read() {
    int x = 0, f = 1;
    char ch = getchar();

    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;

        ch = getchar();
    }

    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }

    return x * f;
}

int n, pp, r, id[maxn], v[100010], ans;
int vv[maxn], dfn[maxn], low[maxn], sum, st[maxn], top, c[maxn], scc, vis[maxn], ind[maxn], p[maxn];
int head[maxn], tot;
struct E {
    int to, nxt;
} e[maxn * 3];

void add(int x, int y) {
    e[++tot].nxt = head[x];
    e[tot].to = y;
    head[x] = tot;
    return ;
}

void dfs(int x) {
    vv[x] = 1;

    for (int i = head[x]; i; i = e[i].nxt) {
        int y = e[i].to;

        if (!vv[y])
            dfs(y);
    }

    return ;
}

void tarjan(int x) {
    dfn[x] = low[x] = ++sum;
    st[++top] = x;
    vis[x] = 1;

    for (int i = head[x]; i; i = e[i].nxt) {
        int y = e[i].to;

        if (!dfn[y]) {
            tarjan(y);
            low[x] = min(low[x], low[y]);
        } else if (vis[y])
            low[x] = min(low[x], dfn[y]);
    }

    if (dfn[x] == low[x]) {
        scc++;
        int cnt = 2e9;

        for (int z = 0; z != x; top--) {
            z = st[top];
            vis[z] = 0;
            c[z] = scc;

            if (v[z] != 0)
                cnt = min(cnt, v[z]);
        }

        p[scc] = cnt;
    }

    return ;
}

signed main() {
    n = read();
    pp = read();

    for (int i = 1; i <= pp; i++) {
        id[i] = read();
        v[id[i]] = read();
    }

    r = read();

    for (int i = 1; i <= r; i++) {
        int u = read(), vvv = read();

        if (u != vvv)
            add(u, vvv);
    }

    for (int i = 1; i <= pp; i++)
        if (!vv[id[i]])
            dfs(id[i]);

    for (int i = 1; i <= n; i++) {
        if (!vv[i]) {
            printf("NO\n%lld\n", i);
            return 0;
        }
    }

    for (int i = 1; i <= n; i++)
        if (!dfn[i])
            tarjan(i);

    for (int x = 1; x <= n; x++) {
        for (int i = head[x]; i; i = e[i].nxt) {
            int y = e[i].to;

            if (c[x] != c[y])
                ind[c[y]]++;
        }
    }

    for (int i = 1; i <= scc; i++)
        if (!ind[i])
            ans += p[i];

    printf("YES\n%lld\n", ans);
    return 0;
}