oj.uz

Submission #310604

# Submission time Handle Problem Language Result Execution time Memory
310604 2020-10-07T13:42:54 Z shivensinha4 Mag (COCI16_mag) C++17
108 / 120
 738 ms 257144 KB 
#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'

const int MXN = 1e6;
const ll INF = 1e15;
vi adj[MXN+1];
int val[MXN+1];
int chain[MXN+1];
int n;
pair<ll, ll> ans = {INF, 1};

void update(ll nu, ll de) {
	ll g = __gcd(nu, de);
	pair<ll, ll> temp = {nu/g, de/g};
	if (ans.first == INF) ans = temp;
	else {
		pair<ll, ll> pre = ans, pree = temp;
		//ll lcm = temp.second * (pre.second / __gcd(temp.second, pre.second));
		temp.first *= pre.second, pre.first *= temp.second;
		if (temp.first < pre.first) ans = pree;
	}
}


void dfs(int p, int parent) {
	for (int i: adj[p]) if (i != parent) {
		dfs(i, p);
		chain[p] = max(chain[p], chain[i]);
	}
	
	if (val[p] == 1) chain[p] += 1;
	else chain[p] = 0;
}


void dfs2(int p, int parent, int pval) {
	vi all, mx(2);
	all.push_back(pval);
	for (int i: adj[p]) if (i != parent) all.push_back(chain[i]);
	sort(all.begin(), all.end(), greater<int>());
	for_(i, 0, min((int) all.size(), 2)) mx[i] = all[i];
	
	update(val[p], mx[0]+mx[1]+1);
	
	for (auto i: adj[p]) if (i != parent) dfs2(i, p, val[p] == 1 ? pval+1 : 0);
}


int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n;
	for_(i, 0, n-1) {
		int a, b; cin >> a >> b;
		a -= 1; b -= 1;
		adj[a].push_back(b); adj[b].push_back(a);
	}
	for_(i, 0, n) cin >> val[i];
	
	dfs(0, 0);
	dfs2(0, 0, 0);
	cout << ans.first << "/" << ans.second << endl;

	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23936 KB Output is correct
2 Correct 16 ms 23936 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 533 ms 130296 KB Output isn't correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB Output is correct
2 Correct 738 ms 251128 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 715 ms 245460 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 63000 KB Output is correct
2 Correct 411 ms 53240 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 518 ms 67004 KB Output is correct
2 Correct 109 ms 28024 KB Output is correct
3 Correct 721 ms 257144 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 28152 KB Output is correct
2 Correct 571 ms 64504 KB Output is correct
3 Correct 489 ms 44212 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 63072 KB Output is correct
2 Correct 538 ms 62336 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 64248 KB Output is correct
2 Correct 481 ms 44152 KB Output is correct