oj.uz

Submission #137696

# Submission time Handle Problem Language Result Execution time Memory
137696 2019-07-28T08:39:58 Z abacaba Mag (COCI16_mag) C++14
120 / 120
 888 ms 260452 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[v] + 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) {
    dp[v] = (a[v] == 1);
    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;
    multiset <int> cur = {};
    for(int to : g[v])
        if(to != p)
            cur.insert(dp[to]);
    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
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47484 KB Output is correct
2 Correct 46 ms 47352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47352 KB Output is correct
2 Correct 46 ms 47352 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 155000 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47352 KB Output is correct
2 Correct 866 ms 248408 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 825 ms 242836 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 673 ms 108216 KB Output is correct
2 Correct 499 ms 99028 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 859 ms 124172 KB Output is correct
2 Correct 182 ms 54904 KB Output is correct
3 Correct 825 ms 260452 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 54776 KB Output is correct
2 Correct 684 ms 118504 KB Output is correct
3 Correct 683 ms 85496 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 785 ms 112028 KB Output is correct
2 Correct 661 ms 106744 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 701 ms 110880 KB Output is correct
2 Correct 888 ms 85492 KB Output is correct