Submission #123660

#	Time	Username	Problem	Language	Result	Execution time	Memory
123660		shashwatchandra	Paprike (COI18_paprike)	C++17	100 / 100	80 ms	19576 KiB

paprike

/*input
6 9
5 4 1 3 3 3
3 1
3 5
4 3
4 2
2 6
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 1e5+1;
vector<int> adj[N];
int a[N];
int n,k;

pair<int,int> dfs(int u,int p){
	int suma = a[u];
	int rem = 0;
	vector<int> childs;

	for(int v:adj[u]){
		if(v == p)continue;
		pair<int,int> temp = dfs(v,u);
		childs.pb(temp.f);
		rem += temp.s;
		rem++;
	}
	sort(all(childs));
	REP(i,childs.size()){
		if(suma+childs[i] <= k){suma+=childs[i];rem--;}
		else return {suma,rem};
	}
	return {suma,rem};
}

void solve(){
  	cin >> n >> k;
  	RE(i,n)cin >> a[i];
  	RE(i,n-1){
  		int x,y;cin >> x >> y;
  		adj[x].pb(y);
  		adj[y].pb(x);
  	}
  	cout << dfs(1,1).s;
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 27 / 27
• Subtask 4: 49 / 49