oj.uz

Submission #137674

# Submission time Handle Problem Language Result Execution time Memory
137674 2019-07-28T08:26:38 Z abacaba Mag (COCI16_mag) C++14
0 / 120
 879 ms 248472 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int inf = 2e18;
const int N = 2e6 + 15;
int n, m, a[N], dp[N], dpup[N], par[N];
vector <int> g[N];
pair <int, int> ans = make_pair(0LL, 0LL);
bool used[N];

void dfs(int v, int p = 0) {
    int now = 0;
    for(int to : g[v])
        if(p != to) {
            dfs(to, v);
            now = max(now, dp[to]);
        }
    pair <int, int> x = {a[v], dpup[p] + 1LL + now};
    int c = __gcd(x.first, x.second);
    if(c)
        x.first /= c, x.second /= c;
    if(ans == make_pair(0LL, 0LL) || x.first * ans.second < ans.first * x.second) {
        ans = x;
    }
}
 
void calc(int v, int p = 0) {
    par[v] = p;
    for(int to : g[v])
        if(to != p) {
            calc(to, v);
            if(a[v] == 1)
                dp[v] = max(dp[v], dp[to] + 1);
        }
}

void calc_up(int v, int p = -1, int now = 0) {
    dpup[v] = now + (a[v] == 1);
    multiset <int> cur = {};
    for(int to : g[v])
        if(to != p)
            cur.insert(dp[to]);
    if(a[v] != 1)
        now = 0;
    for(int to : g[v]) {
        if(to != p) {
            cur.erase(cur.find(dp[to]));
            calc_up(to, v, (a[v] == 1 ? max((cur.empty() ? 0 : *cur.rbegin()), now) + 1 : 0));
            cur.insert(dp[to]);
        }
    }
}

#undef int
 
int main() {
    #define int long long
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        pair <int, int> x = {a[i], 1LL};
        if(ans == make_pair(0LL, 0LL) || a[i] < ans.first)
            ans = x;
    }
    calc(1);
    calc_up(1);
    dfs(1);
    cout << ans.first << '/' << ans.second << endl;
    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47384 KB Output is correct
2 Incorrect 46 ms 47352 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 47452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 47352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 675 ms 113752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 879 ms 130228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 210 ms 55620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 665 ms 115684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 693 ms 115284 KB Output isn't correct
2 Halted 0 ms 0 KB -