Submission #98269

#	Time	Username	Problem	Language	Result	Execution time	Memory
98269		dalgerok	Mag (COCI16_mag)	C++17	24 / 120	549 ms	138460 KiB

mag

#include<bits/stdc++.h>
using namespace std;



const int N = 1e6 + 5;



int n, a[N], dp[N], ans = -1;
vector < int > g[N];


void dfs(int v, int pr = -1){
    int mx1 = 0, mx2 = 0;
    for(int to : g[v]){
        if(to != pr){
            dfs(to, v);
            if(dp[to] > mx1){
                mx2 = mx1;
                mx1 = dp[to];
            }
            else if(dp[to] > mx2){
                mx2 = dp[to];
            }
        }
    }
    if(a[v] == 1){
        dp[v] = mx1 + 1;
        ans = max(ans, mx1 + mx2 + 1);
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1; i < n; i++){
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    ans = -1;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i] == 1){
            ans = 1;
        }
    }
    dfs(1);
    if(ans != -1){
        return cout << "1/" << ans, 0;
    }
    ans = 2e9;
    for(int i = 1; i <= n; i++){
        ans = min(ans, a[i]);
    }
    cout << ans << "/1";
}

• 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