Submission #415778

#	Time	Username	Problem	Language	Result	Execution time	Memory
415778		ngpin04	Džumbus (COCI19_dzumbus)	C++14	110 / 110	112 ms	12176 KiB

dzumbus

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 1e3 + 5; 
const int oo = 1e9 + 1;

vector <int> adj[N];

int dp[N][N][2][2];
int f[N][2][2];
int g[N][2][2];
int val[N];
int sz[N];
int a[N];
int n,m;

bool vis[N];

void mini(int &a, int b) {
	if (a > b) 
		a = b;
	if (a > oo)
		a = oo;
}

void dfs(int u, int p) {
	vis[u] = true;
	for (int v : adj[u]) 
		if (!vis[v])
			dfs(v, u);

	for (int i = 0; i <= n; i++)
	for (int j = 0; j < 2; j++)
	for (int k = 0; k < 2; k++)
		f[i][j][k] = g[i][j][k] = oo;

	f[0][0][0] = 0;
	f[0][1][0] = a[u];
	sz[u] = 1;
	for (int v : adj[u]) if (v != p) {
		for (int l = 0; l <= sz[u]; l++)
		for (int i = 0; i < 2; i++)
		for (int k = 0; k < 2; k++) 

		for (int r = 0; r <= sz[v]; r++) 
		for (int j = 0; j < 2; j++)
		for (int t = 0; t < 2; t++) {
			int node = l + r + (i & j) * (!k + !t);
			int used = k | (i & j);
			mini(g[node][i][used], f[l][i][k] + dp[v][r][j][t]);
		}

		sz[u] += sz[v];

		for (int l = 0; l <= sz[u]; l++)
		for (int i = 0; i < 2; i++)
		for (int j = 0; j < 2; j++) {
			f[l][i][j] = g[l][i][j];
			g[l][i][j] = oo;
		}
	}

	for (int i = 0; i <= sz[u]; i++)
	for (int j = 0; j < 2; j++)
	for (int k = 0; k < 2; k++)
		dp[u][i][j][k] = f[i][j][k];
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	for (int i = 1; i <= m; i++) {
		int u,v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	a[0] = oo;
	for (int i = 1; i <= n; i++) if (!vis[i]){
		dfs(i, -1);		
		adj[0].push_back(i);
	}
	dfs(0, -1);

	for (int i = n; i >= 0; i--) {	
		val[i] = oo;
		for (int j = 0; j < 2; j++)
		for (int k = 0; k < 2; k++)
			val[i] = min(val[i], dp[0][i][j][k]);
		if (i < m)
			val[i] = min(val[i], val[i + 1]);
	}


	int q; cin >> q;
	while (q--) {
		int x; cin >> x;
		int res = upper_bound(val, val + n + 1, x) - (val + 1);
		cout << res << "\n";
	}
	return 0;
}

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