救一下求求了

附代码```cpp #include #include using namespace std; struct cs { long long q=0; int before=0; bool flag=false; }a[114514];

int n, cnt[114514]; //long long minn = 1e15; long long ans;

void t(int s,long long &minn ,int &f) { if (minn > a[s].q) { minn = a[s].q; f=s; } if (a[s].before != 0) t(a[s].before,minn,f); else return; }

int main() {

CPP

a[1].before = 0;
cin >> n;
for (int i = 2; i <= n; i++) {
	cin >> a[i].before;
	cnt[a[i].before]++;
}
for (int i = 1; i <= n; i++)cin >> a[i].q;

for (int i = 1; i <= n; i++) {
	if (cnt[i] == 0) {
		long long minn = 1e15;
		int f = 0;
		t(i,minn,f);
		if (a[f].flag != true) {
			ans += minn;
			a[f].flag = true;
		}
	}
	
}
cout << ans;
return 0;

}

CPP

讨论操作

回复

相关推荐

救一下求求了