oj.uz

답안 #241452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241452 2020-06-24T08:11:59 Z kartel Mag (COCI16_mag) C++14
84 / 120
 664 ms 262148 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 +2000500
#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;

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

void dfs(ll v, ll 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)
{
    vector <int> vc;
    vc.pb(0);
    vc.pb(to);

    for (auto u : g[v])
    {
        if (u == pr) continue;
        vc.pb(f[u]);
        sort(vc.begin(), vc.end());
        reverse(vc.begin(), vc.end());
        vc.resize(2);
    }

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

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

    ll gcd = __gcd(A, 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] == vc[0]) nto += vc[1];
                          else nto += vc[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 35 ms 47480 KB Output is correct
2 Correct 32 ms 47360 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 47480 KB Output is correct
2 Correct 32 ms 47488 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47360 KB Output is correct
2 Runtime error 659 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 664 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 582 ms 94212 KB Output is correct
2 Correct 459 ms 82680 KB Output is correct

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 558 ms 96452 KB Output is correct
2 Correct 123 ms 52600 KB Output is correct
3 Runtime error 653 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 52600 KB Output is correct
2 Correct 589 ms 95844 KB Output is correct
3 Correct 504 ms 74488 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 533 ms 93548 KB Output is correct
2 Correct 571 ms 93432 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 599 ms 95592 KB Output is correct
2 Correct 457 ms 74104 KB Output is correct