oj.uz

답안 #241470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241470 2020-06-24T08:29:09 Z kartel Mag (COCI16_mag) C++14
120 / 120
 535 ms 145272 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x.begin(), x.end())
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int f[N], i, n, u, v;
ll c[N], a, b;
vector <int> g[N];

void dfs(int v, int pr)
{
    f[v] = (c[v] == 1);

    for (auto u : g[v])
    {
        if (u == pr) continue;

        dfs(u, v);

        if (f[v]) f[v] = max(f[u] + 1, f[v]);
    }
}

void DFS(int v, int pr, int to)
{
    int mx[2];
    mx[0] = to;
    mx[1] = 0;

    for (auto u : g[v])
    {
        if (u == pr) continue;

        if (f[u] > mx[0]) swap(mx[0], mx[1]), mx[0] = f[u];
        else if (f[u] > mx[1]) mx[1] = f[u];
    }

    ll A = c[v];
    int B = mx[0] + mx[1] + 1;

//    cerr << v << ":" << A << " " << B << el;

    ll gcd = __gcd(A, 1ll * B);

    A /= gcd;
    B /= gcd;

    if (A * b < a * B)
        a = A, b = B;

    for (auto u : g[v])
    {
        if (u == pr) continue;

        int nto = 0;

        if (c[v] == 1)
        {
            nto++;
            if (f[u] == mx[0]) nto += mx[1];
                          else nto += mx[0];
        }

        DFS(u, v, nto);
    }
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i < n; i++)
    {
        cin >> u >> v;
        g[v].pb(u);
        g[u].pb(v);
    }

    a = 1e9;
    b = 1;

    for (i = 1; i <= n; i++) cin >> c[i], a = min(a, c[i]);

    dfs(1, -1);

    DFS(1, -1, 0);

    cout << a << "/" << b;
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 21 ms 23936 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23808 KB Output is correct
2 Correct 21 ms 23936 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 427 ms 89592 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 535 ms 144168 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 523 ms 142200 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 458 ms 66752 KB Output is correct
2 Correct 343 ms 55544 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 433 ms 67940 KB Output is correct
2 Correct 99 ms 28280 KB Output is correct
3 Correct 519 ms 145272 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 28284 KB Output is correct
2 Correct 463 ms 67320 KB Output is correct
3 Correct 357 ms 46000 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 64244 KB Output is correct
2 Correct 461 ms 66168 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 472 ms 67448 KB Output is correct
2 Correct 353 ms 45944 KB Output is correct