#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
vector<int>adj[300005];
int arr[300005];
multiset<pii>se[300005];
void dfs(int index){
for(auto it:adj[index]){
dfs(it);
if(se[index].size()<se[it].size()) swap(se[index],se[it]);
for(auto ii:se[it]) se[index].insert(ii);
}
//big small
int counter=arr[index];
int need=max(0LL,-arr[index]);
while(counter<0){
if(se[index].empty()) break;
//greedily take the smallest
pii hold=*se[index].begin();
se[index].erase(se[index].begin());
counter+=hold.second;
need=max(need,-counter+hold.first);
}
if(counter>=0){
//consuming
while(!se[index].empty()&&se[index].begin()->first<need){
counter+=se[index].begin()->second;
se[index].erase(se[index].begin());
}
se[index].insert({need,counter});
}
}
void solve(){
int n,m;
cin >> n >> m;
int temp,temp2;
for(int x=1;x<=n;x++){
cin >> temp >> temp2;
arr[x]=temp;
adj[temp2].push_back(x);
}
arr[0]=0;
dfs(0);
int cur=m;
for(auto it:se[0]){
assert(it.second>=0);
if(cur>=it.first) cur+=it.second;
}
cout << cur-m;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
//freopen("in.txt","r",stdin);
while(t--){
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
279 ms |
93520 KB |
Output is correct |
2 |
Correct |
263 ms |
67976 KB |
Output is correct |
3 |
Correct |
195 ms |
50172 KB |
Output is correct |
4 |
Correct |
130 ms |
52048 KB |
Output is correct |
5 |
Correct |
99 ms |
59688 KB |
Output is correct |
6 |
Correct |
140 ms |
61920 KB |
Output is correct |
7 |
Correct |
241 ms |
76472 KB |
Output is correct |
8 |
Correct |
185 ms |
50116 KB |
Output is correct |
9 |
Correct |
117 ms |
57684 KB |
Output is correct |
10 |
Correct |
91 ms |
60496 KB |
Output is correct |
11 |
Correct |
310 ms |
100096 KB |
Output is correct |
12 |
Correct |
231 ms |
84304 KB |
Output is correct |
13 |
Correct |
245 ms |
88912 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
23896 KB |
Output is correct |
2 |
Correct |
4 ms |
23900 KB |
Output is correct |
3 |
Correct |
4 ms |
23900 KB |
Output is correct |
4 |
Correct |
6 ms |
23900 KB |
Output is correct |
5 |
Correct |
4 ms |
24156 KB |
Output is correct |
6 |
Correct |
4 ms |
24156 KB |
Output is correct |
7 |
Correct |
4 ms |
23900 KB |
Output is correct |
8 |
Correct |
4 ms |
23900 KB |
Output is correct |
9 |
Correct |
5 ms |
23900 KB |
Output is correct |
10 |
Incorrect |
4 ms |
23900 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
23896 KB |
Output is correct |
2 |
Correct |
4 ms |
23900 KB |
Output is correct |
3 |
Correct |
4 ms |
23900 KB |
Output is correct |
4 |
Correct |
6 ms |
23900 KB |
Output is correct |
5 |
Correct |
4 ms |
24156 KB |
Output is correct |
6 |
Correct |
4 ms |
24156 KB |
Output is correct |
7 |
Correct |
4 ms |
23900 KB |
Output is correct |
8 |
Correct |
4 ms |
23900 KB |
Output is correct |
9 |
Correct |
5 ms |
23900 KB |
Output is correct |
10 |
Incorrect |
4 ms |
23900 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
23896 KB |
Output is correct |
2 |
Correct |
4 ms |
23900 KB |
Output is correct |
3 |
Correct |
4 ms |
23900 KB |
Output is correct |
4 |
Correct |
6 ms |
23900 KB |
Output is correct |
5 |
Correct |
4 ms |
24156 KB |
Output is correct |
6 |
Correct |
4 ms |
24156 KB |
Output is correct |
7 |
Correct |
4 ms |
23900 KB |
Output is correct |
8 |
Correct |
4 ms |
23900 KB |
Output is correct |
9 |
Correct |
5 ms |
23900 KB |
Output is correct |
10 |
Incorrect |
4 ms |
23900 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
279 ms |
93520 KB |
Output is correct |
2 |
Correct |
263 ms |
67976 KB |
Output is correct |
3 |
Correct |
195 ms |
50172 KB |
Output is correct |
4 |
Correct |
130 ms |
52048 KB |
Output is correct |
5 |
Correct |
99 ms |
59688 KB |
Output is correct |
6 |
Correct |
140 ms |
61920 KB |
Output is correct |
7 |
Correct |
241 ms |
76472 KB |
Output is correct |
8 |
Correct |
185 ms |
50116 KB |
Output is correct |
9 |
Correct |
117 ms |
57684 KB |
Output is correct |
10 |
Correct |
91 ms |
60496 KB |
Output is correct |
11 |
Correct |
310 ms |
100096 KB |
Output is correct |
12 |
Correct |
231 ms |
84304 KB |
Output is correct |
13 |
Correct |
245 ms |
88912 KB |
Output is correct |
14 |
Correct |
4 ms |
23896 KB |
Output is correct |
15 |
Correct |
4 ms |
23900 KB |
Output is correct |
16 |
Correct |
4 ms |
23900 KB |
Output is correct |
17 |
Correct |
6 ms |
23900 KB |
Output is correct |
18 |
Correct |
4 ms |
24156 KB |
Output is correct |
19 |
Correct |
4 ms |
24156 KB |
Output is correct |
20 |
Correct |
4 ms |
23900 KB |
Output is correct |
21 |
Correct |
4 ms |
23900 KB |
Output is correct |
22 |
Correct |
5 ms |
23900 KB |
Output is correct |
23 |
Incorrect |
4 ms |
23900 KB |
Output isn't correct |
24 |
Halted |
0 ms |
0 KB |
- |