| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 994687 | PenguinsAreCute | Jobs (BOI24_jobs) | C++17 | 156 ms | 29688 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 314159;
int pr[MAXN];
bool vis[MAXN];
vector<int> adj[MAXN];
vector<pair<int,int>> op;
void dfs(int x, int prof, int maxProf, int loss) {
vis[x]=1;
if(prof+pr[x]>maxProf) op.push_back({loss,prof+pr[x]-maxProf});
for(auto i: adj[x]) dfs(i,prof+pr[x],max(maxProf,prof+pr[x]),min(loss,prof+pr[x]));
}
main() {
int n, s, ans = 0; cin >> n >> s;
for(int i=1,p;i<=n;i++) {cin>>pr[i]>>p; adj[p].push_back(i);}
for(int i=1;i<=n;i++) if(!vis[i]) dfs(i,0,0,0);
sort(op.begin(),op.end(),greater<pair<int,int>>());
for(int i=0;i<op.size()&&op[i].first+s>=0;i++) s+=op[i].second,ans+=op[i].second;
cout << ans;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
