Submission #1115696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115696		dynam1c	Jobs (BOI24_jobs)	C++17	11 / 100	201 ms	30268 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ll n, s;
  cin >> n >> s;
  vector<vector<int>> graph(n);
  vector<int> val(n), up(n);
  for (int i = 0; i < n; i++) {
    cin >> val[i] >> up[i];
    if (up[i]--)
      graph[up[i]].push_back(i);
  }

  function<ll(int)> dfs = [&](int v) {
    ll best = val[v];
    for (auto ne : graph[v])
      best += dfs(ne);
    return max(0LL, best);
  };

  ll ans = 0;
  for (int i = 0; i < n; i++)
    if (up[i] == -1)
      ans += dfs(i);
  cout << ans << endl;
}

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