Submission #133429

#	Time	Username	Problem	Language	Result	Execution time	Memory
133429		tdwn	Mag (COCI16_mag)	C++17	24 / 120	1743 ms	176596 KiB

mag

#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 1000100;
vector<int>g[maxn];
ll arr[maxn], n;
ll dp[maxn], result;

void dfs(int node, int p) {
	vector<ll>v;
	for(int i:g[node]) {
		if(i != p) {
			dfs(i, node);

			if(arr[node] == 1 && arr[i] == 1) {
				v.pb(dp[i]);
			}
		}
	}

	sort(v.rbegin(), v.rend());

	if(arr[node] != 1) return;

	if(v.size() == 0) {
		dp[node] = 1LL;
		result = max(result, dp[node]);
	}

	if(v.size() == 1) {
		dp[node] = 1 + v[0];
		result = max(result, dp[node]);
	}
	else if(v.size() > 1){
		dp[node] = 1 + v[0];
		result = max(result, v[0] + v[1] + 1);
	}
}

int main() {
	cin>>n;
	ll a, b;
	for(int i=0;i<n-1;i++) {
		cin>>a>>b;
		g[a].pb(b);
		g[b].pb(a);
	}

	ll minval = LLONG_MAX;
	for(int i=1;i<=n;i++) {
		cin>>arr[i];
		minval = min(minval, arr[i]);
	}

	if(minval != 1) {
		cout<<minval<<"/1\n";
	}
	else {
		dfs(1, -1);
		cout<<"1/"<<result<<"\n";
	}
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 12 / 12