[Codeforces 894E] Ralph and Mushrooms

题目链接： http://codeforces.com/problemset/problem/894/E

题目大意： 给出一个n个点m条有向边的有向图， 每条边上初始有$w_i$个蘑菇， 且当第i次经过该条边后， 蘑菇将在当前的数量上减少i， 直到为0。 先求从一个点s出发， 最多能获得的蘑菇数。$(n, m \leq 10^6, w_i \leq 10^8)$

思路：考虑在一个强连通分量内， 其中的每一条边一定可以被取完直到0为止， 这个可以通过数学式子计算出来。 考虑缩点后， 原图变成了DAG， 简单的Dp一下即可。

#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

#define ll long long

using namespace std;

const int N = (int)1e6 + 10;
const int M = (int)1e5 + 10;

int s, n, m, E[N][3];
int cnt, lst[N], to[N], nxt[N], w[N]; ll sum[M];

void add(int u, int v, int c){
    nxt[++ cnt] = lst[u]; lst[u] = cnt; to[cnt] = v; w[cnt] = c;
}

int indx, dfn[N], low[N];
int top, stk[N], instk[N], id[N]; ll val[N];

void tarjan(int u){
    dfn[u] = low[u] = ++ indx;
    stk[++ top] = u; instk[u] = 1;
    id[u] = u;
    for (int j = lst[u]; j; j = nxt[j]){
        int v = to[j];
        if (!dfn[v]){
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if (instk[v]) low[u] = min(low[u], dfn[v]);
    }

    if (low[u] == dfn[u]){
        while (stk[top] != u){
            id[stk[top]] = u;
            instk[stk[top]] = 0;
            top --;
        }
        instk[u] = 0;top --;
    }
}

bool vis[N]; ll f[N];

ll dfs(int u){
    if (vis[u]) return f[u];
    ll ret = 0; vis[u] = 1;
    for (int j = lst[u]; j; j = nxt[j]){
        int v = to[j];
        ret = max(ret, dfs(v) + w[j]);
    }
    return f[u] = ret + val[u];
}

int main(){
    scanf("%d%d", &n, &m);
    for (int i = 1, u, v, c; i <= m; i ++){
        scanf("%d%d%d", &u, &v, &c);
        E[i][0] = u, E[i][1] = v, E[i][2] = c;
        add(u, v, c);
    }

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

    cnt = 0;
    memset(lst, 0, sizeof(lst));

    for (int i = 1; i < M; i ++) sum[i] = sum[i - 1] + 1LL * i * (i + 1) / 2;

    for (int i = 1; i <= m; i ++){
        int u = E[i][0], v = E[i][1], c = E[i][2];
        if (id[u] == id[v]){
            int x = (int)floor((- 1.0 + sqrt(1.0 + 8 * c)) / 2);
            val[id[u]] += 1LL * (x + 1) * c - sum[x];
        }
        else add(id[u], id[v] , c);
    }

    scanf("%d", &s);
    printf("%lld\n", dfs(id[s]));

    return 0;
}