제출 #1086548

#제출 시각아이디문제언어결과실행 시간메모리
1086548IBoryJobs (BOI24_jobs)C++17
14 / 100
2057 ms27476 KiB
#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const int MAX = 300003;
vector<int> G[MAX];
ll S[MAX], P[MAX], V[MAX];

pii DFS(int cur, int prev, ll lim, ll down, ll up) {
	pii ret = {-1, cur};
	if (!V[cur] && -down <= lim) ret = max(ret, pii{up, cur});
	for (int next : G[cur]) {
		if (next == prev) continue;
		ret = max(ret, DFS(next, cur, lim, min(down, up + S[next]), up + S[next]));
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	ll N, init;
	cin >> N >> init;
	for (int i = 1; i <= N; ++i) {
		cin >> S[i] >> P[i];
		G[P[i]].push_back(i);
	}

	V[0] = 1;
	ll ans = init, cnt = 0;
	while (1) {
		auto [val, cur] = DFS(0, 0, ans, 0, S[0]);
		if (val < 0) break;

		ans += val;
		while (cur && !V[cur]) {
			V[cur] = 1;
			S[cur] = 0;
			cur = P[cur];
		}
	}

	cout << ans - init;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:30:17: warning: unused variable 'cnt' [-Wunused-variable]
   30 |  ll ans = init, cnt = 0;
      |                 ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...