제출 #1049887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049887		NeroZein	Jobs (BOI24_jobs)	C++17	14 / 100	26 ms	17756 KiB

Main

#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif

const int N = 1e5 + 5;

int x[N];
int p[N];
bool vis[N];
bool taken[N];
long long sum[N];
vector<int> g[N];
long long min_pref[N];

void dfs(int v) {
  vis[v] = true; 
  sum[v] += x[v];
  min_pref[v] = min(min_pref[v], sum[v]);
  for (int u : g[v]) {
    sum[u] = sum[v];
    min_pref[u] = min_pref[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);      
  }
  long long cur = s; 
  for (int rep = 0; rep < n; ++rep) {
    fill(vis + 1, vis + 1 + n, 0);
    for (int i = 1; i <= n; ++i) {
      if (!taken[i] && !vis[i]) {
        min_pref[i] = sum[i] = 0; 
        dfs(i); 
      }
    }
    for (int i = 1; i <= n; ++i) {
      if (!taken[i] && sum[i] > 0 && cur + min_pref[i] >= 0) {
        cur += sum[i];
        int v = i;
        while (v > 0) {
          taken[v] = true;
          v = p[v];
        }
        break; 
      }
    }
  }
  cout << cur - s << '\n';
  return 0;
}

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