Codeforces Round #791 (Div. 2)D. Toss a Coin to Your Graph...（二分+topo）

Codeforces Round #791 (Div. 2)D. Toss a Coin to Your Graph…（二分+topo）

链接
题意：给出一副有向图，给出$k$，要选择一个起点，走$k$步，让走过的路径上的最大值最小，输出
思路：显然，如果路径上环，则一定可以走$k$步，然后要看最长链是否满足$k$，于是我们可以二分最大值，然后建新图，做一次topo判断最长路和是否存在环。

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5+10;
int head[N], idx;
struct Edge{int to, nxt;}e[N << 1];
void add(int u, int v) {e[++idx].to = v, e[idx].nxt = head[u], head[u] = idx;}
struct edge{int u, v;}ee[N];
int can[N], din[N], dep[N], n, m, k, w[N];
bool check(int mid)
{
    for (int i = 1; i <= n; i++) {can[i] = 0; din[i] = 0; head[i] = 0; dep[i] = 0;} idx = 0;
    for (int i = 1; i <= n; i++) if (w[i] <= mid) can[i] = 1;
    for (int i = 1; i <= m; i++) {
        int u = ee[i].u, v = ee[i].v;
        if (can[u] && can[v]) {
            add(u, v); din[v]++;
        }
    }queue<int> Q;
    for (int i = 1; i <= n; i++) {
        if (can[i] && !din[i]) {Q.push(i); dep[i] = 1;}
    }int maxn = 0;
    while (!Q.empty()) {
        int u = Q.front(); Q.pop();
        for (int i = head[u]; i; i = e[i].nxt) {
            int v = e[i].to;
            din[v]--;
            dep[v] = max(dep[v], dep[u] + 1);
            maxn = max(dep[v], maxn);
            if (din[v] == 0) {
                Q.push(v);
            }
        }
    }
    if (maxn >= k) return true;
    for (int i = 1; i <= n; i++) {
        if (can[i] && din[i]) return true;
    }return false;
}

signed main()
{
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) cin >> w[i];
    if (k == 1) {
        cout << *max_element(w + 1, w + 1 + n); return 0;
    }
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        ee[i] = {u, v};
    }
    int l = 0, r = 1e18+1;
    int ans = -1;
    while (l < r) {
        int mid = l + r >> 1;
        if (check(mid)) {
            ans = mid; r = mid;
        }else l = mid + 1;
    }cout << ans << endl;
    return 0;
}