Submission #1254947

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254947		EkinOnal	Džumbus (COCI19_dzumbus)	C++20	0 / 110	147 ms	32932 KiB

dzumbus

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#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 MAX 1000023
#define pb push_back
// #define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 998244353;
const int INF = 1e18+1;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;b>>=1;ans%=mod;a%=mod;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod)+mod)%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod)+mod)%mod;}
// typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
// typedef
// tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_multiset

vi adj[1005],sz(1005),val(1005);
vector<vector<array<int,3>>> dp(1005,vector<array<int,3>>(1005,{INF,INF,INF}));
void dfs(int node,int par){
	sz[node]=1;
	dp[node][0][1]=val[node]; dp[node][0][0]=0;
	for(auto u : adj[node]){
		if(u==par) continue;
		dfs(u,node);

		for(int i=sz[node];i>=0;i--){ // 0dan da baslamasi gerekebilir!!
			for(int j=0;j<=sz[u];j++){
				dp[node][i+j][0]=min(dp[node][i+j][0], dp[node][i][0] +min({dp[u][j][0],dp[u][j][1],dp[u][j][2]}) );
				dp[node][i+j][1]=min(dp[node][i+j][1], dp[node][i][1] + dp[u][j][0] );
				dp[node][i+j][2]=min({dp[node][i+j][2], dp[node][i][2] + dp[u][j][0], dp[node][i][2]+dp[u][j][2] });
				dp[node][i+j+1][2]=min({dp[node][i+j+1][2], dp[node][i][2]+dp[u][j][1] , dp[node][i][1]+dp[u][j][2]});
				dp[node][i+j+2][2]=min(dp[node][i+j+2][2], dp[node][i][1] + dp[u][j][1] );
			}
		}
		sz[node]+=sz[u];
	}
}	
	
	
void solve(){
	int n,m; cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>val[i];

	for(int i=1;i<=m;i++){
		int a,b; cin>>a>>b;
		adj[a].pb(b); adj[b].pb(a);
	}

	vi root;
	for(int i=1;i<=n;i++){
		if(!sz[i]) dfs(i,0),root.pb(i);
	}

	// vi ans(n+5,INF);
	// for(auto u : root){
	// 	for(int j=0;j<=sz[u];j++){
	// 		ans[j]=min({ans[j],dp[u][j][0], dp[u][j][1], dp[u][j][2]});
	// 	}
	// }	
	// for(int i=0;i<=4;i++) cout<<ans[i]<<endl;

	vector<vi> dp2(1005,vi(1005,INF));
	int len=1; dp2[0][0]=0;
	for(int k=0;k<root.size();k++){
		for(int i=len;i>=0;i--){
			dp2[k+1][i]=dp2[k][i];
			for(int j=0;j<=sz[root[k]];j++){
				int mn = min({dp[root[k]][j][0],dp[root[k]][j][1],dp[root[k]][j][2]});
				dp2[k+1][i+j]=min(dp2[k+1][i+j], dp2[k][i] + mn );
			}
		}
		len+=sz[root[k]];
	}	

	// for(int i=0;i<=n;i++) cout<<dp2[root.size()][i]<<endl;

	int q; cin>>q;
	while(q--){
		int a; cin>>a;

		int l=0,r=n;
		while(l<r){
			int mid=(l+r+1)>>1;

			if(dp2[root.size()][mid]<=a) l=mid;
			else r=mid-1;
		}
		cout<<l<<endl;
	}


}	
	
int32_t main(/*	int32_t argc, char* argv[]*/){
	std::ios_base::sync_with_stdio(0); std::cin.tie(0);	

	int t=1;
	// cin >> t;
	while (t--) solve();
 	
	return 0;
}	

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30