oj.uz

Submission #705327

# Submission time Handle Problem Language Result Execution time Memory
705327 2023-03-04T01:59:37 Z willychan Džumbus (COCI19_dzumbus) C++14
110 / 110
 710 ms 19060 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
#define INF 1e16
const int N = 1005; 
int n;

struct node{
	ll v[N][2];
	int sz = 1;
	node(void){
		for(int i=0;i<=1000;i++){
			v[i][0]=INF;
			v[i][1] =INF;
		}
		v[0][0]=0;
	}
	ll w=0;
	void print(){
	for(int i=0;i<=n;i++){
		cout<<v[i][0]<<" ";
	}
	cout<<"\n";
	for(int i=0;i<=n;i++){
		cout<<v[i][1]<<" ";
	}
	cout<<"\n---------------\n";
	}
};


void combine(node &a,node &b){	
	node r;
	r.w = a.w;
	a.sz = a.sz+b.sz;
	for(int i=0;i<=a.sz;i++){
		for(int j=0;j<=i;j++){
			r.v[i][1] = min(r.v[i][1],a.v[j][1]+b.v[i-j][0]);
			r.v[i][0] = min(r.v[i][0],a.v[j][0]+b.v[i-j][1]);
			r.v[i][1] = min(r.v[i][1],a.v[j][1]+b.v[i-j][1]);
			r.v[i][0] = min(r.v[i][0],a.v[j][0]+b.v[i-j][0]);
			if(j!=i) r.v[i][1] = min(r.v[i][1],a.v[j][1]+b.v[i-j-1][0]+b.w);
			if(j!=i) r.v[i][1] = min(r.v[i][1],a.v[j][0]+b.v[i-j-1][1]+a.w);
			if(i-j>=2) r.v[i][1] = min(r.v[i][1],a.v[j][0]+b.v[i-j-2][0]+a.w+b.w);
		}
	}
	for(int i=0;i<=n;i++){
		a.v[i][0] = r.v[i][0];
		a.v[i][1] = r.v[i][1];
	}
}



node dp[N];
vector<int> side[N];
int m;

bool vis[N];
void dfs(int cur,int p){
	vis[cur]=1;
	for(auto i : side[cur]){
		if(!vis[i]){
			dfs(i,cur);
			combine(dp[cur],dp[i]);
		}
	}
	/*cout<<cur<<":\n";
	dp[cur].print();
	*/
}


int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;				
	for(int i=1;i<=n;i++) cin>>dp[i].w;
	for(int i=0;i<m;i++){
		int a,b;cin>>a>>b;
		side[a].push_back(b);
		side[b].push_back(a);
	}
	node ans;
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			dfs(i,0);
			combine(ans,dp[i]);
		}
	}
	vector<ll> k(n+1,0);
	for(int i=0;i<=n;i++){
		k[i] = ans.v[i][0];
	}
	for(int i=n-1;i>=0;i--){
		k[i] = min(k[i],k[i+1]);
	}
	int q;cin>>q;
	while(q--){
		int s;cin>>s;
		cout<<upper_bound(k.begin(),k.end(),s)-k.begin()-1<<"\n";
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 16264 KB Output is correct
2 Correct 514 ms 16292 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 16264 KB Output is correct
2 Correct 514 ms 16292 KB Output is correct
3 Correct 679 ms 18440 KB Output is correct
4 Correct 368 ms 19060 KB Output is correct
5 Correct 331 ms 18672 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 16964 KB Output is correct
2 Correct 37 ms 16796 KB Output is correct
3 Correct 44 ms 16508 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 16264 KB Output is correct
2 Correct 514 ms 16292 KB Output is correct
3 Correct 679 ms 18440 KB Output is correct
4 Correct 368 ms 19060 KB Output is correct
5 Correct 331 ms 18672 KB Output is correct
6 Correct 40 ms 16964 KB Output is correct
7 Correct 37 ms 16796 KB Output is correct
8 Correct 44 ms 16508 KB Output is correct
9 Correct 110 ms 18248 KB Output is correct
10 Correct 392 ms 18880 KB Output is correct
11 Correct 710 ms 18620 KB Output is correct