Submission #1065402

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065402		_rain_	Jobs (BOI24_jobs)	C++14	11 / 100	62 ms	23636 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
#define debug false

const int maxn = 3e5;
vector<int> graph[maxn+2];
int x[maxn+2] , p[maxn+2];
bool root[maxn+2];
int n;
i64 s;

i64 dfs(int u , int p , i64 sum){
	sum += x[u];
	if (sum < 0) return sum;
	for (auto& v : graph[u]){
		if (v!=p){
			sum = max(sum , dfs(v,u,sum));
		}
	}
	if (debug){
		cout << "( DEBUG )\n";
		cout << u << ' ' << sum << '\n';
	}
	return sum;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	
	cin >> n >> s;
	for (int i = 1; i <= n; ++i){
		cin >> x[i] >> p[i];
		if (p[i]==0) root[i] = true;
			else graph[p[i]].push_back(i);
	}
	i64 alter = s;
	for (int i = 1; i <= n; ++i){
		if (root[i])
			s = max(s , dfs(i,i,s));
	}
	cout << s - alter << '\n';
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31