oj.uz

답안 #991143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991143 2024-06-01T12:12:28 Z LOLOLO Mag (COCI16_mag) C++17
60 / 120
 281 ms 185980 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e6 + 10;
ll a[N];
int down[N], up[N], p[N];
vector <int> ed[N];

void dfs(int u, int v) {
    if (a[u] == 1)
        down[u] = 1;

    p[u] = v;
    int m1 = 0, m2 = 0;
    for (auto x : ed[u]) {
        if (x == v)
            continue;

        dfs(x, u);
        if (a[u] == 1) {
            down[u] = max(down[u], down[x] + 1);
            if (m1 < down[x]) {
                m2 = m1;
                m1 = down[x];
            } else {
                m2 = max(m2, down[x]);
            }
        }
    }

    for (auto x : ed[u]) {
        if (x == v)
            continue;

        if (a[u] == 1) {
            if (down[x] == m1) {
                up[x] = max(up[u] + 1, m2 + 2);
            } else {
                up[x] = max(up[u] + 1, m1 + 2);
            }
        }
    }
}

ll solve() {
    int n;
    cin >> n;

    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        ed[a].pb(b);
        ed[b].pb(a);
    }

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    dfs(1, 1);

    ll x = -1, y = 1;
    for (int i = 1; i <= n; i++) {
        int m1 = 0, m2 = 0;
        for (auto x : ed[i]) {
            if (x == p[i])
                continue;

            if (m1 < down[x]) {
                m2 = m1;
                m1 = down[x];
            } else {
                m2 = max(m2, down[x]);
            }
        }

        ll len = max(m1 + m2 + 1, up[i] + down[i] - 1);
        if (x == -1 || (x * len > a[i] * y)) {
            x = a[i];
            y = len;
        }
    }

    ll g = __gcd(x, y);
    cout << x / g << "/" << y / g << '\n';

    return 0;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);


    int t = 1;
    //cin >> t;
 
    while (t--) {
        solve();
    }
 
    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 27228 KB Output is correct
2 Correct 4 ms 29396 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 29276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 203 ms 103468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 29276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 270 ms 165200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 74580 KB Output is correct
2 Correct 182 ms 74576 KB Output is correct

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 193 ms 75712 KB Output is correct
2 Correct 33 ms 32848 KB Output is correct
3 Incorrect 281 ms 185980 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 32948 KB Output is correct
2 Correct 216 ms 90536 KB Output is correct
3 Correct 179 ms 61288 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 188 ms 72804 KB Output is correct
2 Correct 223 ms 90896 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 75344 KB Output is correct
2 Correct 174 ms 61268 KB Output is correct