ccf 201509-4 高速公路

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n, m;
int sta[10005], index;
int cnt;
int vis[10005];
int num, sum;;
class node {
public:
    vector<int> edge;
    int Ftime;//初次访问时间
    int rt;//环上的根节点，环上dfs最早访问的节点
};
node all[10005];
void tarian(int r) {
    all[r].Ftime = all[r].rt=++cnt;
    sta[++index] = r;
    vis[r] = 1;
    for (int i = 0; i < all[r].edge.size(); ++i) {
        if (!all[all[r].edge[i]].Ftime) {
            tarian(all[r].edge[i]);
            all[r].rt = min(all[r].rt, all[all[r].edge[i]].rt);
        }
        else if (vis[all[r].edge[i]]) all[r].rt = min(all[r].rt,all[all[r].edge[i]].rt);//在栈中则表示在一个环中
    }
    if (all[r].Ftime == all[r].rt) {//输出环上的节点
        num = 0;
        while(1){
            ++num;
            vis[sta[index]] = 0;//出栈
            if (r == sta[index--]) break;
        }
        sum += (num - 1)*num/2;
    }

}
int main() {
    cin >> n >> m;
    int a, b;
    while (m--) {
        cin >> a >> b;
        all[a].edge.push_back(b);
    }
    for (int i = 1; i <= n; ++i) {
        if (!all[i].Ftime) tarian(i);
    }
    cout << sum << endl;

}