oj.uz

답안 #442037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442037 2021-07-06T20:01:13 Z CSQ31 Džumbus (COCI19_dzumbus) C++17
110 / 110
 70 ms 38888 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 2000;
vii adj(MAXN);
vector<ll>d(MAXN);
vector<int>vis(MAXN),sub(MAXN);

ll dp[3][MAXN][MAXN];
//v not taken,v taken
int cursz = 0;
void dfs(int v,int u){
	sub[v] = 1;
	vis[v] = 1;
	dp[0][v][0] = 0;
	dp[2][v][0] = d[v];
	for(int x:adj[v]){
		if(x != u){
			dfs(x,v);
			sub[v]+=sub[x];
		}
	}
	int cur = 1;
	for(int x:adj[v]){
		if(x == u)continue;
		for(int i=cur;i>=0;i--){
			for(int j=0;j<=sub[x];j++){
				if(j+i > sub[x]+cur)break;
				dp[0][v][i+j] = min(dp[0][v][i+j],dp[0][v][i]+min({dp[0][x][j],dp[1][x][j],dp[2][x][j]})); 
				dp[2][v][i+j] = min(dp[2][v][i+j],dp[2][v][i]+dp[0][x][j]);
				dp[1][v][i+j] = min(dp[1][v][i+j],dp[1][v][i] + min(dp[0][x][j],dp[1][x][j])); //v already isnt a singleton
				//v is a singleton
				if(i+j+1<=sub[x]+cur)dp[1][v][i+j+1] = min(dp[1][v][i+j+1], min(dp[2][v][i]+dp[1][x][j],dp[1][v][i]+dp[2][x][j]));
				if(i+j+2<=sub[x]+cur)dp[1][v][i+j+2] = min(dp[1][v][i+j+2],dp[2][v][i] + dp[2][x][j]);
			}
		}
		cur+=sub[x];
		//cout<<"meow"<<'\n';
		//for(int i=0;i<=3;i++)cout<<dp[0][1][i]<<" "<<dp[1][1][i]<<" "<<dp[2][1][i]<<'\n';
	}
	
}
int main()
{
	owo
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>d[i];
	for(int i=0;i<m;i++){
		int v,u;
		cin>>v>>u;
		adj[v].pb(u);
		adj[u].pb(v);
	}
	vector<ll>dp2(n+1,INF);
	dp2[0] = 0;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=n;j++){
			dp[0][i][j] = dp[1][i][j] = dp[2][i][j] = INF;
		}
	}
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			dfs(i,0);
			for(int j=cursz;j>=0;j--){
				for(int k=0;k<=sub[i];k++)dp2[j+k] = min(dp2[j+k],dp2[j] + min(dp[0][i][k],dp[1][i][k]));
			}
			cursz+=sub[i];
		}
		
	}
	vector<PII>a;
	for(int i=0;i<=n;i++)a.pb({dp2[i],i});
	sort(all(a));
	vector<int>mx(n+1,0);
	for(int i=0;i<=n;i++){
		mx[i] = a[i].se;
		if(i)mx[i] = max(mx[i],mx[i-1]);
	}
	int q;
	cin>>q;
	while(q--){
		ll s;
		cin>>s;
		int p = ub(all(a),make_pair(s*1LL,INF)) - a.begin();
		cout<<mx[p-1]<<'\n';
		
	}
	
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 36172 KB Output is correct
2 Correct 24 ms 36268 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 36172 KB Output is correct
2 Correct 24 ms 36268 KB Output is correct
3 Correct 69 ms 37148 KB Output is correct
4 Correct 70 ms 37092 KB Output is correct
5 Correct 68 ms 36696 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 2628 KB Output is correct
2 Correct 43 ms 2392 KB Output is correct
3 Correct 46 ms 4220 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 36172 KB Output is correct
2 Correct 24 ms 36268 KB Output is correct
3 Correct 69 ms 37148 KB Output is correct
4 Correct 70 ms 37092 KB Output is correct
5 Correct 68 ms 36696 KB Output is correct
6 Correct 41 ms 2628 KB Output is correct
7 Correct 43 ms 2392 KB Output is correct
8 Correct 46 ms 4220 KB Output is correct
9 Correct 61 ms 38296 KB Output is correct
10 Correct 70 ms 38888 KB Output is correct
11 Correct 65 ms 38660 KB Output is correct