제출 #1050084

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050084		NeroZein	Jobs (BOI24_jobs)	C++17	29 / 100	84 ms	69572 KiB

Main

#include "bits/stdc++.h"
using namespace std;
 
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
 
const int N = 3e5 + 5;
 
int x[N];
int p[N];
vector<int> g[N];
long long sum[N];
long long need[N];
long long nrsum[N];
long long min_suf[N];
vector<pair<long long, long long>> vec;
 
void dfs(int v) {
  sum[v] += x[v];
  nrsum[v] += x[v];
  min_suf[v] = min(0LL, min_suf[v] + x[v]);
  need[v] = min(need[v], min_suf[v]);
  if (nrsum[v] > 0) {
    vec.push_back({-need[v], nrsum[v]});
  }
  for (int u : g[v]) {
    sum[u] = sum[v];
    nrsum[u] = min(0LL, nrsum[v]);
    min_suf[u] = min_suf[v];
    need[u] = need[v];
    dfs(u);
  }
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  long long s;
  cin >> n >> s;
  for (int i = 1; i <= n; ++i) {
    cin >> x[i] >> p[i];
    g[p[i]].push_back(i);
  }
  for (int i = 1; i <= n; ++i) {
    if (p[i] == 0) {
      dfs(i); 
    }
  }
  sort(vec.begin(), vec.end());
  long long cur = s; 
  for (auto [needed, profit] : vec) {
    if (cur >= needed) {
      cur += profit;
    }
  }
  cout << cur - s << '\n';
  return 0;
}

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