oj.uz

Submission #46501

# Submission time Handle Problem Language Result Execution time Memory
46501 2018-04-21T05:03:53 Z RockyB Chase (CEOI17_chase) C++17
20 / 100
 4000 ms 17616 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

#define int ll

int n, k;
int a[N];
vector <int> g[N];

vector < vector <int> > all;
vector <int> cur;


int rec(int v, int cnt, int x, vector <int> &cur) {
	if (v == sz(cur)) {
		int y = 0;
		for (auto it : cur) y += a[it];
		return abs(x - y);
	}

	int res = 0;
	x += a[cur[v]];
	res = max(res, rec(v + 1, cnt, x, cur));

	if (cnt < k) {
		vector <int> sve;
		int in = a[cur[v]];
		for (auto to : g[cur[v]]) {
			sve.pb(a[to]);
			a[cur[v]] += a[to];
			a[to] = 0;
		}
		res = max(res, rec(v + 1, cnt + 1, x, cur));
		for (int i = 0; i < sz(g[cur[v]]); i++) {
			a[g[cur[v]][i]] = sve[i];
		}	
		a[cur[v]] = in;
	}
	return res;
}
int ans;
void dfs(int v, int p = -1) {
	cur.pb(v);
	ans = max(ans, rec(0, 0, 0, cur));
	if (clock() / (double)CLOCKS_PER_SEC > 3.9) cout << ans, ioi
	for (auto to : g[v]) {
		if (to != p) {
			dfs(to, v);
		}
	}
	cur.pp();
}
int32_t main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i < n; i++) {
		int v, u;
		cin >> v >> u;
		g[v].pb(u);
		g[u].pb(v);
	}
	for (int i = 1; i <= n; i++) {
		dfs(i);
	}
	cout << ans;
	ioi
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12268 KB Output is correct
3 Correct 12 ms 12268 KB Output is correct
4 Correct 12 ms 12268 KB Output is correct
5 Correct 12 ms 12268 KB Output is correct
6 Correct 12 ms 12268 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12268 KB Output is correct
3 Correct 12 ms 12268 KB Output is correct
4 Correct 12 ms 12268 KB Output is correct
5 Correct 12 ms 12268 KB Output is correct
6 Correct 12 ms 12268 KB Output is correct
7 Execution timed out 4022 ms 12384 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4030 ms 17616 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12268 KB Output is correct
3 Correct 12 ms 12268 KB Output is correct
4 Correct 12 ms 12268 KB Output is correct
5 Correct 12 ms 12268 KB Output is correct
6 Correct 12 ms 12268 KB Output is correct
7 Execution timed out 4022 ms 12384 KB Time limit exceeded
8 Halted 0 ms 0 KB -