# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1011704 |
2024-07-01T07:06:54 Z |
ttamx |
Jobs (BOI24_jobs) |
C++17 |
|
288 ms |
94036 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N=3e5+5;
int n;
ll s;
ll a[N];
vector<int> adj[N];
struct DP{
map<ll,ll> mp;
void insert(ll x,ll d){
mp[x]+=d;
auto it=mp.find(x);
if(it!=mp.begin())it--;
for(auto x=it,y=next(it);y!=mp.end()&&x->first+x->second>=y->first;y=mp.erase(y)){
x->second+=y->second;
}
}
int size(){
return mp.size();
}
void pop(ll x){
ll sum=0;
for(auto it=mp.begin();it!=mp.end()&&it->first<x;it=mp.erase(it)){
sum+=it->second;
}
insert(0,0);
insert(x,max(0LL,sum-x));
}
}dp[N];
void dfs(int u){
for(auto v:adj[u]){
dfs(v);
if(dp[v].size()>dp[u].size())swap(dp[u],dp[v]);
for(auto [x,y]:dp[v].mp)dp[u].insert(x,y);
}
if(a[u]>=0)dp[u].insert(0,a[u]);
else dp[u].pop(-a[u]);
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> s;
for(int i=1;i<=n;i++){
int p;
cin >> a[i] >> p;
adj[p].emplace_back(i);
}
dfs(0);
cout << prev(dp[0].mp.upper_bound(s))->second;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
288 ms |
94036 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
21592 KB |
Output is correct |
2 |
Correct |
7 ms |
21596 KB |
Output is correct |
3 |
Correct |
7 ms |
21524 KB |
Output is correct |
4 |
Incorrect |
8 ms |
21596 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
21592 KB |
Output is correct |
2 |
Correct |
7 ms |
21596 KB |
Output is correct |
3 |
Correct |
7 ms |
21524 KB |
Output is correct |
4 |
Incorrect |
8 ms |
21596 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
21592 KB |
Output is correct |
2 |
Correct |
7 ms |
21596 KB |
Output is correct |
3 |
Correct |
7 ms |
21524 KB |
Output is correct |
4 |
Incorrect |
8 ms |
21596 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
288 ms |
94036 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |