제출 #1053507

#제출 시각아이디문제언어결과실행 시간메모리
1053507ApiramJobs (BOI24_jobs)C++14
0 / 100
112 ms26988 KiB
/* * author : Apiram * created: 11.08.2024 14:11:10 */ #include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); long long n,s;cin>>n>>s; vector<pair<long long,long long>>arr(n + 1); vector<vector<long long>>adj(n + 1); for (long long i = 1;i<=n;++i){ cin>>arr[i].first>>arr[i].second; adj[arr[i].second].push_back(i); } vector<pair<long long,long long>>pos; function<int(long long,long long,long long,long long)>dfs = [&](long long u,long long mn,long long cost,long long got){ int ans = 0; if (cost - got > 0){ pos.push_back({mn,cost - got}); got = cost; ans++; } for(auto x:adj[u]){ if (ans){ // got = cost; } ans += dfs(x,min(mn,cost + arr[x].first),cost + arr[x].first,got); } return ans; }; dfs(0,0,0,0); sort(pos.rbegin(),pos.rend()); long long k = s; for (auto x:pos){ cout<<x.first<<" "<<x.second<<'\n'; if (x.first + k < 0)continue; k+=x.second; } cout<<k - s<<'\n'; return 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...