Codeforces Round #660 (Div. 2) D (拓扑排序，递归写法）

https://codeforces.com/contest/1388/problem/D

思路

使用拓扑排序，递归写的拓扑排序速度和空间开销较大，时间大约2倍，空间6倍多，有风险，但是代码简单，可以借鉴。故意卡数据的不存在。

代码

// 递归代码
#include<bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false) , std::cin.tie(0) , std::cout.tie(0)
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define ll long long
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
int b[N],vis[N];
vector<int> vec,G1[N],G2[N];
ll ans,a[N];
void solve(int u,int s){
	if (s == 1){//入度=0 
		if (a[u] >= 0){
			ans += a[u], vis[u] = 1, vec.pb(u);
			for (auto it:G1[u]) a[it] += a[u], solve(it,2);
		}
		else{
			vis[u] = 1; 
			for (auto it:G1[u]) solve(it,2);
			ans += a[u], vec.pb(u);
		}
	}
	else{		
		int flag = 1;
		for (auto it:G2[u]) 
			if (!vis[it]) flag = 0, solve(it,2); //入度>0 
		if (flag) solve(u,1); //入度=0
	}
}
int main()
{
	int n;
	cin >> n;
	rep(i,1,n) cin >> a[i];
	rep(i,1,n){
		cin >> b[i];
		if (b[i] == -1) continue;
		G1[i].pb(b[i]);// 出 
		G2[b[i]].pb(i);// 入 
	}
	rep(i,1,n){
		int len = G2[i].size();
		if (!vis[i] && !len) solve(i,2); //入度=0
	}
	cout << ans << "\n";
	for (auto it:vec) cout << it << " ";
    return 0;
}

// 常规代码
#include<bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false) , std::cin.tie(0) , std::cout.tie(0)
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define ll long long
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
int b[N],indu[N],res[N],cnt;
ll a[N],ans;
int main()
{
	int n;
	cin >> n;
	rep(i,1,n) cin >> a[i];
	rep(i,1,n){
		cin >> b[i];
		if (b[i] != -1){
			indu[b[i]]++;
		}
	}
	queue<int> q;
	stack<int> s;
	rep(i,1,n){
		if (!indu[i]) q.push(i);
	}
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		ans += a[u];
		if (a[u] < 0){
			s.push(u);
			indu[b[u]]--;
			if (!indu[b[u]]) q.push(b[u]);
			continue;
		}
		else if (b[u] != -1){
			a[b[u]] += a[u];
			indu[b[u]]--;
			if (!indu[b[u]]) q.push(b[u]);
		}
		res[++cnt] = u;
	}
	cout << ans << "\n";
	rep(i,1,cnt) cout << res[i] << " ";
	while(!s.empty()){
		cout << s.top() << " ";
		s.pop();
	}
    return 0;
}