oj.uz

Submission #995141

# Submission time Handle Problem Language Result Execution time Memory
995141 2024-06-08T13:50:21 Z LCJLY Jobs (BOI24_jobs) C++14
11 / 100
 288 ms 100180 KB 
#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]){
		if(it.first<=cur) 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();
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 93520 KB Output is correct
2 Correct 232 ms 68244 KB Output is correct
3 Correct 175 ms 50168 KB Output is correct
4 Correct 111 ms 52052 KB Output is correct
5 Correct 122 ms 59752 KB Output is correct
6 Correct 143 ms 62036 KB Output is correct
7 Correct 216 ms 76372 KB Output is correct
8 Correct 180 ms 50168 KB Output is correct
9 Correct 100 ms 57680 KB Output is correct
10 Correct 93 ms 60344 KB Output is correct
11 Correct 288 ms 100180 KB Output is correct
12 Correct 214 ms 84304 KB Output is correct
13 Correct 245 ms 88916 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23900 KB Output is correct
2 Correct 4 ms 23900 KB Output is correct
3 Correct 5 ms 23896 KB Output is correct
4 Correct 5 ms 23900 KB Output is correct
5 Correct 4 ms 24156 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 23900 KB Output is correct
8 Correct 5 ms 23900 KB Output is correct
9 Correct 4 ms 23900 KB Output is correct
10 Incorrect 5 ms 23900 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23900 KB Output is correct
2 Correct 4 ms 23900 KB Output is correct
3 Correct 5 ms 23896 KB Output is correct
4 Correct 5 ms 23900 KB Output is correct
5 Correct 4 ms 24156 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 23900 KB Output is correct
8 Correct 5 ms 23900 KB Output is correct
9 Correct 4 ms 23900 KB Output is correct
10 Incorrect 5 ms 23900 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 23900 KB Output is correct
2 Correct 4 ms 23900 KB Output is correct
3 Correct 5 ms 23896 KB Output is correct
4 Correct 5 ms 23900 KB Output is correct
5 Correct 4 ms 24156 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 23900 KB Output is correct
8 Correct 5 ms 23900 KB Output is correct
9 Correct 4 ms 23900 KB Output is correct
10 Incorrect 5 ms 23900 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 93520 KB Output is correct
2 Correct 232 ms 68244 KB Output is correct
3 Correct 175 ms 50168 KB Output is correct
4 Correct 111 ms 52052 KB Output is correct
5 Correct 122 ms 59752 KB Output is correct
6 Correct 143 ms 62036 KB Output is correct
7 Correct 216 ms 76372 KB Output is correct
8 Correct 180 ms 50168 KB Output is correct
9 Correct 100 ms 57680 KB Output is correct
10 Correct 93 ms 60344 KB Output is correct
11 Correct 288 ms 100180 KB Output is correct
12 Correct 214 ms 84304 KB Output is correct
13 Correct 245 ms 88916 KB Output is correct
14 Correct 4 ms 23900 KB Output is correct
15 Correct 4 ms 23900 KB Output is correct
16 Correct 5 ms 23896 KB Output is correct
17 Correct 5 ms 23900 KB Output is correct
18 Correct 4 ms 24156 KB Output is correct
19 Correct 5 ms 24156 KB Output is correct
20 Correct 5 ms 23900 KB Output is correct
21 Correct 5 ms 23900 KB Output is correct
22 Correct 4 ms 23900 KB Output is correct
23 Incorrect 5 ms 23900 KB Output isn't correct
24 Halted 0 ms 0 KB -